A dictionary-based approach to fast and accurate name matching in large law enforcement databases

    Authors

    O. Kursun; A. Koufakou; B. Chen; M. Georgiopoulos; K. M. Reynolds;R. Eaglin

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Keywords

    Computer Science, Artificial Intelligence; Computer Science, Information; Systems; Computer Science, Interdisciplinary Applications; Computer; Science, Theory & Methods

    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.

    Journal Title

    Intelligence and Security Informatics, Proceedings

    Volume

    3975

    Publication Date

    1-1-2006

    Document Type

    Article

    Language

    English

    First Page

    72

    Last Page

    82

    WOS Identifier

    WOS:000238207800007

    ISSN

    0302-9743; 3-540-34478-0

    Share

    COinS