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