System and method for database searching using fuzzy rules
AssigneeData Trace Information Services, LLC
InventorEdward M. Schwalb
Life of this patent
Estimating the term…
Abstract
An apparatus and method for database searching using fuzzy rules is presented. The apparatus and method may accept a word or word phrase such as a persons name and returns fuzzy rules for database searching. Applicable search rules are selected and word or word phrase equivalents are displayed to a user. The user accepts or rejects each of the word or word phrase. The word or word phrase along with the user's acceptance or rejection are stored in a sample database. The fuzzy rules are modified according to the data in the sample database. The database is filtered by training and testing portions of the database for accuracy and purging the least accurate portions.
Claims16
A machine storage medium for performing a name search comprising instructions that upon execution cause a processor to:
- receive a name of a person;
- apply a plurality of fuzzy search rules to the name to generate name equivalents;
- apply a plurality of learned rules to the name equivalents to generate at least one stricken name equivalent and at least one non-stricken name equivalent, wherein the at least one stricken name equivalent has been previously rejected by a user;
- display the at least one stricken name equivalent and the at least one non-stricken name equivalent;
- receive a rejection for the at least one stricken name equivalent or the at least one non-stricken name equivalent;
- and
- modify at least one of the plurality of learned rules based on the rejection.
A readable storage medium for training a computer to perform a fuzzy name search comprising instructions that upon execution cause the computer to:
- receive a name from a list of names;
- apply a plurality of fuzzy search rules to the name to generate name equivalents;
- apply a plurality of learned rules to the name equivalents to generate at least one stricken name equivalent and at least one non-stricken name equivalent, wherein the at least one stricken name equivalent has been previously rejected by a user;
- display the at least one stricken name equivalent and the at least one non-stricken name equivalent;
- accept or reject the at least one stricken name equivalent and the at least one non-stricken name equivalent;
- and
- modify the plurality of learned rules based on the accepting or rejecting.
Dependencies are inferred from the claim text.