Abstract: According to one embodiment of the present invention, a method for name searching in mixed-entity lists is provided which comprises dividing a mixed list of entities into a plurality of entity-specific lists. A name to be searched is then categorized into a category and a specialized search logic is applied to the name to be searched. The specialized search logic is selected to be adapted to the category and uses a one of the entity-specific lists that corresponds to the category of the name to be searched. A shared search logic may also be employed, which is used for all names to be searched.

Abstract: According to one embodiment of the present invention, a method for name searching in mixed-entity lists is provided which comprises dividing a mixed list of entities into a plurality of entity-specific lists. A name to be searched is then categorized into a category and a specialized search logic is applied to the name to be searched. The specialized search logic is selected to be adapted to the category and uses a one of the entity-specific lists that corresponds to the category of the name to be searched. A shared search logic may also be employed, which is used for all names to be searched.

Abstract: According to one embodiment of the present invention, a method for name searching in mixed-entity lists is provided which comprises dividing a mixed list of entities into a plurality of entity-specific lists. A name to be searched is then categorized into a category and a specialized search logic is applied to the name to be searched. The specialized search logic is selected to be adapted to the category and uses a one of the entity-specific lists that corresponds to the category of the name to be searched. A shared search logic may also be employed, which is used for all names to be searched.

Abstract: According to one embodiment of the present invention, a method for name searching in mixed-entity lists is provided which comprises dividing a mixed list of entities into a plurality of entity-specific lists. A name to be searched is then categorized into a category and a specialized search logic is applied to the name to be searched. The specialized search logic is selected to be adapted to the category and uses a one of the entity-specific lists that corresponds to the category of the name to be searched. A shared search logic may also be employed, which is used for all names to be searched.

Abstract: A system and method for improved name matching using regularized name forms is presented. A regularization rule engine uses culture-specific regularization rules to iteratively convert candidate names and query names to a canonical form, which are regularized candidate names and regularized query names, respectively. The regularization rules are context-sensitive or context-free rules that pertain to a name's originating culture. Subsequently, a name search engine compares the regularized query name with the regularized candidate names and identifies the regularized candidate names that meet a particular regularization matching threshold. In turn, name search engine selects the candidate names that correspond to the identified regularized candidate names and provides the selected candidate names to a user.

Abstract: A system and method for improved name matching using regularized name forms is presented. A regularization rule engine uses culture-specific regularization rules to iteratively convert candidate names and query names to a canonical form, which are regularized candidate names and regularized query names, respectively. The regularization rules are context-sensitive or context-free rules that pertain to a name's originating culture. Subsequently, a name search engine compares the regularized query name with the regularized candidate names and identifies the regularized candidate names that meet a particular regularization matching threshold. In turn, name search engine selects the candidate names that correspond to the identified regularized candidate names and provides the selected candidate names to a user.

Abstract: Disclosed is a system, method, and program for generating a data structure for use by a computer in determining a location of boundaries in text. The data structure is initialized and at least one regular expression is processed. Input characters in the at least one regular expression are then processed to determine at least one transition to at least one state. A determination is then made as to whether one input character would cause a non-deterministic transition. Additional states are added to the data structure to transform the non-deterministic transition to a deterministic transition.

Abstract: Disclosed is a system, method, and program for determining boundaries in a string of characters using a dictionary, wherein the substrings in the dictionary may comprise words. A determination is made of all possible initial substrings of the string in the dictionary. One initial substring is selected such that all the characters following the initial substring can be divided into at least one substring in the dictionary. The boundaries follow each of the initial substring and the at least one substring that includes all the characters following the initial substring.

Abstract: Disclosed is a system, method, and program for generating a table for use by a computer in determining a location of a boundary, such as a word boundary, between two characters in text. A first table indicates a boundary between characters when processing text in a first direction, such as the forward direction. A second table is generated based on the content of the first table. The second table can be used to determine whether one boundary is located between any two consecutive characters processed in a second direct ion, such as the backward direction.

Abstract: Disclosed is a system, method, and program for generating a data structure in computer memory for storing strings, such as words in a dictionary. Each string includes at least one character from a set of characters. An arrangement of nodes is determined to store the characters such that the arrangement of the nodes is capable of defining a tree structure. An array data structure is generated to store the nodes. The array includes a row for each node and a column for each character in the set of characters. A non-empty cell identifies a node for the character indicated in the column of the cell that has descendant nodes in the row indicated in the cell content for the node. The array data structure is processed to eliminate at least one row in the array data structure to reduce a number of bytes needed to represent the array data structure. In this way, the array data structure following the processing requires less bytes of storage space then before the processing.