Library Technology Guides

Document Repository

An algorithm for variable-length proper-name compression

Journal of library automation [December 1970]


Abstract: Viable on-line search systems require reasonable capabilities to automatically detect (and hopefully correct) variations between request format. An important requirement is the solution of the problem of matching proper names, not only become both input specifications and storage specifications are subject to error, but also because various transliteration schemes exist and can provide variant proper name forms in the same data base. This paper reviews several proper name matching schemes and provides an updated version of these schemes which tests out nicely on the proper name equivalence classes suburban telephone book. An appendix list the corpus of names used for algorithm test.

View Citation
Publication Year:1970
Type of Material:Article
Language English
Published in: Journal of library automation
Publication Info:Volume 3 Number 04
Issue:December 1970
Publisher:Information Science and Automation Division
Place of Publication:Chicago, IL
Record Number:2015
Last Update:2024-03-22 09:05:23
Date Created:0000-00-00 00:00:00