doi: 10.6017/ital.v3i4.5259

An Algorithm for Variable-Length Proper-Name Compression

James L. Dolby

Abstract


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.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.


http://napoleon.bc.edu/ojs/public/site/images/ejadmin/lita_67

 

ISSN:2163-5226