Thesaurus |
Biblioscape |
Bookends (Mac) |
Library Master |
Procite |
EndNote |
Reference Manager |
Papyrus (Mac) |
no: no, but folders and notes can be organized in hierarchical way; records (not entires) can be linked via different links |
no |
LM: no |
Pr: no |
En: no |
RM: no |
Papyrus: yes : keywords System list |
1 Link types: BT/NT; NTG/BTG; RT; USE/UF; TT/NT; |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: built-in types: sub/super- category; synonyms; antonyms; closely related; other can be created under user's control |
2 Links are automatically bidirectional |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: yes |
3 Links can be edited (i.e. change without detaching entries) |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no: have to be deleted and recreated |
4 Can create kw while making links |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no, can only link existing entries |
5 Links are validated and controlled, e.g.:
-- a Narrower Term (sub-) cannot also be Broader Term (super-) of its Broader Term
-- a rejected term (Used for) cannot be used
-- no term can refer to itself
|
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no (except that no term can refer to itself) |
6 SN Scope notes |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no |
7 Multilingual links codes |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no |
8 Can import list of unlinked/linked entries |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: yes, only unlinked |
9 List is relationally linked to database records |
Bscp: n.a. |
|
: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: yes |
10 List can be used from records during input |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: yes |
11 List can be used during search:
1. browsing
2. navigation
3. direct search
4. list itself can be searched |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: 1 2 3; search can take into account a) type of link (include exclude) b) depth of link: up- down- posting |
12 Output
1. screen preview
2. printout |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: 1 (not the whole structured list but any entry in its whole arborescence); (2 print the mere list of entries without links) |
13 Output layout
1. alphabetic with links and their codes
2. systematic with alphabetically listed subentries
3. permuted: KWIC, KWOC ...
4. hierarchical (TT + alphabetic list; TT + hierarchical list; TT only) |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: 1 (only print preview: not the whole list, but complete tree of any term) |
14 Statistics |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no |
15 Other, e.g.: provisions for candidate descriptors, identifiers, polihierarchy ... |
Bscp: n.a. |
BK: n.a. |
LM: n.a. |
Pr: n.a. |
En: n.a. |
RM: n.a. |
Papyrus: no (polihierarchy allowed as links are not controlled) |