A Dictionary-Based Approach to Fast and Accurate Name Matching in Large Law Enforcement Databases

Abstract

In the presence of dirty data, a search for specific information by a standard query (e.g., search for a name that is misspelled or mistyped) does not return all needed information. This is an issue of grave importance in homeland security, criminology, medical applications, GIS (geographic information systems) and so on. Different techniques, such as soundex, phonix, n-grams, edit-distance, have been used to improve the matching rate in these name-matching applications. There is a pressing need for name matching approaches that provide high levels of accuracy, while at the same time maintaining the computational complexity of achieving this goal reasonably low. In this paper, we present ANSWER, a name matching approach that utilizes a prefix-tree of available names in the database. Creating and searching the name dictionary tree is fast and accurate and, thus, ANSWER is superior to other techniques of retrieving fuzzy name matches in large databases.

DOI: 10.1007/11760146_7

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Kursun2006ADA, title={A Dictionary-Based Approach to Fast and Accurate Name Matching in Large Law Enforcement Databases}, author={Olcay Kursun and Anna Koufakou and Bing Chen and Michael Georgiopoulos and Kenneth M. Reynolds and Ronald Eaglin}, booktitle={ISI}, year={2006} }