Query string matching method and apparatus
First Claim
1. A method for increasing relevance of database search results, the method comprising:
- receiving a subject query string;
determining a trained edit distance between the subject query string and at least one candidate string using trained cost factors derived from a training set of labeled query transformations such that a trained cost factor comprises a sum of a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations; and
evaluating the at least one candidate string for selection based on the trained edit distance.
10 Assignments
0 Petitions
Accused Products
Abstract
In one implementation, a method is provided for increasing relevance of database search results. The method includes receiving a subject query string and determining a trained edit distance between the subject query string and a candidate string using trained cost factors derived from a training set of labeled query transformations. A trained cost factor includes a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations. The candidate string is evaluated the for selection based on the trained edit distance. In some implementations, the cost factors may take into account the context of a mutation. As such, in some implementations multi-dimensional matrices are utilized which include the trained cost factors.
-
Citations
60 Claims
-
1. A method for increasing relevance of database search results, the method comprising:
-
receiving a subject query string;
determining a trained edit distance between the subject query string and at least one candidate string using trained cost factors derived from a training set of labeled query transformations such that a trained cost factor comprises a sum of a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations; and
evaluating the at least one candidate string for selection based on the trained edit distance. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A method for increasing relevance of database search results, the method comprising:
-
receiving a subject query string;
determining a trained edit distance between the subject query string and at least one candidate string using multi-dimensional matrices comprising trained cost factors derived from a training set; and
evaluating the at least one candidate string for selection based on the trained edit distance. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29)
-
- 30. A method for estimating edit distance costs comprising calculating and combining conditional probabilities that a selected mutation will result in non-relevant transformations and that the selected mutation will result in relevant transformations based on a training set of labeled string pairs.
-
36. A method for increasing relevance of database search results, the method comprising:
-
receiving a subject query string;
determining a trained edit distance between the subject query string and at least one candidate string using multi-dimensional matrices comprising trained cost factors derived from a training set of labeled query transformations such that the trained cost factors each comprise a sum of a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations and such that the trained cost factors each include at least one of;
(a) trained costs based on a position of a mutation in a string, (b) trained costs of a mutation based on a size of a string, (c) trained costs of a mutation considering at least one other mutation within a string, (d) trained costs of a mutation in view of a character in a string, or (e) trained costs of a mutation in view of character combinations within a string; and
selecting a candidate string that is one of (a) an approximate match with the subject query string, or (b) an exact match with the subject query string based an evaluation of the trained edit distance of the at least one candidate string. - View Dependent Claims (37, 38, 39, 40)
-
-
41. A system for improved database searching, the system comprising:
-
a computer adapted to receive a subject query string for searching a searchable database;
a processor associated with the computer, the processor being programmed to;
determine a trained edit distance between the subject query string and at least one candidate string from the searchable database using trained cost factors derived from a training set of labeled query transformations such that a trained cost factor comprises a sum of a conditional probability for mutations in labeled non-relevant query transformations and a conditional probability for mutations in labeled relevant query transformations; and
perform an evaluation of the at least one candidate string for selection based on the trained edit distance; and
return a search result based on the evaluation. - View Dependent Claims (42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53)
-
-
54. A computer readable medium comprising computer-executable instructions for performing query string matching, the method comprising:
-
receiving a subject query string;
determining a trained edit distance between the subject query string and at least one candidate string using cost factors comprising conditional probabilities that a selected mutation will result in non-relevant transformations and that the selected mutation will result in relevant transformations based on a training set of labeled string pairs; and
evaluating the at least one candidate string for selection based on the trained edit distance. - View Dependent Claims (55, 56, 57, 58, 59, 60)
-
Specification