专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09239888B1 Determining word boundary likelihoods in potentially incomplete text 有权
公开(公告)号：US09239888B1
公开(公告)日：2016-01-19
申请号：US14560091
申请日：2014-12-04
申请人： Google Inc.
发明人： Abhinandan S. Das , Harry S. Fung
IPC分类号： G06F17/30
CPC分类号： G06F17/3097 , G06F17/30542 , G06F17/30967 , G06F17/30979
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining word boundary likelihoods in potentially incomplete text. In one aspect, a method includes selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key.

2. 发明授权

US08930399B1 Determining word boundary likelihoods in potentially incomplete text 有权
标题翻译：确定潜在不完整文本中的字边界似然
公开(公告)号：US08930399B1
公开(公告)日：2015-01-06
申请号：US13739591
申请日：2013-01-11
申请人： Google Inc.
发明人： Abhinandan S. Das , Harry S. Fung
IPC分类号： G06F17/30
CPC分类号： G06F17/3097 , G06F17/30542 , G06F17/30967 , G06F17/30979
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining word boundary likelihoods in potentially incomplete text. In one aspect, a method includes selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key.
摘要翻译：方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于确定潜在不完整文本中的字边界可能性。在一个方面，一种方法包括从查询中选择查询序列，每个查询序列是单词n-gram的至少一部分，单词n-gram是从第二个词序列中选择的多达n个词的子序列，查询和每个查询序列：确定查询序列的一个或多个查询序列密钥; 确定每个查询序列密钥的字边界计数和非字边界计数中的至少一个，每个字边界计数和非字边界计数取决于查询序列的上下文; 以及在数据存储设备中，与每个查询序列密钥相关联所述至少一个字边界计数和非字边界计数。

3. 发明授权

US08782071B1 Fresh related search suggestions 有权
标题翻译：新鲜的相关搜索建议
公开(公告)号：US08782071B1
公开(公告)日：2014-07-15
申请号：US13842677
申请日：2013-03-15
申请人： Google Inc.
发明人： Rajat Mukherjee , Abhinandan S. Das , Adam Westall
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30867 , G06F17/30395
摘要： Methods, systems, apparatus, including computer program products, for providing fresh related search suggestions in response to a user submitted query are presented. In one implementation, a plurality of prior queries are selected wherein each of the prior queries was submitted as a search query a number of times during a recent time period and satisfies a criterion. For each of the prior queries, the prior is selected as a candidate query based on one or more of: a determination that search results responsive to the prior query include a number of news results that satisfy a second threshold, and relevance data indicative of user behavior relative to the search results responsive to the prior query. In response to receiving a user query, one or more candidate queries are selected that match the user query.
摘要翻译：提出了用于提供与用户提交的查询相关的新鲜相关搜索建议的方法，系统，装置，包括计算机程序产品。在一个实施方式中，选择多个先前查询，其中每个先前查询作为搜索查询在最近一段时间内被提交多次，并且满足标准。对于每个先前的查询，先前的选择是基于以下中的一个或多个的候选查询：响应于先前查询的搜索结果包括满足第二阈值的多个新闻结果的确定以及指示用户的相关数据相对于响应于先前查询的搜索结果的行为。响应于接收用户查询，选择与用户查询匹配的一个或多个候选查询。

4. 发明授权

US09378247B1 Generating query refinements from user preference data 有权
公开(公告)号：US09378247B1
公开(公告)日：2016-06-28
申请号：US14574081
申请日：2014-12-17
申请人： Google Inc.
发明人： Abhinandan S. Das , Anwis Das
IPC分类号： G06F17/30
CPC分类号： G06F17/30522 , G06F17/30064 , G06F17/30864 , G06F17/3097
摘要： 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.

5. 发明授权

US08918417B1 Generating query refinements from user preference data 有权
标题翻译：从用户偏好数据生成查询优化
公开(公告)号：US08918417B1
公开(公告)日：2014-12-23
申请号：US13851034
申请日：2013-03-26
申请人： Google Inc.
发明人： Abhinandan S. Das , Anwis Das
IPC分类号： G06F17/30
CPC分类号： G06F17/30522 , G06F17/30064 , G06F17/30864 , G06F17/3097
摘要： 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.
摘要翻译：用于从用户偏好数据生成查询改进的方法，系统和装置，包括计算机程序产品。获得一组查询对。每个查询对包括第一个查询和第二个查询。对于响应于第一和第二查询的文档的用户偏好数据，确定每个查询对的质量得分。确定具有质量分数满足质量阈值的每个查询对的分集得分，根据用户偏好数据确定的分集得分，所述文献响应于第二次但不是第一个查询。对于具有满足质量阈值的质量分数和满足分集阈值的分集分数的每个查询对，查询对的第二查询与作为第一查询的候选细化的查询对的第一查询相关联。

6. 发明授权

US08667003B1 Generating sibling query refinements 有权
标题翻译：生成同级查询优化
公开(公告)号：US08667003B1
公开(公告)日：2014-03-04
申请号：US13784280
申请日：2013-03-04
申请人： Google Inc.
发明人： Anwis Das , Abhinandan S. Das
IPC分类号： G06F17/30
CPC分类号： G06F17/30522 , G06F17/30064 , G06F17/30864 , G06F17/3097
摘要： 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.
摘要翻译：方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于识别来自兄弟姐妹查询的查询改进。在一个方面，一种方法包括将多个父查询中的每一个与父查询的一个或多个子查询的相应组相关联，识别特定子查询的一个或多个候选兄弟查询，选择一个或多个最终同级查询对于来自一个或多个候选兄弟查询的特定子查询，以及将最终同胞查询与特定子查询相关联作为查询优化。

7. 发明授权

US09767504B1 Method, system, and computer readable medium for rendering a graphical user interface visually indicating search results including related suggested products 有权
公开(公告)号：US09767504B1
公开(公告)日：2017-09-19
申请号：US14070629
申请日：2013-11-04
申请人： Google Inc.
发明人： Rajat Mukherjee , Abhinandan S. Das , Jennifer Liu Low , Dan Moisa
IPC分类号： G06Q30/00 , G06F17/30 , G06Q30/06 , G06Q30/02
CPC分类号： G06Q30/0631 , G06F17/30424 , G06F17/30554 , G06F17/30867 , G06Q30/02 , G06Q30/0253 , G06Q30/0627
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for related search suggestions for products. In one aspect, a method includes receiving a query for searching documents wherein the query specifies a first product. A number of occurrences of the first product in a plurality of prior queries of the documents submitted by users is determined. A product category for the first product is determined based on one or more attributes associated with the first product, the category having a predetermined plurality of category attributes. A suggested product is selected wherein the suggested product is associated with attributes that satisfy the category attributes.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式