会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Predictive stemming for web search with statistical machine translation models
    • 用统计机器翻译模型进行网络搜索的预测性干扰
    • US07788276B2
    • 2010-08-31
    • US11843560
    • 2007-08-22
    • Fuchun PengNawaaz AhmedYumao LuMarco J. Zagha
    • Fuchun PengNawaaz AhmedYumao LuMarco J. Zagha
    • G06F17/30
    • G06F17/30672G06F17/30646G06F17/30737
    • Techniques for determining when and how to transform words in a query to return the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon words used in a specified number of previous most frequent search queries and comprises lists of transformations that may include variants based upon the stems of words, synonyms, and abbreviation expansions. When a query is received from a user, candidate queries are generated based upon replacing particular words in the query with a transformation of the particular words. Candidate queries are selected that have a high probability of returning relevant results by computing values of the query using language model scoring and translation scoring. The selected candidate queries and the original query are executed to return search results. The search results are displayed to the user with the words in the original query and the transformed words in bold.
    • 提供了用于确定何时以及如何在查询中转换词以返回最相关的搜索结果同时最小化计算开销的技术。 基于在指定数量的先前最频繁的搜索查询中使用的词来生成字典,并且包括可以包括基于词的词干,同义词和缩写扩展的变体的变换列表。 当从用户接收到查询时,基于用特定单词的变换替换查询中的特定单词来生成候选查询。 选择候选查询,通过使用语言模型评分和翻译评分计算查询的值,具有很高的返回相关结果的概率。 执行所选择的候选查询和原始查询以返回搜索结果。 搜索结果以原始查询中的单词显示给用户,而转换后的单词以粗体显示。
    • 12. 发明授权
    • Query rewriting with spell correction suggestions using a generated set of query features
    • 使用生成的查询功能集查询重写拼写修正建议
    • US07630978B2
    • 2009-12-08
    • US11639492
    • 2006-12-14
    • Xin LiNawaaz AhmedFuchun PengYumao Lu
    • Xin LiNawaaz AhmedFuchun PengYumao Lu
    • G06F17/30
    • G06F17/30672Y10S707/99933Y10S707/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. 发明申请
    • Query rewriting with spell correction suggestions
    • 使用拼写修正建议查询重写
    • US20080147637A1
    • 2008-06-19
    • US11639492
    • 2006-12-14
    • Xin LiNawaaz AhmedFuchun PengYumao Lu
    • Xin LiNawaaz AhmedFuchun PengYumao Lu
    • G06F17/30
    • G06F17/30672Y10S707/99933Y10S707/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. 发明申请
    • Techniques for navigational query identification
    • 导航查询识别技术
    • US20080059508A1
    • 2008-03-06
    • US11514076
    • 2006-08-30
    • Yumao LuFuchun PengXin LiNawaaz Ahmed
    • Yumao LuFuchun PengXin LiNawaaz Ahmed
    • G06F17/00
    • G06K9/623G06F17/30707G06F17/30864G06K9/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. 发明授权
    • Query identification and normalization for web search
    • 网页搜索的查询识别和归一化
    • US07974971B2
    • 2011-07-05
    • US12818036
    • 2010-06-17
    • Yumao LuNawaaz AhmedFuchun PengMarco Zagha
    • Yumao LuNawaaz AhmedFuchun PengMarco Zagha
    • G06F17/30
    • G06F17/30867G06F17/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. 发明申请
    • LOCAL QUERY IDENTIFICATION AND NORMALIZATION FOR WEB SEARCH
    • WEB查询的本地查询标识和正常化
    • US20090182729A1
    • 2009-07-16
    • US12015448
    • 2008-01-16
    • Yumao LuNawaaz AhmedFuchun PengMarco Zagha
    • Yumao LuNawaaz AhmedFuchun PengMarco Zagha
    • G06F7/06
    • G06F17/30867G06F17/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)具有状态名称标签的状态名称以创建一个或多个标记状态项。 该方法还包括对每个标记的业务术语,标记的城市术语和标记的状态项进行归一化。 标准化包括在本地搜索数据库中找到增强信息,并确定所标记的业务,城市或州条款之间的接近度。 然后,生成优化的内部搜索查询,该内部搜索查询至少基于提升信息和确定的所选标记的商业,城市或状态条件之间的接近度来结合约束和排序。 优化的内部搜索查询被应用于互联网,以便响应于输入的查询数据而产生并显示给用户的搜索结果。
    • 17. 发明申请
    • Personalize Search Results for Search Queries with General Implicit Local Intent
    • 个性化搜索查询与一般隐含本地意图的搜索结果
    • US20110184981A1
    • 2011-07-28
    • US12694515
    • 2010-01-27
    • Yumao LuFuchun PengBenoit Dumoulin
    • Yumao LuFuchun PengBenoit Dumoulin
    • G06F17/30
    • 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.
    • 一个特定实施例访问包括一个或多个第一搜索查询的第一组搜索查询; 基于第一组搜索查询提取一个或多个特征,使用特征训练搜索查询分类器; 访问由用户提供的第二搜索查询; 使用搜索查询分类器确定第二搜索查询是否具有隐含和一般的本地意图; 如果第二搜索查询具有隐含和一般的局部意图,则确定与用户相关联的位置; 并且至少部分地基于与所述用户相关联的位置来识别响应于所述第二搜索查询的搜索结果; 并将搜索结果呈现给用户。
    • 18. 发明申请
    • SYSTEM AND METHOD FOR IMPROVED SEARCH RELEVANCE USING PROXIMITY BOOSTING
    • 使用接近推进来改进搜索相关性的系统和方法
    • US20100191758A1
    • 2010-07-29
    • US12360008
    • 2009-01-26
    • Fuchun PengXing WeiYumao LuXin LiDonald MetzlerHang CuiBenoit Dumoulin
    • Fuchun PengXing WeiYumao LuXin LiDonald MetzlerHang CuiBenoit Dumoulin
    • G06F17/30
    • G06F16/951G06F16/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搜索的查询,其中所述查询包括多个查询令牌。 在查询中识别一个或多个概念,其中每个概念包括至少两个查询令牌。 确定每个识别的概念的相对概念强度。 然后,该查询被重写以提交给搜索引擎,其中对于一个或多个概念中的每一个,与概念的相应相对概念强度相关联的语法规则被应用于包括概念的查询令牌,使得重写的查询表示 提高了一个或多个概念,由此响应于重写的查询,搜索引擎向用户返回的搜索结果中的一个或多个概念的接近度被提升。
    • 19. 发明授权
    • Normalizing query words in web search
    • 在网页搜索中规范化查询词
    • US08010547B2
    • 2011-08-30
    • US12103382
    • 2008-04-15
    • Fuchun PengGeorge H. MillsBenoit Dumoulin
    • Fuchun PengGeorge H. MillsBenoit Dumoulin
    • G06F17/30
    • G06F17/277Y10S707/99931Y10S707/99932Y10S707/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.
    • 用于在网页搜索中归一化查询词的方法包括:从查询日志的聚合中填入具有连接和分离候选的词典和对应的连接和分割词; 确定联合和分裂候选人的置信度分数,每个词典的最高置信度分数分别表示为必须连接和必须分裂; 接受具有适合分裂或加入的词语的查询,或适合添加或删除连字符或撇号; 基于所接受的查询,从词典中分离出候选者,并且以算术方式生成加入,连字符或撇号的候选者; 并向搜索引擎提交产生的​​可能的候选人,其特征在于字典中必须加入或必须拆分,以改善响应于查询返回的搜索结果; 将语言字典应用于未被表征为必须拆分或必须加入的生成候选者,以便将其排在最高级别的搜索引擎中。
    • 20. 发明授权
    • Abbreviation handling in web search
    • Web搜索中的缩写处理
    • US07809715B2
    • 2010-10-05
    • US12103126
    • 2008-04-15
    • Xing WeiFuchun PengBenoit Dumoulin
    • Xing WeiFuchun PengBenoit Dumoulin
    • G06F17/00G06F7/00
    • 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.
    • 一种用于处理网页查询中的缩写的方法包括为与搜索引擎接收或预期接收的查询词相关的多个潜在缩写构建多个可能的词扩展的字典; 接受包括缩写的查询; 如果扩展正确的概率高于阈值,则将缩写扩展为多个字扩展中的一个,其中,通过考虑查询内的缩写的上下文来确定概率,其中,上下文至少包括锚 文本; 并将具有扩展缩写的查询发送到搜索引擎以生成与查询相关的搜索结果页面。