公开(公告)号：US09298828B1

公开(公告)日：2016-03-29

申请号：US13666936

申请日：2012-11-01

Applicant: GOOGLE INC.

Inventor： Abhinandan Sujit Das ,  Anwis Das ,  Nitin Gupta

IPC: G06F17/30

CPC classification number: G06F17/30864

Abstract: A computer-implemented method for identifying search results satisfying a search query received from a user includes obtaining a set of ranked search results that satisfies the search query, and identifying, using historical search query data, a search result that was selected by users who issued the search query and that corresponds to at least one related search query in at least one chain of related search queries that are related to the search query. The method further includes determining, using the historical search query data, a frequency that the search query led to a selection of the identified search result; inserting the identified search result into the set of ranked search results based on the frequency that the search query led to the selection of the identified search result; and returning the set of ranked search results to the user.

Abstract translation: 用于识别满足从用户接收的搜索查询的搜索结果的计算机实现的方法包括获得满足搜索查询的排列搜索结果的集合，以及使用历史搜索查询数据来识别由发布的用户选择的搜索结果 所述搜索查询对应于与所述搜索查询相关的至少一个相关搜索查询链中的至少一个相关搜索查询。 该方法还包括：使用历史搜索查询数据确定搜索查询导致对所识别的搜索结果的选择的频率; 基于搜索查询导致对所识别的搜索结果的选择的频率将所识别的搜索结果插入到所述一组排名的搜索结果中; 并将该组排名的搜索结果返回给用户。

公开(公告)号：US09405834B1

公开(公告)日：2016-08-02

申请号：US13666930

申请日：2012-11-01

Applicant: GOOGLE INC.

Inventor： Abhinandan Sujit Das ,  Anwis Das ,  Nitin Gupta

IPC: G06F17/30

CPC classification number: G06F17/30864

Abstract: A computer-implemented method for identifying related search queries is performed on a server. The method includes receiving a search query from a user, identifying a set of ranked search results satisfying the search query, and identifying, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, each respective related search query in the at least one chain of related search queries except for the at least one last related search query in the at least one chain of related search queries violating a search result selection criterion. The method further includes returning the set of ranked search results and the at least one last related search query to the user.

Abstract translation: 在服务器上执行用于识别相关搜索查询的计算机实现的方法。 该方法包括从用户接收搜索查询，识别满足搜索查询的一组排名的搜索结果，以及使用历史搜索查询数据在至少一个相关搜索查询链中识别至少一个最后相关的搜索查询，该搜索查询是 与所述搜索查询相关并且包括由发布所述搜索查询的用户选择的至少一个搜索结果，所述至少一个相关搜索查询链中的每个相关搜索查询除了所述至少一个最后相关搜索查询之外 所述至少一个相关搜索查询链违反搜索结果选择标准。 该方法还包括将一组排名的搜索结果和至少一个最后相关的搜索查询返回给用户。

公开(公告)号：US09342626B1

公开(公告)日：2016-05-17

申请号：US14038392

申请日：2013-09-26

Applicant: Google Inc.

Inventor： Anwis Das ,  Abhinandan Sujit Das ,  Nitin Gupta ,  Renshen Wang

IPC: G06F17/30

CPC classification number: G06F17/3097

Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations, the similarity measure of the given candidate query suggestion may be based on a comparison of current entities of the given candidate query suggestion that match entities of one or more past queries, to a group of the current entities that includes entities that do not match the entities of one or more past queries. In some implementations a ranking of the candidate query suggestions may be determined based on the similarity measure.

Abstract translation: 基于用户提交的一个或多个过去查询向用户提供查询建议的方法和装置。 可以识别响应于当前查询的候选查询建议。 可以基于与给定候选查询建议相关联的匹配实体和一个或多个过去查询来确定给定候选查询建议的候选查询相似性度量。 在一些实现中，给定候选查询建议的相似性度量可以基于将与一个或多个过去查询的实体相匹配的给定候选查询建议的当前实体与包括实体的当前实体的组的比较 不符合一个或多个过去查询的实体。 在一些实现中，可以基于相似性度量来确定候选查询建议的排名。

公开(公告)号：US09378247B1

公开(公告)日：2016-06-28

申请号：US14574081

申请日：2014-12-17

Applicant: Google Inc.

Inventor： Abhinandan S. Das ,  Anwis Das

IPC: G06F17/30

CPC classification number: G06F17/30522 ,  G06F17/30064 ,  G06F17/30864 ,  G06F17/3097

Abstract: Methods, systems, and apparatus, including computer program products, for generating query refinements from user preference data. A group of query pairs are obtained. Each query pair includes a first query and a second query. A quality score is determined for each query pair from user preference data for documents responsive to both the first and the second query. A diversity score is determined for each query pair having a quality score satisfying a quality threshold, the diversity score determined from user preference data for documents responsive to the second, but not the first, query. For each query pair having a quality score satisfying the quality threshold and a diversity score satisfying a diversity threshold, the second query of the query pair is associated with the first query of the query pair as a candidate refinement for the first query.

公开(公告)号：US10360225B1

公开(公告)日：2019-07-23

申请号：US15155421

申请日：2016-05-16

Applicant: Google Inc.

Inventor： Anwis Das ,  Abhinandan Sujit Das ,  Nitin Gupta ,  Renshen Wang

IPC: G06F16/2457 ,  G06F16/9535

Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations, the similarity measure of the given candidate query suggestion may be based on a comparison of current entities of the given candidate query suggestion that match entities of one or more past queries, to a group of the current entities that includes entities that do not match the entities of one or more past queries. In some implementations a ranking of the candidate query suggestions may be determined based on the similarity measure.

公开(公告)号：US09342600B1

公开(公告)日：2016-05-17

申请号：US13666935

申请日：2012-11-01

Applicant: GOOGLE INC.

Inventor： Abhinandan Sujit Das ,  Anwis Das ,  Nitin Gupta

IPC: G06F17/30

CPC classification number: G06F17/30864

Abstract: A system, computer-readable storage medium storing at least one program, and a computer-implemented method for identifying chains of related search queries is presented. Historical search query data is obtained. Chains of related search queries issued by users and search results corresponding to last related search queries in the chains of related search queries that were selected by the users are identified from the historical search query data, where each related search query in a chain of related search queries except for a last related search query in the chain of related search queries violates a search result selection criterion. The chains of related search queries are aggregated into groups, where a respective group has a common first search query and a common search result corresponding to at least one last related search query that was selected by the users. Aggregate data for the groups are stored in a query database.

Abstract translation: 提出了存储至少一个程序的系统，计算机可读存储介质和用于识别相关搜索查询链的计算机实现的方法。 获得历史搜索查询数据。 由用户发出的相关搜索查询链和由用户选择的相关搜索查询链中的最后相关搜索查询相对应的搜索结果的链从历史搜索查询数据中识别，其中相关搜索链中的每个相关搜索查询 除了相关搜索查询链中的最后相关搜索查询之外的查询违反了搜索结果选择标准。 相关搜索查询的链被聚合成组，其中相应组具有公共第一搜索查询和对应于由用户选择的至少一个最后相关搜索查询的公共搜索结果。 组的聚合数据存储在查询数据库中。

公开(公告)号：US09298852B2

公开(公告)日：2016-03-29

申请号：US13928868

申请日：2013-06-27

Applicant: GOOGLE INC.

Inventor： Emanuel Taropa ,  Jeffrey A. Dean ,  Simon Tong ,  Nitin Gupta ,  Noam M. Shazeer ,  Anwis Das ,  Murtaza A. Basrai

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/3097 ,  G06F17/3064 ,  G06F17/30646 ,  G06F17/30672

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for reranking query completions based on activity session data. One of the methods includes receiving a query prefix from a user. Query completions are obtained for the query prefix. One or more likely queries that are likely to co-occur with a reference query in user activity sessions are obtained. If one of the likely queries matches one of the query completions, a modified ranking of the query completions is determined, including boosting a ranking of matching query completions. The modified ranking of the query completions is provided in response to receiving the query prefix.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于基于活动会话数据重新排列查询完成。 其中一种方法包括从用户接收查询前缀。 获取查询前缀的查询完成。 获得在用户活动会话中可能与参考查询共存的一个或多个可能的查询。 如果一个可能的查询与其中一个查询完成相匹配，则确定查询完成的修改排名，包括提升匹配查询完成的排名。 响应于接收查询前缀而提供查询完成的修改排名。

公开(公告)号：US20150169578A1

公开(公告)日：2015-06-18

申请号：US13928868

申请日：2013-06-27

Applicant: GOOGLE INC.

Inventor： Emanuel Taropa ,  Jeffrey A. Dean ,  Simon Tong ,  Nitin Gupta ,  Noam M. Shazeer ,  Anwis Das ,  Murtaza A. Basrai

IPC: G06F17/30

CPC classification number: G06F17/3097 ,  G06F17/3064 ,  G06F17/30646 ,  G06F17/30672

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for reranking query completions based on activity session data. One of the methods includes receiving a query prefix from a user. Query completions are obtained for the query prefix. One or more likely queries that are likely to co-occur with a reference query in user activity sessions are obtained. If one of the likely queries matches one of the query completions, a modified ranking of the query completions is determined, including boosting a ranking of matching query completions. The modified ranking of the query completions is provided in response to receiving the query prefix.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于基于活动会话数据重新排列查询完成。 其中一种方法包括从用户接收查询前缀。 获取查询前缀的查询完成。 获得在用户活动会话中可能与参考查询共存的一个或多个可能的查询。 如果一个可能的查询与其中一个查询完成相匹配，则确定查询完成的修改排名，包括提升匹配查询完成的排名。 响应于接收查询前缀而提供查询完成的修改排名。

公开(公告)号：US08918417B1

公开(公告)日：2014-12-23

申请号：US13851034

申请日：2013-03-26

Applicant: Google Inc.

Inventor： Abhinandan S. Das ,  Anwis Das

IPC: G06F17/30

CPC classification number: G06F17/30522 ,  G06F17/30064 ,  G06F17/30864 ,  G06F17/3097

Abstract: Methods, systems, and apparatus, including computer program products, for generating query refinements from user preference data. A group of query pairs are obtained. Each query pair includes a first query and a second query. A quality score is determined for each query pair from user preference data for documents responsive to both the first and the second query. A diversity score is determined for each query pair having a quality score satisfying a quality threshold, the diversity score determined from user preference data for documents responsive to the second, but not the first, query. For each query pair having a quality score satisfying the quality threshold and a diversity score satisfying a diversity threshold, the second query of the query pair is associated with the first query of the query pair as a candidate refinement for the first query.

Abstract translation: 用于从用户偏好数据生成查询改进的方法，系统和装置，包括计算机程序产品。 获得一组查询对。 每个查询对包括第一个查询和第二个查询。 对于响应于第一和第二查询的文档的用户偏好数据，确定每个查询对的质量得分。 确定具有质量分数满足质量阈值的每个查询对的分集得分，根据用户偏好数据确定的分集得分，所述文献响应于第二次但不是第一个查询。 对于具有满足质量阈值的质量分数和满足分集阈值的分集分数的每个查询对，查询对的第二查询与作为第一查询的候选细化的查询对的第一查询相关联。

公开(公告)号：US08667003B1

公开(公告)日：2014-03-04

申请号：US13784280

申请日：2013-03-04

Applicant: Google Inc.

Inventor： Anwis Das ,  Abhinandan S. Das

IPC: G06F17/30

CPC classification number: G06F17/30522 ,  G06F17/30064 ,  G06F17/30864 ,  G06F17/3097

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying query refinements from sibling queries. In one aspect, a method includes associating each of a plurality of parent queries with a respective group of one or more child queries for the parent query, identifying one or more candidate sibling queries for a particular child query, selecting one or more final sibling queries for the particular child query from the one or more candidate sibling queries, and associating the final sibling queries with the particular child query as query refinements.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于识别来自兄弟姐妹查询的查询改进。 在一个方面，一种方法包括将多个父查询中的每一个与父查询的一个或多个子查询的相应组相关联，识别特定子查询的一个或多个候选兄弟查询，选择一个或多个最终同级查询 对于来自一个或多个候选兄弟查询的特定子查询，以及将最终同胞查询与特定子查询相关联作为查询优化。