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

11. 发明授权

US07996410B2 Word pluralization handling in query for web search 有权
标题翻译：在Web搜索查询中的Word复数处理
公开(公告)号：US07996410B2
公开(公告)日：2011-08-09
申请号：US11701736
申请日：2007-02-01
申请人： Fuchun Peng , Nawaaz Ahmed , Xin Li , Yumao Lu
发明人： Fuchun Peng , Nawaaz Ahmed , Xin Li , Yumao Lu
IPC分类号： G06F7/00
CPC分类号： G06F17/30864
摘要： Techniques for determining when and how to transform words in a query to its plural or non-plural form in order to provide the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon the words used in a specified number of previous most frequent search queries and comprises lists of transformations from plural to singular and singular to plural. Unnecessary transformations are removed from the dictionary based upon language modeling. The word to transform is determined by finding the last non-stop re-writable word of the query. The context of the transformed word is confirmed in the search documents and a version of the query is executed using both the original form of the word and the transformation of the word.
摘要翻译：提供了用于确定何时以及如何将查询中的单词转换为多个或非复数形式的技术，以便在最小化计算开销的同时提供最相关的搜索结果。基于在指定数量的先前最频繁的搜索查询中使用的词来生成字典，并且包括从多个到单数和单数到多个的变换的列表。基于语言建模，从字典中删除不必要的转换。要转换的词是通过查找查询的最后一个不间断的可重写词来确定的。在搜索文档中确认转换词的上下文，并且使用单词的原始形式和单词的转换来执行查询的版本。

12. 发明授权

US07630978B2 Query rewriting with spell correction suggestions using a generated set of query features 有权
标题翻译：使用生成的查询功能集查询重写拼写修正建议
公开(公告)号：US07630978B2
公开(公告)日：2009-12-08
申请号：US11639492
申请日：2006-12-14
申请人： Xin Li , Nawaaz Ahmed , Fuchun Peng , Yumao Lu
发明人： Xin Li , Nawaaz Ahmed , Fuchun Peng , Yumao Lu
IPC分类号： G06F17/30
CPC分类号： G06F17/30672 , Y10S707/99933 , Y10S707/99935
摘要： Techniques for rewriting queries submitted to a query engine are provided. A query is submitted by a user and sent to a search mechanism. Based on the query, one or more query suggestions are generated. Features are generated based on the query and the query suggestions. Those features are input to a trained machine learning mechanism that generates a rewrite score. The rewrite score signifies a confidence score that indicates how confident the search mechanism is that the user intended to submit the original query. If the rewrite score is below a certain threshold, then the original query is rewritten to a second query. Results of executing the original query may be sent to the user along with a reference to the second query. Additionally or alternatively, results of executing the second query are sent to the user.
摘要翻译：提供了重写提交到查询引擎的查询的技术。查询由用户提交并发送到搜索机制。基于该查询，生成一个或多个查询建议。功能根据查询和查询建议生成。这些功能被输入到产生重写分数的训练有素的机器学习机制。重写分数表示置信度分数，表示用户希望提交原始查询的搜索机制的信心。如果重写分数低于某个阈值，则原始查询被重写为第二个查询。执行原始查询的结果可以与对第二个查询的引用一起发送给用户。另外或替代地，执行第二查询的结果被发送给用户。

13. 发明申请

US20080147637A1 Query rewriting with spell correction suggestions 有权
标题翻译：使用拼写修正建议查询重写
公开(公告)号：US20080147637A1
公开(公告)日：2008-06-19
申请号：US11639492
申请日：2006-12-14
申请人： Xin Li , Nawaaz Ahmed , Fuchun Peng , Yumao Lu
发明人： Xin Li , Nawaaz Ahmed , Fuchun Peng , Yumao Lu
IPC分类号： G06F17/30
CPC分类号： G06F17/30672 , Y10S707/99933 , Y10S707/99935
摘要： Techniques for rewriting queries submitted to a query engine are provided. A query is submitted by a user and sent to a search mechanism. Based on the query, one or more query suggestions are generated. Features are generated based on the query and the query suggestions. Those features are input to a trained machine learning mechanism that generates a rewrite score. The rewrite score signifies a confidence score that indicates how confident the search mechanism is that the user intended to submit the original query. If the rewrite score is below a certain threshold, then the original query is rewritten to a second query. Results of executing the original query may be sent to the user along with a reference to the second query. Additionally or alternatively, results of executing the second query are sent to the user.
摘要翻译：提供了重写提交到查询引擎的查询的技术。查询由用户提交并发送到搜索机制。基于该查询，生成一个或多个查询建议。功能根据查询和查询建议生成。这些功能被输入到产生重写分数的训练有素的机器学习机制。重写分数表示置信度分数，表示用户希望提交原始查询的搜索机制的信心。如果重写分数低于某个阈值，则原始查询被重写为第二个查询。执行原始查询的结果可以与对第二个查询的引用一起发送给用户。另外或替代地，执行第二查询的结果被发送给用户。

14. 发明申请

US20080059508A1 Techniques for navigational query identification 有权
标题翻译：导航查询识别技术
公开(公告)号：US20080059508A1
公开(公告)日：2008-03-06
申请号：US11514076
申请日：2006-08-30
申请人： Yumao Lu , Fuchun Peng , Xin Li , Nawaaz Ahmed
发明人： Yumao Lu , Fuchun Peng , Xin Li , Nawaaz Ahmed
IPC分类号： G06F17/00
CPC分类号： G06K9/623 , G06F17/30707 , G06F17/30864 , G06K9/6278
摘要： To accurately classify a query as navigational, thousands of available features are explored, extracted from major commercial search engine results, user Web search click data, query log, and the whole Web's relational content. To obtain the most useful features for navigational query identification, a three level system is used which integrates feature generation, feature integration, and feature selection in a pipeline. Because feature selection plays a key role in classification methodologies, the best feature selection method is coupled with the best classification approach to achieve the best performance for identifying navigational queries. According to one embodiment, linear Support Vector Machine (SVM) is used to rank features and the top ranked features are fed into a Stochastic Gradient Boosting Tree (SGBT) classification method for identifying whether or not a particular query is a navigational query.
摘要翻译：为了将查询精确地分类为导航，从主要商业搜索引擎结果，用户Web搜索点击数据，查询日志和整个Web的关系内容中提取出数千种可用功能。为了获得导航查询识别最有用的功能，使用了一个三级系统，将特征生成，特征集成和特征选择集成在一条流水线中。因为特征选择在分类方法中起着关键作用，因此最好的特征选择方法与最佳分类方法相结合，以实现识别导航查询的最佳性能。根据一个实施例，使用线性支持向量机（SVM）对特征进行排序，并且将顶级特征馈送到用于识别特定查询是否是导航查询的随机渐变增强树（SGBT）分类方法中。

15. 发明授权

US07974971B2 Query identification and normalization for web search 有权
标题翻译：网页搜索的查询识别和归一化
公开(公告)号：US07974971B2
公开(公告)日：2011-07-05
申请号：US12818036
申请日：2010-06-17
申请人： Yumao Lu , Nawaaz Ahmed , Fuchun Peng , Marco Zagha
发明人： Yumao Lu , Nawaaz Ahmed , Fuchun Peng , Marco Zagha
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/3064
摘要： A computer-implemented method for processing user entered query data to improve results of a search of pages using a local search database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using a probabilistic dictionary to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the local search database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.
摘要翻译：公开了一种用于处理用户输入的查询数据以在搜索互联网时改进使用本地搜索数据库搜索页面的结果的计算机实现的方法。该方法包括接收用户输入的查询数据和解析查询数据的每个单词并使用概率词典分割单词，以确定单词对于特定名称的可能性。并且，将特定名称与名称标签相关联以创建一个或多个标记名称术语。然后，对每个标记的名称术语进行归一化，并且如果在本地搜索数据库中找到，则包括增强信息的归一化，并且确定所选标记的名称术语之间的接近度。该方法然后生成一个优化的搜索查询，其中包含标准化术语和运算符。优化的搜索查询被应用于互联网，以响应于输入的查询数据来产生和显示给用户的搜索结果。

16. 发明申请

US20090248595A1 NAME VERIFICATION USING MACHINE LEARNING 审中-公开
标题翻译：使用机器学习的名称验证
公开(公告)号：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）是官方的，例如，已注册，批准或以其他官方认可的网络名称，其指代或识别校长，如企业。这些技术包括接收主体名称和给定的网络名称，从特征属性的至少一个数据库接收至少一个特征属性，其中所述至少一个特征属性包括主体名称的特征或网络名称的特性，以及调用逻辑回归方法以基于所述至少一个特征属性生成所述给定网络名称是所述主体名称的正式网络名称的概率。逻辑回归方法可以包括基于至少一个特征属性生成概率的梯度增强树模型。

17. 发明申请

US20090182729A1 LOCAL QUERY IDENTIFICATION AND NORMALIZATION FOR WEB SEARCH 有权
标题翻译： WEB查询的本地查询标识和正常化
公开(公告)号：US20090182729A1
公开(公告)日：2009-07-16
申请号：US12015448
申请日：2008-01-16
申请人： Yumao Lu , Nawaaz Ahmed , Fuchun Peng , Marco Zagha
发明人： Yumao Lu , Nawaaz Ahmed , Fuchun Peng , Marco Zagha
IPC分类号： G06F7/06
CPC分类号： G06F17/30867 , G06F17/3064
摘要： Computer-implemented methods and systems for processing user entered query data to improve results of a search of pages using a local search database are provided, when searching the internet. The method includes receiving the user entered query data and parsing each word of the query data and examining each word to determine if the word is associated with one of a business name, a city name or a state name. The examining uses probabilistic dictionaries to determine a likelihood that the word is one of the business name, the city name or the state name. Then, associating the words that were determined to be: (i) the business name with a business name tag to create one or more tagged business terms; (ii) the city name with a city name tag to create one or more tagged city terms; and (iii) the state name with a state name tag to create one or more tagged state terms. The method further includes normalizing each of the tagged business terms, the tagged city terms and the tagged state terms. The normalizing includes boosting information if found in the local search database and determining proximity between selected ones of the tagged business, city or state terms. Then, generating an optimized internal search query that incorporates constraints and ranking based on at least the boosting information and the determined proximity between the selected tagged business, city or state terms. The optimized internal search query is applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.
摘要翻译：当搜索互联网时，提供了用于处理用户输入的查询数据以改进使用本地搜索数据库的页面搜索结果的计算机实现的方法和系统。该方法包括接收用户输入的查询数据并解析查询数据的每个单词并检查每个单词以确定该单词是否与商务名称，城市名称或州名称之一相关联。检查使用概率词典来确定该词是商业名称，城市名称或州名称之一的可能性。然后，将确定为：（i）商业名称与商家名称标签相关联的字词，以创建一个或多个标记的商业条款; （ii）具有城市名称标签的城市名称，以创建一个或多个标记的城市条款; 和（iii）具有状态名称标签的状态名称以创建一个或多个标记状态项。该方法还包括对每个标记的业务术语，标记的城市术语和标记的状态项进行归一化。标准化包括在本地搜索数据库中找到增强信息，并确定所标记的业务，城市或州条款之间的接近度。然后，生成优化的内部搜索查询，该内部搜索查询至少基于提升信息和确定的所选标记的商业，城市或状态条件之间的接近度来结合约束和排序。优化的内部搜索查询被应用于互联网，以便响应于输入的查询数据而产生并显示给用户的搜索结果。

18. 发明申请

US20110184981A1 Personalize Search Results for Search Queries with General Implicit Local Intent 审中-公开
标题翻译：个性化搜索查询与一般隐含本地意图的搜索结果
公开(公告)号：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.
摘要翻译：一个特定实施例访问包括一个或多个第一搜索查询的第一组搜索查询; 基于第一组搜索查询提取一个或多个特征，使用特征训练搜索查询分类器; 访问由用户提供的第二搜索查询; 使用搜索查询分类器确定第二搜索查询是否具有隐含和一般的本地意图; 如果第二搜索查询具有隐含和一般的局部意图，则确定与用户相关联的位置; 并且至少部分地基于与所述用户相关联的位置来识别响应于所述第二搜索查询的搜索结果; 并将搜索结果呈现给用户。

19. 发明申请

US20100191758A1 SYSTEM AND METHOD FOR IMPROVED SEARCH RELEVANCE USING PROXIMITY BOOSTING 审中-公开
标题翻译：使用接近推进来改进搜索相关性的系统和方法
公开(公告)号：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搜索的查询，其中所述查询包括多个查询令牌。在查询中识别一个或多个概念，其中每个概念包括至少两个查询令牌。确定每个识别的概念的相对概念强度。然后，该查询被重写以提交给搜索引擎，其中对于一个或多个概念中的每一个，与概念的相应相对概念强度相关联的语法规则被应用于包括概念的查询令牌，使得重写的查询表示提高了一个或多个概念，由此响应于重写的查询，搜索引擎向用户返回的搜索结果中的一个或多个概念的接近度被提升。

20. 发明授权

US08112436B2 Semantic and text matching techniques for network search 有权
标题翻译：网络搜索的语义和文本匹配技术
公开(公告)号：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.
摘要翻译：在一个实施例中，访问包括一个或多个查询词的搜索查询，表示一个或多个查询概念的查询词中的至少一个; 访问由搜索引擎识别为搜索查询的网络文档，所述网络文档包括一个或多个文档字，所述文档字中的至少一个表示一个或多个文档概念; 语义文本匹配搜索查询和网络文档以确定一个或多个否定语义文本匹配; 并基于负面语义文本匹配构造一个或多个负面特征。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式