International Business Machines Corporation

David Edward Biesenbach

Charles Kinston Williams

Stephen John Watjen

Steven J Liddle

Frankie Elizabeth Patman Maguire

Richard Theodore Gillam

Leonard Arthur Shaefer, Jr

Provided are a computer implemented method, computer program product, and system for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.

Name search using multiple bitmap distributions

Provided are techniques for matching names. For a first bitmap distribution, it is determined whether a first bitmap signature of a query name and a second bitmap signature of a target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a first preliminary value. For a second bitmap distribution that is different from the first bitmap distribution, it is determined whether a third bitmap signature of the query name and a fourth bitmap signature of the target name have a number of character n-grams overlapping that meet or exceed a threshold to generate a second preliminary value. The first preliminary value and the second preliminary value are combined, and, if the combination results in a value of true, it is determined that the query name and the target name are to be further processed.

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.

Growing community of inventors

Alexandria, VA, United States of America

David Edward Biesenbach