Sifting

Many search problems are caused by sequence variations. The inability to determine the order of words for a particular entity occurs at both data entry and inquiry time. The name Frank Lee for example, could have been Lee Frank. This problem is particularly pervasive in company names.

The inability to predict the significant name with respect to word position causes many searches to fail.

For example, the different permutations of the words in the input are matched:

Merging foreign database files causes other sequence variations. This frequently occurs when external lists are purchased or companies consolidate information. Inconsistent methodologies for data capture make the standardization of name fields impossible. Aggravating the sequence problem are those instances in which company names are intermixed with personal names.

All of these factors, in addition to human error, contribute to identification problems caused by sequence variations. NameSearch provides a facility for handling these problems.

To understand this better we will draw an analogy between a telephone book and a database system. When we look for Frank Lee we search the "L" section. If the name is not there, we continue the search by looking in the "F" section. In order to find Frank Lee we had to search two separate sections of the phone book. Suppose we were looking for Frank Lee Ray. To ensure success we must search all the permutations. This is an extremely arduous and time consuming process for both people and computers. By listing Frank Lee in both the L and F sections, regardless of order, only one section would need to be searched.

More Advanced NameSearch Capabilities:

Spelling Error Processing
Rulebase Expertise
Phonetic Error Processing
Sorting through missing, extra, or noise words
Acronym Recognition

< back>