System and method for adaptive multi-cultural searching and matching of personal names

Abstract

An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

Description

[0001] This application claims the benefit of U.S. Provisional Patent Application Ser. No. 60 / 079,233, filed Mar. 25, 1998, the entire disclosure of which is incorporated herein by reference. [0002] A portion of this disclosure contains material in which copyright is claimed by the applicant and / or others. The copyright owner has no objection to the copying of this material in the course of making copies of the application file or any patents that may issue on the application, but all other rights whatsoever in the copyrighted material are reserved.FIELD OF THE INVENTION [0003] The present invention relates generally to automatic data processing systems that search and retrieve records from a database based on matching of personal names, and to improved systems and methods for intelligently processing name comparisons. BACKGROUND OF THE INVENTION [0004] Information about individuals is often stored in a computer. Access to that information is most readily gained by using the name of...

AI Technical Summary

Benefits of technology

[0030] The present invention provides an improved automatic data processing system for searching names and an improved process for effectively searching and retrieving personal names in a database. It also provides a mechanism for a user to determine the distance between two names, i.e., how closely two personal names match.

[0033] In another preferred embodiment, the inventive search methodologies are implemented as Application Program Interfaces (APIs) that can be integrated into an existing program application or can be used to provide the foundation for a new program application that requires name matching capabilities. In API form, the features of the present invention may be selectively used in various combinations depending on the requirements of the particular application. A callable set of library routines include an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications, so as to achieve desired levels of precision and recall for name searching in widely varying operational settings.

Problems solved by technology

The nature of names, however, their behavior and permutations, pose significant challenges to information retrieval.

Other name search or information retrieval systems are generally unable to recognize or address the full range of variation in names.

These systems cannot accommodate even the slightest spelling variations, initials or abbreviations (JOS. Z. BROWN / JOSEPH ZACHARY BROWNE).

Other systems may use techniques or keys (such as Soundex or Soundex-like keys) that permit some minor spelling differences between names (DORSHER / DOERSHER),but these techniques generally fail to cope with significant variation (DOERSHER / DOESHER) or problems posed by names from non-Anglo cultures (ABDEL RALHMAN / ABDURRAMAN).

Some of the more common variants can be accommodated in this way, but retrieval is then limited to those items on the list and cannot accommodate new representations or random variation or keying errors (GOMEZ / BOMEZ).

Although spelling variations can often be addressed through character-matching techniques (e.g., SMITH / SMYTH), false-positive matches can result from traditional string or character comparisons when common morphological endings, such as OVICH, occur at the end of otherwise dissimilar names (e.g., ZELENOVICH / JOVANOVICH).

Character-based systems may also be confronted with significant retrieval problems caused by names with the same pronunciation but with divergent spellings.

Another common cause of name variation, which creates retrieval difficulty for name search systems, is the inclusion or exclusion of name data.

However, this system uses Soundex algorithms to process Unicode input for all cases, rather than providing a name searching system with culture-specific algorithms.

Its architecture included sets of algorithms applicable to different cultures, but no automatic classification of the cultural origin of a name.

None of these earlier systems provide a satisfactory system and method for multicultural name searching.

Images