Corporate Author Entry Records Retrieved by Use of Derived Truncated Search Keys

Landgraf, Alan L.; Rastogi, Kunj B.; Long, Philip L.

doi:10.6017/ital.v6i3.5774

Cited by 4 publications

(1 citation statement)

References 3 publications

(1 reference statement)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Record (entry) retrieval from large on-line catalogs has been intensively investigated (1)(2)(3)(4)(5)(6)(7), and the use of derived truncated search keys has proved in operation to be an effective method of retrieving entries from nametitle and title-only catalogs (5)(6)(7). The use of search keys derived from personal author and corporate author names for retrieval from on-line bibliographic files has also been studied (8)(9).…”

Section: Introductionmentioning

confidence: 99%

The relationship between author names and author entries in a large on‐line union catalog as retrieved using truncated keys

Smith

Rush

1977

J. Am. Soc. Inf. Sci.

View full text Add to dashboard Cite

A study was undertaken to determine the effectiveness of certain truncated‐key structures in retrieving sets of bibliographic records that represent works authored by a single individual. The results show that a key of the form 4,3,1 retrieved one personal author name 98% of the time. A key of the same form retrieved one corporate author name 82% of the time. A stop‐list is necessary to eliminate certain troublesome words in corporate names.

show abstract

Section: Introductionmentioning

confidence: 99%

The relationship between author names and author entries in a large on‐line union catalog as retrieved using truncated keys

Smith

Rush

1977

J. Am. Soc. Inf. Sci.

View full text Add to dashboard Cite

show abstract

Derived search keys for government documents

Hickey

Rypka

1979

Information Processing & Management

View full text Add to dashboard Cite

Theory of search keys and applications in retrieval techniques used by catalogers

Egghe

1992

Mathematical and Computer Modelling

View full text Add to dashboard Cite

This paper constructs a model for studying the performance of search keys of several types (such as, e.g., author/title keys of the form 414, 313, 3/1/1/l, and so on), end gives a criterion for deciding whether or not to use one (or several) more slashes (1) (i.e., more truncated title words) in a certain system (e.g., an automated library catalog). Some mathematical theorems on search keys are proved, given the probability distribution of letters (more general: symbols) in words. We then study the effect (on search key performance) of enlarging the " alphabet," i.e., when adding new symbols, that can be used in forming the search keys. Changing the alphabet might cause a change of optimal search keys. Criteria for this (not) to happen are given. The last part of the paper deals with the difference in average performance (averaged over ah possible systems) of search keys with less or more slashes (I). In general, we can prove that, on the average, introducing slashes does not improve the retrieval performance. Obviously, we can note the following trivial relations: ,~s < ,u2 and plilil < plil.

show abstract

Corporate Author Entry Records Retrieved by Use of Derived Truncated Search Keys

Cited by 4 publications

References 3 publications

The relationship between author names and author entries in a large on‐line union catalog as retrieved using truncated keys

The relationship between author names and author entries in a large on‐line union catalog as retrieved using truncated keys

Derived search keys for government documents

Theory of search keys and applications in retrieval techniques used by catalogers

Contact Info

Product

Resources

About