Record number :
Title of article :
Approximate personal name-matching through finite-state graphs
Author/Authors :
Carmen Galvez ، نويسنده , , Félix Moya-Aneg?n، نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2007
Pages :
From page :
To page :
Abstract :
This article shows how finite-state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientistsʹ work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite-state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite-state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings.
Journal title :
Journal of the American Society for Information Science and Technology
Serial Year :
Link To Document :