公开(公告)号：US20100191758A1

公开(公告)日：2010-07-29

申请号：US12360008

申请日：2009-01-26

申请人： Fuchun Peng ,  Xing Wei ,  Yumao Lu ,  Xin Li ,  Donald Metzler ,  Hang Cui ,  Benoit Dumoulin

发明人： Fuchun Peng ,  Xing Wei ,  Yumao Lu ,  Xin Li ,  Donald Metzler ,  Hang Cui ,  Benoit Dumoulin

IPC分类号： G06F17/30

CPC分类号： G06F16/951 ,  G06F16/353

摘要： A system and method for improved search relevance using proximity boosting. A query for a web search is received from a user, via a network, wherein the query comprises a plurality of query tokens. One or more concepts are identified in the query wherein each of concepts comprises at least two query tokens. A relative concept strength is determined for each of the identified concepts. The query is then rewritten for submission to a search engine wherein for each of the one or more concepts, a syntax rule associated with the respective relative concept strength of the concept is applied to the query tokens comprising the concept such that the rewritten query represents the one or more concepts whereby the proximity of the one or more concepts in a search result returned by the search engine to the user in response to the rewritten query is boosted.

摘要翻译： 一种使用邻近度增强来提高搜索相关性的系统和方法。 从用户经由网络接收到针对web搜索的查询，其中所述查询包括多个查询令牌。 在查询中识别一个或多个概念，其中每个概念包括至少两个查询令牌。 确定每个识别的概念的相对概念强度。 然后，该查询被重写以提交给搜索引擎，其中对于一个或多个概念中的每一个，与概念的相应相对概念强度相关联的语法规则被应用于包括概念的查询令牌，使得重写的查询表示 提高了一个或多个概念，由此响应于重写的查询，搜索引擎向用户返回的搜索结果中的一个或多个概念的接近度被提升。

公开(公告)号：US20110184981A1

公开(公告)日：2011-07-28

申请号：US12694515

申请日：2010-01-27

申请人： Yumao Lu ,  Fuchun Peng ,  Benoit Dumoulin

发明人： Yumao Lu ,  Fuchun Peng ,  Benoit Dumoulin

IPC分类号： G06F17/30

CPC分类号： G06F16/9537

摘要： One particular embodiment accesses a first set of search queries comprising one or more first search queries; extracts one or more features based on the first set of search queries, trains a search-query classifier using the features; accesses a second search query provided by a user; determines whether the second search query has implicit and general local intent using the search-query classifier; if the second search query has implicit and general local intent, then determines a location associated with the user; and identifies a search result in response to the second search query based at least in part on the location associated with the user; and presents the search result to the user.

摘要翻译： 一个特定实施例访问包括一个或多个第一搜索查询的第一组搜索查询; 基于第一组搜索查询提取一个或多个特征，使用特征训练搜索查询分类器; 访问由用户提供的第二搜索查询; 使用搜索查询分类器确定第二搜索查询是否具有隐含和一般的本地意图; 如果第二搜索查询具有隐含和一般的局部意图，则确定与用户相关联的位置; 并且至少部分地基于与所述用户相关联的位置来识别响应于所述第二搜索查询的搜索结果; 并将搜索结果呈现给用户。

公开(公告)号：US20090248595A1

公开(公告)日：2009-10-01

申请号：US12060154

申请日：2008-03-31

申请人： Yumao Lu ,  Nawaaz Ahmed ,  Fuchun Peng ,  Benoit Dumoulin

发明人： Yumao Lu ,  Nawaaz Ahmed ,  Fuchun Peng ,  Benoit Dumoulin

IPC分类号： G06F15/18

CPC分类号： G06F17/2765

摘要： Computer-enabled methods, apparatus, and computer-readable media are provided for verifying that a given network name, such as a URL, is an official, e.g., registered, approved, or otherwise officially recognized, network name that refers to or identifies a principal, such as a business. These techniques involve receiving a principal name and a given network name, receiving at least one feature attribute from at least one database of feature attributes, wherein the at least one feature attribute comprises a characteristic of the principal name or a characteristic of the network name, and invoking a logistic regression method to generate a probability, based upon the at least one feature attribute, that the given network name is an official network name for the principal name. The logistic regression method may include a gradient boosting tree model that generates the probability based upon the at least one feature attribute.

摘要翻译： 提供了计算机启用的方法，装置和计算机可读介质，用于验证给定的网络名称（例如URL）是官方的，例如，已注册，批准或以其他官方认可的网络名称，其指代或识别 校长，如企业。 这些技术包括接收主体名称和给定的网络名称，从特征属性的至少一个数据库接收至少一个特征属性，其中所述至少一个特征属性包括主体名称的特征或网络名称的特性， 以及调用逻辑回归方法以基于所述至少一个特征属性生成所述给定网络名称是所述主体名称的正式网络名称的概率。 逻辑回归方法可以包括基于至少一个特征属性生成概率的梯度增强树模型。

公开(公告)号：US08112436B2

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

申请号：US12563357

申请日：2009-09-21

申请人： Yumao Lu ,  Lei Duan ,  Fan Li ,  Benoit Dumoulin ,  Xing Wei

发明人： Yumao Lu ,  Lei Duan ,  Fan Li ,  Benoit Dumoulin ,  Xing Wei

IPC分类号： G06F17/30

CPC分类号： G06F17/30864

摘要： In one embodiment, access a search query comprising one or more query words, at least one of the query words representing one or more query concepts; access a network document identified for a search query by a search engine, the network document comprising one or more document words, at least one of the document words representing one or more document concepts; semantic-text match the search query and the network document to determine one or more negative semantic-text matches; and construct one or more negative features based on the negative semantic-text matches.

摘要翻译： 在一个实施例中，访问包括一个或多个查询词的搜索查询，表示一个或多个查询概念的查询词中的至少一个; 访问由搜索引擎识别为搜索查询的网络文档，所述网络文档包括一个或多个文档字，所述文档字中的至少一个表示一个或多个文档概念; 语义文本匹配搜索查询和网络文档以确定一个或多个否定语义文本匹配; 并基于负面语义文本匹配构造一个或多个负面特征。

公开(公告)号：US07809715B2

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

申请号：US12103126

申请日：2008-04-15

申请人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

发明人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

IPC分类号： G06F17/00 ,  G06F7/00

CPC分类号： G06F17/30672

摘要： A method for handling abbreviations in web queries includes building a dictionary of a plurality of possible word expansions for a plurality of potential abbreviations related to query terms received or anticipated to be received by a search engine; accepting a query including an abbreviation; expanding the abbreviation into one of the plurality of word expansions if a probability that the expansion is correct is above a threshold value, wherein the probability is determined by taking into consideration a context of the abbreviation within the query, wherein the context including at least anchor text; and sending the query with the expanded abbreviation to the search engine to generate a search results page related to the query.

摘要翻译： 一种用于处理网页查询中的缩写的方法包括为与搜索引擎接收或预期接收的查询词相关的多个潜在缩写构建多个可能的词扩展的字典; 接受包括缩写的查询; 如果扩展正确的概率高于阈值，则将缩写扩展为多个字扩展中的一个，其中，通过考虑查询内的缩写的上下文来确定概率，其中，上下文至少包括锚 文本; 并将具有扩展缩写的查询发送到搜索引擎以生成与查询相关的搜索结果页面。

公开(公告)号：US08204874B2

公开(公告)日：2012-06-19

申请号：US12884708

申请日：2010-09-17

申请人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

发明人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

IPC分类号： G06F17/00 ,  G06F7/00

CPC分类号： G06F17/30672

摘要： A method for handling abbreviations in web queries includes building a dictionary of possible word expansions for potential abbreviations related to query terms received and anticipated to be received by a search engine; accepting a query including an abbreviation from a searching user, where a probability of finding a most probably-correct expansion in the dictionary is a first probability, and a probability that the expansion is the abbreviation itself is a second probability; determining a ratio between the first and second probabilities; expanding the abbreviation in accordance with the most probably-correct expansion when the ratio is above a first threshold value; and highlighting the abbreviation with a suggested expansion of the most probably-correct expansion for the user so that the user may accept the suggested expansion when the ratio is between a second, lower threshold value and the first threshold value.

摘要翻译： 用于处理网络查询中的缩写的方法包括为与搜索引擎接收并预期接收的查询词相关的潜在缩写构建可能的词扩展的字典; 接受包括来自搜索用户的缩写的查询，其中发现字典中最可能正确的扩展的概率是第一概率，并且扩展是缩写本身的概率是第二概率; 确定第一和第二概率之间的比率; 当比率高于第一阈值时，根据最可能正确的扩展扩展缩写; 并且突出显示缩写，其中建议扩展用户的最可能正确的扩展，使得当比率在第二阈值和下限阈值之间时，用户可以接受建议的扩展。

公开(公告)号：US20090259629A1

公开(公告)日：2009-10-15

申请号：US12103126

申请日：2008-04-15

申请人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

发明人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

IPC分类号： G06F17/30

CPC分类号： G06F17/30672

摘要： A method for handling abbreviations in web queries includes building a dictionary of a plurality of possible word expansions for a plurality of potential abbreviations related to query terms received or anticipated to be received by a search engine; accepting a query including an abbreviation; expanding the abbreviation into one of the plurality of word expansions if a probability that the expansion is correct is above a threshold value, wherein the probability is determined by taking into consideration a context of the abbreviation within the query, wherein the context including at least anchor text; and sending the query with the expanded abbreviation to the search engine to generate a search results page related to the query.

摘要翻译： 一种用于处理网页查询中的缩写的方法包括为与搜索引擎接收或预期接收的查询词相关的多个潜在缩写构建多个可能的词扩展的字典; 接受包括缩写的查询; 如果扩展正确的概率高于阈值，则将缩写扩展为多个字扩展中的一个，其中，通过考虑查询内的缩写的上下文来确定概率，其中，上下文至少包括锚 文本; 并将具有扩展缩写的查询发送到搜索引擎以生成与查询相关的搜索结果页面。

公开(公告)号：US20110010353A1

公开(公告)日：2011-01-13

申请号：US12884708

申请日：2010-09-17

申请人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

发明人： Xing Wei ,  Fuchun Peng ,  Benoit Dumoulin

IPC分类号： G06F17/30

CPC分类号： G06F17/30672

摘要： A method for handling abbreviations in web queries includes building a dictionary of possible word expansions for potential abbreviations related to query terms received and anticipated to be received by a search engine; accepting a query including an abbreviation from a searching user, where a probability of finding a most probably-correct expansion in the dictionary is a first probability, and a probability that the expansion is the abbreviation itself is a second probability; determining a ratio between the first and second probabilities; expanding the abbreviation in accordance with the most probably-correct expansion when the ratio is above a first threshold value; and highlighting the abbreviation with a suggested expansion of the most probably-correct expansion for the user so that the user may accept the suggested expansion when the ratio is between a second, lower threshold value and the first threshold value.

摘要翻译： 一种用于处理网页查询中的缩写的方法包括为与搜索引擎接收并预期接收到的查询词相关的潜在缩写构建可能的词扩展字典; 接受包括来自搜索用户的缩写的查询，其中发现字典中最可能正确的扩展的概率是第一概率，并且扩展是缩写本身的概率是第二概率; 确定第一和第二概率之间的比率; 当比率高于第一阈值时，根据最可能正确的扩展扩展缩写; 并且突出显示缩写，其中建议扩展用户的最可能正确的扩展，使得当比率在第二阈值和下限阈值之间时，用户可以接受建议的扩展。

公开(公告)号：US20110072021A1

公开(公告)日：2011-03-24

申请号：US12563357

申请日：2009-09-21

申请人： Yumao Lu ,  Lei Duan ,  Fan Li ,  Benoit Dumoulin ,  Xing Wei

发明人： Yumao Lu ,  Lei Duan ,  Fan Li ,  Benoit Dumoulin ,  Xing Wei

IPC分类号： G06F17/30

CPC分类号： G06F17/30864

摘要： In one embodiment, access a search query comprising one or more query words, at least one of the query words representing one or more query concepts; access a network document identified for a search query by a search engine, the network document comprising one or more document words, at least one of the document words representing one or more document concepts; semantic-text match the search query and the network document to determine one or more negative semantic-text matches; and construct one or more negative features based on the negative semantic-text matches.

摘要翻译： 在一个实施例中，访问包括一个或多个查询词的搜索查询，表示一个或多个查询概念的查询词中的至少一个; 访问由搜索引擎识别为搜索查询的网络文档，所述网络文档包括一个或多个文档字，所述文档字中的至少一个表示一个或多个文档概念; 语义文本匹配搜索查询和网络文档以确定一个或多个否定语义文本匹配; 并基于负面语义文本匹配构造一个或多个负面特征。

公开(公告)号：US08010547B2

公开(公告)日：2011-08-30

申请号：US12103382

申请日：2008-04-15

申请人： Fuchun Peng ,  George H. Mills ,  Benoit Dumoulin

发明人： Fuchun Peng ,  George H. Mills ,  Benoit Dumoulin

IPC分类号： G06F17/30

CPC分类号： G06F17/277 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933

摘要： A method for normalizing query words in web search includes populating a dictionary with join and split candidates and corresponding joined and split words from an aggregate of query logs; determining a confidence score for join and split candidates, a highest confidence score for each being characterized in the dictionary as must-join and must-split, respectively; accepting queries with words amenable to being split or joined, or amenable to an addition or deletion of a hyphen or an apostrophe; generating, based on the accepted queries, split candidates obtained from the dictionary, and candidates of join, hyphen, or apostrophe algorithmically; and submitting to a search engine the generated possible candidates characterized as must-join or must-split in the dictionary, to improve search results returned in response to the queries; applying a language dictionary to generated candidates not characterized as must-split or must-join, to rank them, and submitting those highest-ranked to the search engine.

摘要翻译： 用于在网页搜索中归一化查询词的方法包括：从查询日志的聚合中填入具有连接和分离候选的词典和对应的连接和分割词; 确定联合和分裂候选人的置信度分数，每个词典的最高置信度分数分别表示为必须连接和必须分裂; 接受具有适合分裂或加入的词语的查询，或适合添加或删除连字符或撇号; 基于所接受的查询，从词典中分离出候选者，并且以算术方式生成加入，连字符或撇号的候选者; 并向搜索引擎提交产生的​​可能的候选人，其特征在于字典中必须加入或必须拆分，以改善响应于查询返回的搜索结果; 将语言字典应用于未被表征为必须拆分或必须加入的生成候选者，以便将其排在最高级别的搜索引擎中。