-
公开(公告)号：US08775160B1
公开(公告)日：2014-07-08
申请号：US13179645
申请日：2011-07-11
申请人： Igor Roizen , Wojciech Jawor , Keith Dutton
发明人： Igor Roizen , Wojciech Jawor , Keith Dutton
IPC分类号： G06F17/27
CPC分类号： G06F17/277 , G06F17/30684
摘要： It is possible to provide meaningful responses to queries using systems which consider usage of words in the queries when analyzing those queries and determining what information is possibly relevant. This approach can be applied in online shopping systems by identification of nouns or noun phrases reflecting products available through the system.
摘要翻译： 使用在分析这些查询并确定哪些信息可能相关时考虑在查询中使用单词的系统的查询可以提供有意义的响应。 这种方法可以通过识别通过系统可用的产品的名词或名词短语来应用于在线购物系统。
-
公开(公告)号：US08473477B1
公开(公告)日：2013-06-25
申请号：US13204590
申请日：2011-08-05
申请人： Igor Roizen , Keith A. Dutton
发明人： Igor Roizen , Keith A. Dutton
CPC分类号： G06F17/30864 , G06F17/30687 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A searcher can be configured to improve relevance ranking of search results through iterative weighting of search ranking results. A Search Auto Categorizer (SAC) operates on a base query to return a probabilistic distribution of leaf categories of a taxonomy in which relevant products may reside. A Search Logic Unit (SLU) can compute a relevance of any particular leaf category to the base query. The SLU can then determine an initial relevance of a particular product to the query based on the probabilistic distribution and the relevance of leaf category to query. The SLU weights the relevance of a product to the query to establish an updated probabilistic distribution. The SLU then repeats the relevance and weighting until convergence upon a relevance list.
摘要翻译： 搜索者可以被配置为通过搜索排名结果的迭代加权来提高搜索结果的相关性排名。 搜索自动分类器（SAC）基于基本查询来返回相关产品可能存在的分类法的叶类别的概率分布。 搜索逻辑单元（SLU）可以计算任何特定叶类别与基本查询的相关性。 然后，SLU可以基于概率分布和叶类别与查询的相关性来确定特定产品与查询的初始相关性。 SLU将产品与查询的相关性加权，以建立更新的概率分布。 然后，SLU重复相关性和权重，直到在相关性列表上收敛。
-
公开(公告)号：US08428933B1
公开(公告)日：2013-04-23
申请号：US12640964
申请日：2009-12-17
申请人： Igor Roizen , Wojciech Jawor , Keith Dutton
发明人： Igor Roizen , Wojciech Jawor , Keith Dutton
IPC分类号： G06F17/28
CPC分类号： G06F17/277 , G06F17/30684
摘要： It is possible to provide meaningful responses to queries using systems which consider usage of words in the queries when analyzing those queries and determining what information is possibly relevant. This approach can be applied in online shopping systems by identification of nouns or noun phrases reflecting products available through the system.
摘要翻译： 使用在分析这些查询并确定哪些信息可能相关时考虑在查询中使用单词的系统的查询可以提供有意义的响应。 这种方法可以通过识别通过系统可用的产品的名词或名词短语来应用于在线购物系统。
-
公开(公告)号：US07865495B1
公开(公告)日：2011-01-04
申请号：US11245602
申请日：2005-10-06
申请人： Igor Roizen , Keith A. Dutton
发明人： Igor Roizen , Keith A. Dutton
CPC分类号： G06F17/30864 , G06F17/30687 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A searcher can be configured to improve search results through the use of intelligent word deletion. A search auto categorizer (SAC) operates on the original query and returns a list of leaf categories and a distribution of probabilities among the leaf categories. The original query is parsed into word pairs and each word pair is run through the search engine. The search results for each word pair are weighted by the leaf category probabilities. A word pair is selected from the results and one of the two words is deleted from the original query. The searcher can perform exhaustive deletion where multiple truncated queries are generated from the original query and the results list from one truncated query is returned as the results list. The searcher can build up a truncated query from the original query by iteratively appending a word selected from the original query to the truncated query.
摘要翻译： 可以通过使用智能字删除来配置搜索器来提高搜索结果。 搜索自动分类器（SAC）对原始查询进行操作，并返回叶类别列表和叶类别之间的概率分布。 原始查询被解析为单词对，每个单词对都通过搜索引擎运行。 每个单词对的搜索结果由叶类别概率加权。 从结果中选择一个字对，并从原始查询中删除两个单词之一。 搜索者可以执行详尽的删除，其中从原始查询生成多个截断的查询，并将一个截断的查询的结果列表作为结果列表返回。 搜索者可以通过将从原始查询中选择的单词迭代地添加到截断的查询中，从原始查询中构建截断的查询。
-
公开(公告)号：US20110078130A1
公开(公告)日：2011-03-31
申请号：US12958340
申请日：2010-12-01
申请人： Igor ROIZEN , Keith A. Dutton
发明人： Igor ROIZEN , Keith A. Dutton
IPC分类号： G06F17/30
CPC分类号： G06F16/3346 , G06F16/951 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A searcher can be configured to improve search results through the use of intelligent word deletion. A search auto categorizer (SAC) operates on the original query and returns a list of leaf categories and a distribution of probabilities among the leaf categories. The original query is parsed into word pairs and each word pair is run through the search engine. The search results for each word pair are weighted by the leaf category probabilities. A word pair is selected from the results and one of the two words is deleted from the original query. The searcher can perform exhaustive deletion where multiple truncated queries are generated from the original query and the results list from one truncated query is returned as the results list. The searcher can build up a truncated query from the original query by iteratively appending a word selected from the original query to the truncated query.
摘要翻译： 可以通过使用智能字删除来配置搜索器来提高搜索结果。 搜索自动分类器（SAC）对原始查询进行操作，并返回叶类别列表和叶类别之间的概率分布。 原始查询被解析为单词对，每个单词对都通过搜索引擎运行。 每个单词对的搜索结果由叶类别概率加权。 从结果中选择一个字对，并从原始查询中删除两个单词之一。 搜索者可以执行详尽的删除，其中从原始查询生成多个截断的查询，并将一个截断的查询的结果列表作为结果列表返回。 搜索者可以通过将从原始查询中选择的单词迭代地添加到截断的查询中，从原始查询中构建截断的查询。
-
公开(公告)号：US08429147B1
公开(公告)日：2013-04-23
申请号：US13091967
申请日：2011-04-21
申请人： Keith A. Dutton , Igor Roizen , Sanford J. Ganz
发明人： Keith A. Dutton , Igor Roizen , Sanford J. Ganz
CPC分类号： G06F17/30864 , G06F17/30687 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.
摘要翻译： 可以通过实现并行计算架构来配置搜索引擎来提高搜索时间。 该索引在多个独立的搜索节点之间分割。 将查询传送给每个并行节点，并在每个独立节点中搜索查询。 每个节点的结果被路由到一个配置为将结果聚合到一个结果集的联盟。 联盟体被配置为确定中间结果的子集以从每个独立节点检索和聚合。 至少部分地基于节点的数量和结果集中期望的搜索结果的数量，联盟人确定从每个节点检索的结果的数量。
-
公开(公告)号：US08019744B1
公开(公告)日：2011-09-13
申请号：US12704179
申请日：2010-02-11
申请人： Igor Roizen , Keith A. Dutton
发明人： Igor Roizen , Keith A. Dutton
CPC分类号： G06F17/30864 , G06F17/30687 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A searcher can be configured to improve relevance ranking of search results through iterative weighting of search ranking results. A Search Auto Categorizer (SAC) operates on a base query to return a probabilistic distribution of leaf categories of a taxonomy in which relevant products may reside. A Search Logic Unit (SLU) can compute a relevance of any particular leaf category to the base query. The SLU can then determine an initial relevance of a particular product to the query based on the probabilistic distribution and the relevance of leaf category to query. The SLU weights the relevance of a product to the query to establish an updated probabilistic distribution. The SLU then repeats the relevance and weighting until convergence upon a relevance list.
摘要翻译： 搜索者可以被配置为通过搜索排名结果的迭代加权来提高搜索结果的相关性排名。 搜索自动分类器（SAC）基于基本查询来返回相关产品可能存在的分类法的叶类别的概率分布。 搜索逻辑单元（SLU）可以计算任何特定叶类别与基本查询的相关性。 然后，SLU可以基于概率分布和叶类别与查询的相关性来确定特定产品与查询的初始相关性。 SLU将产品与查询的相关性加权，以建立更新的概率分布。 然后，SLU重复相关性和权重，直到在相关性列表上收敛。
-
公开(公告)号：US07765178B1
公开(公告)日：2010-07-27
申请号：US11245601
申请日：2005-10-06
申请人： Igor Roizen , Keith A. Dutton
发明人： Igor Roizen , Keith A. Dutton
CPC分类号： G06F17/30864 , G06F17/30687 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A searcher can be configured to improve relevance ranking of search results through iterative weighting of search ranking results. A Search Auto Categorizer (SAC) operates on a base query to return a probabilistic distribution of leaf categories of a taxonomy in which relevant products may reside. A Search Logic Unit (SLU) can compute a relevance of any particular leaf category to the base query. The SLU can then determine an initial relevance of a particular product to the query based on the probabilistic distribution and the relevance of leaf category to query. The SLU weights the relevance of a product to the query to establish an updated probabilistic distribution. The SLU then repeats the relevance and weighting until convergence upon a relevance list.
摘要翻译： 搜索者可以被配置为通过搜索排名结果的迭代加权来提高搜索结果的相关性排名。 搜索自动分类器（SAC）基于基本查询来返回相关产品可能存在的分类法的叶类别的概率分布。 搜索逻辑单元（SLU）可以计算任何特定叶类别与基本查询的相关性。 然后，SLU可以基于概率分布和叶类别与查询的相关性来确定特定产品与查询的初始相关性。 SLU将产品与查询的相关性加权，以建立更新的概率分布。 然后，SLU重复相关性和权重，直到在相关性列表上收敛。
-
公开(公告)号：US08428948B1
公开(公告)日：2013-04-23
申请号：US12839764
申请日：2010-07-20
申请人： Igor Roizen , Wojciech Jawor , Keith Dutton
发明人： Igor Roizen , Wojciech Jawor , Keith Dutton
IPC分类号： G10L15/04
CPC分类号： G06F17/277 , G06F17/30684
摘要： It is possible to provide meaningful responses to queries using systems which consider usage of words in the queries when analyzing those queries and determining what information is possibly relevant. This approach can be applied in online shopping systems by identification of nouns or noun phrases reflecting products available through the system.
-
公开(公告)号：US07953723B1
公开(公告)日：2011-05-31
申请号：US11245600
申请日：2005-10-06
申请人： Keith A. Dutton , Igor Roizen , Sanford J. Ganz
发明人： Keith A. Dutton , Igor Roizen , Sanford J. Ganz
CPC分类号： G06F17/30864 , G06F17/30687 , Y10S707/971 , Y10S707/99935 , Y10S707/99937
摘要： A search engine can be configured to improve search times by implementing a parallel computing architecture. The index is split across a plurality of independent search nodes. A query is communicated to each of the parallel nodes and the query is searched in each independent node. The results from each node are routed to a federator that is configured to aggregate the results to a result set. The federator is configured to determine a subset of intermediate results to retrieve and aggregate from each of the independent nodes. The federator determines a number of results to retrieve from each of the nodes based at least in part on the number of nodes and the number of search results desired in the results set.
摘要翻译： 可以通过实现并行计算架构来配置搜索引擎来提高搜索时间。 该索引在多个独立的搜索节点之间分割。 将查询传送给每个并行节点，并在每个独立节点中搜索查询。 每个节点的结果被路由到一个配置为将结果聚合到一个结果集的联盟。 联盟体被配置为确定中间结果的子集以从每个独立节点检索和聚合。 至少部分地基于节点的数量和结果集中期望的搜索结果的数量，联盟人确定从每个节点检索的结果的数量。
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.015 秒)
