Query revision using known highly-ranked queries
AssigneeGoogle Inc.
InventorsDavid Bailey, Alexis Battle, David Cohn, Barbara Engelhardt, P. Nayak
Life of this patent
Estimating the term…
Loading patent…
AssigneeGoogle Inc.
InventorsDavid Bailey, Alexis Battle, David Cohn, Barbara Engelhardt, P. Nayak
Estimating the term…
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.
A method for automatically suggesting known highly-ranked queries in response to a first query, comprising:
A method for automatically suggesting known highly-ranked queries in response to a first query, comprising:
A method of identifying a query as a known highly-ranked query, comprising:
A computer program product for automatically suggesting known highly-ranked queries in response to a first query, the computer program product comprising:
A computer program product for identifying a query as a known highly-ranked query, the computer program product comprising:
A system for providing revised queries for a query as a known highly-ranked query, the system comprising:
A system for providing revised queries for identifying a query as a known highly-ranked query, the system comprising:
Dependencies are inferred from the claim text.