Open AccessPerformance of Ruecking's Word-compression Method When Applied to Machine Retrieval from a Library Catalog
Author(s) -
BenAmi Lipetz,
Peter Stangl,
Kathryn F. Taylor
Publication year - 1969
Publication title -
information technology and libraries
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.502
H-Index - 34
eISSN - 2163-5226
pISSN - 0730-9295
DOI - 10.6017/ital.v2i4.4668
Subject(s) - computer science , information retrieval , library catalog , word (group theory) , matching (statistics) , document retrieval , recall , precision and recall , data compression , data mining , artificial intelligence , world wide web , philosophy , statistics , linguistics , mathematics
F. H. Ruecking's word-compression algorithm for retrieval of bibliographic data from computer stores was tested for performance in matching user-supplied, unedited bibliographic data to the bibliographic data contained in a library catalog. The algorithm was tested by manual simulation, using data derived from 126 case studies of successful manual searches of the card catalog at Sterling Memorial Library, Yale University. The algorithm achieved 70% recall in comparison to conventional searching. Its accepta- bility as a substitute for conventional catalog searching methods is ques- tioned unless recall performance can be improved, either by use of the algorithm alone or in combination with other algorithms