发明名称 |
Query rewrites for generating auto-complete suggestions |
摘要 |
A computer-implemented method for proving complete query suggestions, performed by a server system, includes receiving a partial search query from a client system. A database of complete search queries is searched to identify a first set of matching complete search queries. If the first set of matching complete search queries fails to satisfy predefined criteria (e.g., with respect to the quantity and/or quality of the matching complete search queries), a rewrite of the received partial search query is performed to produce a first set of rewritten partial search queries. The database of complete search queries is searched to identify a second set of complete search queries matching any of the first set of rewritten partial search queries. At least a subset of the second set of matching complete queries are sent to the client system. |
申请公布号 |
US9235654(B1) |
申请公布日期 |
2016.01.12 |
申请号 |
US201313759926 |
申请日期 |
2013.02.05 |
申请人 |
Google Inc. |
发明人 |
Gupta Nitin;Niechwiej Bartlomiej M.;Das Abhinandan Sujit |
分类号 |
G06F17/30 |
主分类号 |
G06F17/30 |
代理机构 |
|
代理人 |
|
主权项 |
1. A method, performed by a server system having one or more processors and memory storing one or more programs for execution by the one or more processors, comprising:
receiving from a client system a partial search query having a plurality of query terms; searching a database of complete search queries to identify a first set of matching complete queries; in accordance with a determination that the first set of matching complete queries fails to satisfy predefined criteria:
performing a rewrite of the received partial search query to produce a first set of rewritten partial search queries, wherein the first set of rewritten partial search queries includes at least one rewritten partial search query that (A) includes a synonym of a respective query term of the received partial search query, or (B) includes fewer respective non-stop word query terms than the received partial search query, wherein performing the rewrite includes dropping no more than a maximum number of query terms, the maximum number of query terms being based on a difference between a number of query terms in the partial search query and one of the respective rewritten partial search queries rewritten based on (A) or (B);searching the database of complete search queries to identify a second set of matching complete queries that match any of the first set of rewritten partial search queries; andsending at least a subset of the second set of matching complete queries to the client system. |
地址 |
Mountain View CA US |