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...

Full description

Saved in:
Bibliographic Details
Main Authors BIESENBACH DAVID E, WATJEN STEPHEN J, LIDDLE STEVEN J, WILLIAMS CHARLES K
Format Patent
LanguageEnglish
Published 21.04.2015
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:Application Number: US201213445839