David E Biesenbach

US Patent:

20080215562, Sep 4, 2008

Filed:

Mar 2, 2007

Appl. No.:

11/681333

Inventors:

David Edward Biesenbach - Alexandria VA, US
Richard Theodore Gillam - Chantilly VA, US
Frankie Elizabeth Patman Maguire - Washington DC, US
Leonard Arthur Shaefer - Leesburg VA, US
Charles Kinston Williams - Fairfax VA, US

International Classification:

G06F 17/30

US Classification:

707 5, 707E17075

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.

US Patent:

20130185326, Jul 18, 2013

Filed:

Jan 18, 2012

Appl. No.:

13/353252

Inventors:

David E. BIESENBACH - Alexandria VA, US
Steven J. LIDDLE - Vienna VA, US
Stephen J. WATJEN - Ashburn VA, US
Charles K. WILLIAMS - Oak Hill VA, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 17/30

US Classification:

707769, 707E17014

Abstract:

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.

US Patent:

20130185327, Jul 18, 2013

Filed:

Apr 12, 2012

Appl. No.:

13/445839

Inventors:

David E. BIESENBACH - Alexandria VA, US
Steven J. LIDDLE - Vienna VA, US
Stephen J. WATJEN - Ashburn VA, US
Charles K. WILLIAMS - Oak Hill VA, US

Assignee:

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

International Classification:

G06F 17/30

US Classification:

707769, 707E17014

Abstract:

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.