Abstract: A disclosed parsing system automatically parses culturally diverse names using culture-specific parsing algorithms. The culture-specific parsing algorithms may use statistical information describing name phrases of the name to separate the name phrases into a title, a given name, a surname, and a qualifier. In one or more systems, the validity of a parse of a name is determined, and names for which an invalid parse has been generated may be parsed again. Multiple names indicated by a conjoined name construct may be parsed individually. Name phrases that may include multiple tokens of a name are identified and used as a basis for parsing and other processing of the name.

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.

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.

Abstract: A system that identifies related names includes a datastore that persistently stores a collection of names. At least one name within the datastore is represented both by a native orthographic form of the name and by a transliterated form of the native orthographic form of the name. The system includes an input interface that is structured and arranged to receive at least an input name. A transliteration module is structured and arranged to produce at lease one transliterated form of the input name. An identifier is structured and arranged to identify at least one name from within the datastore that relates to the transliterated form of the input name. An output interface presents the at least one name identified from within the datastore as being related to the input name.