公开(公告)号：US09116952B1

公开(公告)日：2015-08-25

申请号：US13906889

申请日：2013-05-31

Applicant: Google Inc.

Inventor： Matthias Heiler ,  Behshad Behzadi ,  Evgeny A. Cherepanov ,  Nils Grimsmo ,  Aurelien Boffy ,  Alessandro Agostini ,  Karoly Csalogany ,  Fredrik Bergenlid ,  Marcin M. Nowak-Przygodzki

IPC: G06F17/30

CPC classification number: G06F17/30401 ,  G06F17/30345 ,  G06F17/30395 ,  G06F17/30528 ,  G06F17/30554 ,  G06F17/30672 ,  G06F17/30867 ,  G06F17/30973

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于使用搜索数据确定查询改进。 在一个方面，一种方法包括接收第一查询和第二查询，每个查询包括用于用户会话的一个或多个n克，确定第一查询的第一组查询改进，从第一查询确定第二组查询优化 一组查询优化，每个查询细化在第二组查询优化中，包括至少一个类似于来自第一个查询的n-gram的n-gram，以及至少与n-gram相似的n-gram， 第二查询，对第二组查询细化中的每个查询细化进行评分，从由第二组查询优化和第二查询组成的组中选择第三查询，以及将第三查询作为输入提供给搜索操作。

公开(公告)号：US09727603B1

公开(公告)日：2017-08-08

申请号：US14813237

申请日：2015-07-30

Applicant: Google Inc.

Inventor： Matthias Heiler ,  Behshad Behzadi ,  Evgeny A. Cherepanov ,  Nils Grimsmo ,  Aurelien Boffy ,  Alessandro Agostini ,  Karoly Csalogany ,  Fredrik Bergenlid ,  Marcin M. Nowak-Przygodzki

IPC: G06F17/30

CPC classification number: G06F17/30401 ,  G06F17/30345 ,  G06F17/30395 ,  G06F17/30528 ,  G06F17/30554 ,  G06F17/30672 ,  G06F17/30867 ,  G06F17/30973

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.

公开(公告)号：US20140358906A1

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

申请号：US13906669

申请日：2013-05-31

Applicant: Google Inc.

Inventor： Behshad Behzadi ,  Evgeny A. Cherepanov ,  Nils Grimsmo ,  Aurelien Boffy ,  Alessandro Agostini ,  Karoly Csalogany ,  Fredrik Bergenlid ,  Matthias Heiler ,  Marcin M. Nowak-Przygodzki

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06F17/3064 ,  G06F17/30684 ,  G06F17/30864

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating query suggestions based on search data. In one aspect, a method includes receiving, by one or more computers, a first query, determining query refinements based on the first query, generating, from the query refinements, refinement clusters, each refinement cluster corresponding to a particular topic and each refinement cluster including query refinements that are determined to belong to the particular topic to which the refinement cluster corresponds, ranking the refinement clusters, and selecting the refinement cluster that is highest in the ranking relative to other refinement clusters in the ranking as a first search refinement cluster for the first query.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于基于搜索数据生成查询建议。 一方面，一种方法包括由一个或多个计算机接收第一查询，基于第一查询确定查询改进，从查询优化生成细化群集，对应于特定主题的每个细化群集和每个细化群集 包括被确定属于所述细化集群对应的特定主题的查询改进，对所述细化集群进行排序，以及将所述排名中相对于所述排名中的其他细化集群的排名中最高的细化集群选择为第一搜索细化集群， 第一个查询。

公开(公告)号：US09336277B2

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

申请号：US13906669

申请日：2013-05-31

Applicant: Google Inc.

Inventor： Behshad Behzadi ,  Evgeny A. Cherepanov ,  Nils Grimsmo ,  Aurelien Boffy ,  Alessandro Agostini ,  Karoly Csalogany ,  Fredrik Bergenlid ,  Matthias Heiler ,  Marcin M. Nowak-Przygodzki

IPC: G06F17/30

CPC classification number: G06F17/3053 ,  G06F17/3064 ,  G06F17/30684 ,  G06F17/30864

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating query suggestions based on search data. In one aspect, a method includes receiving, by one or more computers, a first query, determining query refinements based on the first query, generating, from the query refinements, refinement clusters, each refinement cluster corresponding to a particular topic and each refinement cluster including query refinements that are determined to belong to the particular topic to which the refinement cluster corresponds, ranking the refinement clusters, and selecting the refinement cluster that is highest in the ranking relative to other refinement clusters in the ranking as a first search refinement cluster for the first query.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于基于搜索数据生成查询建议。 一方面，一种方法包括由一个或多个计算机接收第一查询，基于第一查询确定查询改进，从查询优化生成细化群集，对应于特定主题的每个细化群集和每个细化群集 包括被确定属于所述细化集群对应的特定主题的查询改进，对所述细化集群进行排序，以及将所述排名中相对于所述排名中的其他细化集群的排名中最高的细化集群选择为第一搜索细化集群， 第一个查询。