System and method for searching and matching databases
First Claim
Patent Images
1. A method comprising:
- receiving input data having a plurality of elements;
converting selected elements in said plurality of elements to a set of terms;
generating a plurality of keys from said set of terms;
determining from stored data (a) optimization of said plurality of keys, thus yielding optimized keys, and (b) candidates that share a commonality with said optimized keys, thus yielding key intersections and a quantity for said key intersections;
generating a cost function for said key intersections;
prioritizing said key intersections according to said cost function, thus yielding cost-prioritized key intersections;
retrieving match candidates in order of said cost-prioritized key intersections, and bounded by a pre-determined threshold and said quantity; and
selecting a best match from said match candidates.
5 Assignments
0 Petitions
Accused Products
Abstract
A system and method for finding a business entity in a database that matches input data. A web services interface accepts a match request and provides a best match. A pre-processing layer cleans, parses, and standardizes input data into terms. An application layer includes a match engine for processing the match request using the terms. The match engine evaluates and scores match candidates from the database to provide the best match and, optionally, an ordered list of match candidates.
73 Citations
20 Claims
-
1. A method comprising:
-
receiving input data having a plurality of elements; converting selected elements in said plurality of elements to a set of terms; generating a plurality of keys from said set of terms; determining from stored data (a) optimization of said plurality of keys, thus yielding optimized keys, and (b) candidates that share a commonality with said optimized keys, thus yielding key intersections and a quantity for said key intersections; generating a cost function for said key intersections; prioritizing said key intersections according to said cost function, thus yielding cost-prioritized key intersections; retrieving match candidates in order of said cost-prioritized key intersections, and bounded by a pre-determined threshold and said quantity; and selecting a best match from said match candidates. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A system comprising:
-
(A) web services interface for accepting a match request and providing a best match; (B) pre-processing layer having a cleaning, parsing, and standardizing component for converting input data into a set of terms; (C) an application layer for; generating a plurality of keys from said set of terms, determining from stored data (a) optimization of said plurality of keys, thus yielding optimized keys, and (b) candidates that share a commonality with said optimized keys, thus yielding key intersections and a quantity for said key intersections; generating a cost function for said key intersections; prioritizing said key intersections according to said cost function, thus yielding cost-prioritized key intersections; obtaining match candidates in order of said cost-prioritized key intersections, and bounded by a pre-determined threshold and said quantity; and selecting said best match from said match candidates; and (D) a database layer for retrieving said candidates from stored business entity information for said application layer. - View Dependent Claims (15, 16, 17)
-
-
18. A computer readable medium comprising instructions for performing a method that includes:
-
receiving input data having a plurality of elements; converting selected elements in said plurality of elements to a set of terms; generating a plurality of keys from said set of terms; determining from stored data (a) optimization of said plurality of keys, thus yielding optimized keys, and (b) candidates that share a commonality with said optimized keys, thus yielding key intersections and a quantity for said key intersections; generating a cost function for said key intersections; prioritizing said key intersections according to said cost function, thus yielding cost-prioritized key intersections; retrieving match candidates in order of said cost-prioritized key intersections, and bounded by a pre-determined threshold and said quantity; and selecting a best match from said match candidates. - View Dependent Claims (19, 20)
-
Specification