Open AccessAn Algorithm for Variable-Length Proper-Name Compression
Author(s) -
James L. Dolby
Publication year - 1970
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.v3i4.5259
Subject(s) - computer science , transliteration , proper noun , matching (statistics) , equivalence (formal languages) , information retrieval , algorithm , base (topology) , database , data mining , natural language processing , artificial intelligence , mathematics , statistics , mathematical analysis , discrete mathematics
Viable on-line search systems require reasonable capabilities to automatically detect (and hopefully correct) variations between request format and stored format. An important requirement is the solution of the problem of matching proper names, not only because 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 of a suburban telephone book. An appendix lists the corpus of names used for algorithm test