Query revision using known highly-ranked queries
First Claim
Patent Images
1. A computer-implemented method comprising:
- ranking, using one or more computers, indexed queries based on a respective query rank of each indexed query, the query rank calculated based on a frequency of occurrence of the indexed query and a user satisfaction score of the indexed query, the indexed queries including highly-ranked queries and nearby queries that are queries that have a statistically significant probability of being revised to one of the highly-ranked queries, wherein the user satisfaction score of a particular indexed query is determined from estimates of lengths of clicks on search results, wherein the estimates of the lengths of clicks on search results are based on a duration of time from a selection of a search result for the particular indexed query to a subsequent selection of another search result;
calculating a respective revision score for each indexed query as a function of a revision probability of a first query and the respective query rank for the particular indexed query, the revision probability based on at least one of a semantic similarity or syntactic similarity between the first query and the particular indexed query;
selecting one of the indexed queries as an alternative query to the first query based on the respective revision score of the selected query; and
providing the selected query as a suggested revision for the first query.
2 Assignments
0 Petitions
Accused Products
Abstract
An information retrieval system includes a query revision architecture providing one or more query revisers, each of which implements a query revision strategy. A query rank reviser suggests known highly-ranked queries as revisions to a first query by initially assigning a rank to all queries, and identifying a set of known highly-ranked queries (KHRQ). Queries with a strong probability of being revised to a KHRQ are identified as nearby queries (NQ). Alternative queries that are KHRQs are provided as candidate revisions for a given query. For alternative queries that are NQs, the corresponding known highly-ranked queries are provided as candidate revisions.
93 Citations
27 Claims
-
1. A computer-implemented method comprising:
-
ranking, using one or more computers, indexed queries based on a respective query rank of each indexed query, the query rank calculated based on a frequency of occurrence of the indexed query and a user satisfaction score of the indexed query, the indexed queries including highly-ranked queries and nearby queries that are queries that have a statistically significant probability of being revised to one of the highly-ranked queries, wherein the user satisfaction score of a particular indexed query is determined from estimates of lengths of clicks on search results, wherein the estimates of the lengths of clicks on search results are based on a duration of time from a selection of a search result for the particular indexed query to a subsequent selection of another search result; calculating a respective revision score for each indexed query as a function of a revision probability of a first query and the respective query rank for the particular indexed query, the revision probability based on at least one of a semantic similarity or syntactic similarity between the first query and the particular indexed query; selecting one of the indexed queries as an alternative query to the first query based on the respective revision score of the selected query; and providing the selected query as a suggested revision for the first query. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising:
-
ranking indexed queries based on a respective query rank of each indexed query, the query rank calculated based on a frequency of occurrence of the indexed query and a user satisfaction score of the indexed query, the indexed queries including highly-ranked queries and nearby queries that are queries that have a statistically significant probability of being revised to one of the highly-ranked queries, wherein the user satisfaction score of a particular indexed query is determined from estimates of length of click on search result, wherein the estimates of the lengths of clicks on search results are based on a duration of time from a selection of a search result for the particular indexed query to a subsequent selection of another search result; calculating a respective revision score for each indexed query as a function of a revision probability of a first query and the respective query rank for the particular indexed query, the revision probability based on at least one of a semantic similarity or syntactic similarity between the first query and the particular indexed query; selecting one of the indexed queries as an alternative query to the first query based on the respective revision score of the selected indexed query; and providing the selected query as a suggested revision for the first query. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
19. A system comprising:
-
memory; one or more processors coupled to the memory and configured to perform operations comprising; ranking indexed queries based on a respective query rank of each indexed query, the query rank calculated based on a frequency of occurrence of the indexed query and a user satisfaction score of the indexed query, the indexed queries including highly-ranked queries and nearby queries that are queries that have a statistically significant probability of being revised to one of the highly-ranked queries, wherein the user satisfaction score of a particular indexed query is determined from estimates of lengths of clicks on search results, wherein the estimates of the lengths of clicks on search results are based on a duration of time from a selection of a search result for the particular indexed query to a subsequent selection of another search result; calculating a respective revision score for each indexed query as a function of a revision probability of a first query and the respective query rank for the particular indexed query, the revision probability based on at least one of a semantic similarity or syntactic similarity between the first query and the particular indexed query; selecting one of the indexed queries as an alternative query to the first query based on the respective revision score of the selected indexed query; and providing the selected query as a suggested revision for the first query. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
Specification