公开(公告)号：US20120054216A1

公开(公告)日：2012-03-01

申请号：US13289348

申请日：2011-11-04

Applicant: Paul HAAHR ,  Steven Baker

Inventor： Paul HAAHR ,  Steven Baker

IPC: G06F17/30

CPC classification number: G06F17/30389 ,  G06F17/30598 ,  G06F17/30648 ,  G06F17/3071 ,  G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99945

Abstract: A system and method for providing search query refinements are presented. A stored query and a stored document are associated as a logical pairing. A weight is assigned to the logical pairing. The search query is issued and a set of search documents is produced. At least one search document is matched to at least one stored document. The stored query and the assigned weight associated with the matching at least one stored document are retrieved. At least one cluster is formed based on the stored query and the assigned weight associated with the matching at least one stored document. The stored query associated with the matching at least one stored document are scored for the at least one cluster relative to at least one other cluster. At least one such scored search query is suggested as a set of query refinements.

Abstract translation: 提出了一种提供搜索查询优化的系统和方法。 存储的查询和存储的文档被关联为逻辑配对。 权重被分配给逻辑配对。 发出搜索查询，并生成一组搜索文档。 至少一个搜索文档与至少一个存储的文档匹配。 检索存储的查询和与匹配的至少一个存储的文档相关联的分配的权重。 基于存储的查询和与匹配至少一个存储的文档相关联的分配的权重，形成至少一个群集。 与至少一个存储的文档匹配的存储查询相对于至少一个其他集群对于至少一个集群进行评分。 建议至少一个这样的计分搜索查询作为一组查询优化。

公开(公告)号：US07409383B1

公开(公告)日：2008-08-05

申请号：US10813590

申请日：2004-03-31

Applicant: Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

Inventor： Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

IPC: G06F17/30 ,  G06F7/00 ,  G06F17/21

CPC classification number: G06F17/30967 ,  G06F7/24 ,  G06F17/21 ,  G06F17/30666 ,  G06F17/30979 ,  Y10S707/99933 ,  Y10S707/99943

Abstract: A stopword detection component detects stopwords (also stop-phrases) in search queries input to keyword-based information retrieval systems. Potential stopwords are initially identified by comparing the terms in the search query to a list of known stopwords. Context data is then retrieved based on the search query and the identified stopwords. In one implementation, the context data includes documents retrieved from a document index. In another implementation, the context data includes categories relevant to the search query. Sets of retrieved context data are compared to one another to determine if they are substantially similar. If the sets of context data are substantially similar, this fact may be used to infer that the removal of the potential stopword(s) is not material to the search. If the sets of context data are not substantially similar, the potential stopword can be considered material to the search and should not be removed from the query.

Abstract translation: 停止词检测组件在输入到基于关键字的信息检索系统的搜索查询中检测到停止词（也称为停止词）。 最初通过将搜索查询中的术语与已知无效词列表进行比较来识别潜在的禁忌词。 然后基于搜索查询和所识别的无效词来检索上下文数据。 在一个实现中，上下文数据包括从文档索引检索的文档。 在另一实现中，上下文数据包括与搜索查询相关的类别。 将检索到的上下文数据的集合彼此进行比较以确定它们是否基本相似。 如果上下文数据集合基本相似，则可以使用该事实来推断潜在的停止词的移除对搜索不重要。 如果上下文数据集基本上不相似，潜在的停用词可以被认为是搜索的重要内容，不应该从查询中移除。

公开(公告)号：US20050055341A1

公开(公告)日：2005-03-10

申请号：US10668721

申请日：2003-09-22

Applicant: Paul Haahr ,  Steven Baker

Inventor： Paul Haahr ,  Steven Baker

IPC: G06F17/30

CPC classification number: G06F17/30389 ,  G06F17/30598 ,  G06F17/30648 ,  G06F17/3071 ,  G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99945

Abstract: A system and method for providing search query refinements are presented. A stored query and a stored document are associated as a logical pairing. A weight is assigned to the logical pairing. The search query is issued and a set of search documents is produced. At least one search document is matched to at least one stored document. The stored query and the assigned weight associated with the matching at least one stored document are retrieved. At least one cluster is formed based on the stored query and the assigned weight associated with the matching at least one stored document. The stored query associated with the matching at least one stored document are scored for the at least one cluster relative to at least one other cluster. At least one such scored search query is suggested as a set of query refinements.

Abstract translation: 提出了一种提供搜索查询优化的系统和方法。 存储的查询和存储的文档被关联为逻辑配对。 权重被分配给逻辑配对。 发出搜索查询，并生成一组搜索文档。 至少一个搜索文档与至少一个存储的文档匹配。 检索存储的查询和与匹配的至少一个存储的文档相关联的分配的权重。 基于存储的查询和与匹配至少一个存储的文档相关联的分配的权重，形成至少一个群集。 与至少一个存储的文档匹配的存储查询相对于至少一个其他集群对于至少一个集群进行评分。 建议至少一个这样的计分搜索查询作为一组查询优化。

公开(公告)号：US08645407B2

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

申请号：US13289348

申请日：2011-11-04

Applicant: Paul Haahr ,  Steven Baker

Inventor： Paul Haahr ,  Steven Baker

IPC: G06F17/30

CPC classification number: G06F17/30389 ,  G06F17/30598 ,  G06F17/30648 ,  G06F17/3071 ,  G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99945

Abstract: A system and method for providing search query refinements are presented. A stored query and a stored document are associated as a logical pairing. A weight is assigned to the logical pairing. The search query is issued and a set of search documents is produced. At least one search document is matched to at least one stored document. The stored query and the assigned weight associated with the matching at least one stored document are retrieved. At least one cluster is formed based on the stored query and the assigned weight associated with the matching at least one stored document. The stored query associated with the matching at least one stored document are scored for the at least one cluster relative to at least one other cluster. At least one such scored search query is suggested as a set of query refinements.

Abstract translation: 提出了一种提供搜索查询优化的系统和方法。 存储的查询和存储的文档被关联为逻辑配对。 权重被分配给逻辑配对。 发出搜索查询，并生成一组搜索文档。 至少一个搜索文档与至少一个存储的文档匹配。 检索存储的查询和与匹配的至少一个存储的文档相关联的分配的权重。 基于存储的查询和与匹配至少一个存储的文档相关联的分配的权重，形成至少一个群集。 与至少一个存储的文档匹配的存储查询相对于至少一个其他集群对于至少一个集群进行评分。 建议至少一个这样的计分搜索查询作为一组查询优化。

公开(公告)号：US08086619B2

公开(公告)日：2011-12-27

申请号：US10668721

申请日：2003-09-22

Applicant: Paul Haahr ,  Steven Baker

Inventor： Paul Haahr ,  Steven Baker

IPC: G06F17/30

CPC classification number: G06F17/30389 ,  G06F17/30598 ,  G06F17/30648 ,  G06F17/3071 ,  G06F17/30864 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99945

Abstract: A system and method for providing search query refinements are presented. A stored query and a stored document are associated as a logical pairing. A weight is assigned to the logical pairing. The search query is issued and a set of search documents is produced. At least one search document is matched to at least one stored document. The stored query and the assigned weight associated with the matching at least one stored document are retrieved. At least one cluster is formed based on the stored query and the assigned weight associated with the matching at least one stored document. The stored query associated with the matching at least one stored document are scored for the at least one cluster relative to at least one other cluster. At least one such scored search query is suggested as a set of query refinements.

Abstract translation: 提出了一种提供搜索查询优化的系统和方法。 存储的查询和存储的文档被关联为逻辑配对。 权重被分配给逻辑配对。 发出搜索查询，并生成一组搜索文档。 至少一个搜索文档与至少一个存储的文档匹配。 检索存储的查询和与匹配的至少一个存储的文档相关联的分配的权重。 基于存储的查询和与匹配至少一个存储的文档相关联的分配的权重，形成至少一个群集。 与至少一个存储的文档匹配的存储查询相对于至少一个其他集群对于至少一个集群进行评分。 建议至少一个这样的计分搜索查询作为一组查询优化。

公开(公告)号：US08214385B1

公开(公告)日：2012-07-03

申请号：US13098956

申请日：2011-05-02

Applicant: Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

Inventor： Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30967 ,  G06F7/24 ,  G06F17/21 ,  G06F17/30666 ,  G06F17/30979 ,  Y10S707/99933 ,  Y10S707/99943

Abstract: A stopword detection component detects stopwords (also stop-phrases) in search queries input to keyword-based information retrieval systems. Potential stopwords are initially identified by comparing the terms in the search query to a list of known stopwords. Context data is then retrieved based on the search query and the identified stopwords. In one implementation, the context data includes documents retrieved from a document index. In another implementation, the context data includes categories relevant to the search query. Sets of retrieved context data are compared to one another to determine if they are substantially similar. If the sets of context data are substantially similar, this fact may be used to infer that the removal of the potential stopword(s) is not material to the search. If the sets of context data are not substantially similar, the potential stopword can be considered material to the search and should not be removed from the query.

Abstract translation: 停止词检测组件在输入到基于关键字的信息检索系统的搜索查询中检测到停止词（也称为停止词）。 最初通过将搜索查询中的术语与已知无效词列表进行比较来识别潜在的禁忌词。 然后基于搜索查询和所识别的无效词来检索上下文数据。 在一个实现中，上下文数据包括从文档索引检索的文档。 在另一实现中，上下文数据包括与搜索查询相关的类别。 将检索到的上下文数据的集合彼此进行比较，以确定它们是否基本相似。 如果上下文数据集合基本相似，则可以使用该事实来推断潜在的停止词的移除对搜索不重要。 如果上下文数据集基本上不相似，潜在的停用词可以被认为是搜索的重要内容，不应该从查询中移除。

公开(公告)号：US08065316B1

公开(公告)日：2011-11-22

申请号：US10953117

申请日：2004-09-30

Applicant: Steven Baker ,  Paul Haahr

Inventor： Steven Baker ,  Paul Haahr

IPC: G06F17/00

CPC classification number: G06F17/30646 ,  G06F17/3064 ,  G06F17/30864

Abstract: A system and method for generating query refinement suggestions may include collecting refinement data for at least one received source query. The collected refinement data is then clustered to form at least one cluster. At least one potential refinement query suggestion is identified from the refinement data within the at least one cluster.

Abstract translation: 用于产生查询细化建议的系统和方法可以包括收集至少一个接收的源查询的细化数据。 收集的细化数据然后被聚集以形成至少一个聚类。 至少一个潜在的细化查询建议是根据至少一个群集内的细化数据来识别的。

公开(公告)号：US08504584B1

公开(公告)日：2013-08-06

申请号：US13270928

申请日：2011-10-11

Applicant: Steven Baker ,  Paul Haahr

Inventor： Steven Baker ,  Paul Haahr

IPC: G06F17/00

CPC classification number: G06F17/30646 ,  G06F17/3064 ,  G06F17/30864

Abstract: A system and method for generating query refinement suggestions may include collecting refinement data for at least one received source query. The collected refinement data is then clustered to form at least one cluster. At least one potential refinement query suggestion is identified from the refinement data within the at least one cluster.

Abstract translation: 用于产生查询细化建议的系统和方法可以包括收集至少一个接收的源查询的细化数据。 收集的细化数据然后被聚集以形成至少一个聚类。 至少一个潜在的细化查询建议是根据至少一个集群内的细化数据来识别的。

公开(公告)号：US08473510B1

公开(公告)日：2013-06-25

申请号：US13485605

申请日：2012-05-31

Applicant: Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

Inventor： Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30967 ,  G06F7/24 ,  G06F17/21 ,  G06F17/30666 ,  G06F17/30979 ,  Y10S707/99933 ,  Y10S707/99943

Abstract: A stopword detection component detects stopwords (also stop-phrases) in search queries input to keyword-based information retrieval systems. Potential stopwords are initially identified by comparing the terms in the search query to a list of known stopwords. Context data is then retrieved based on the search query and the identified stopwords. In one implementation, the context data includes documents retrieved from a document index. In another implementation, the context data includes categories relevant to the search query. Sets of retrieved context data are compared to one another to determine if they are substantially similar. If the sets of context data are substantially similar, this fact may be used to infer that the removal of the potential stopword(s) is not material to the search. If the sets of context data are not substantially similar, the potential stopword can be considered material to the search and should not be removed from the query.

公开(公告)号：US07945579B1

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

申请号：US12185651

申请日：2008-08-04

Applicant: Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

Inventor： Simon Tong ,  Uri Lerner ,  Amit Singhal ,  Paul Haahr ,  Steven Baker

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30967 ,  G06F7/24 ,  G06F17/21 ,  G06F17/30666 ,  G06F17/30979 ,  Y10S707/99933 ,  Y10S707/99943

Abstract: A stopword detection component detects stopwords (also stop-phrases) in search queries input to keyword-based information retrieval systems. Potential stopwords are initially identified by comparing the terms in the search query to a list of known stopwords. Context data is then retrieved based on the search query and the identified stopwords. In one implementation, the context data includes documents retrieved from a document index. In another implementation, the context data includes categories relevant to the search query. Sets of retrieved context data are compared to one another to determine if they are substantially similar. If the sets of context data are substantially similar, this fact may be used to infer that the removal of the potential stopword(s) is not material to the search. If the sets of context data are not substantially similar, the potential stopword can be considered material to the search and should not be removed from the query.

Abstract translation: 停止词检测组件在输入到基于关键字的信息检索系统的搜索查询中检测到停止词（也称为停止词）。 最初通过将搜索查询中的术语与已知无效词列表进行比较来识别潜在的禁忌词。 然后基于搜索查询和所识别的无效词来检索上下文数据。 在一个实现中，上下文数据包括从文档索引检索的文档。 在另一实现中，上下文数据包括与搜索查询相关的类别。 将检索到的上下文数据的集合彼此进行比较，以确定它们是否基本相似。 如果上下文数据集合基本相似，则可以使用该事实来推断潜在的停止词的移除对搜索不重要。 如果上下文数据集基本上不相似，潜在的停用词可以被认为是搜索的重要内容，不应该从查询中移除。