-
公开(公告)号：US20110179017A1
公开(公告)日：2011-07-21
申请号：US12690184
申请日：2010-01-20
申请人： CHRISTOPHER AVERY MEYERS , GOPI PRASHANTH GOPAL , ANDREW PETER OAKLEY , NITIN AGRAWAL , NICHOLAS ERIC CRASWELL , MILAD SHOKOUHI , DERRICK LESLIE CONNELL , SANAZ AHARI , NEIL BRUCE SHARMAN , GAURAV SAREEN , HUGH EVAN WILLIAMS , JAY KUMAR GOYAL
发明人： CHRISTOPHER AVERY MEYERS , GOPI PRASHANTH GOPAL , ANDREW PETER OAKLEY , NITIN AGRAWAL , NICHOLAS ERIC CRASWELL , MILAD SHOKOUHI , DERRICK LESLIE CONNELL , SANAZ AHARI , NEIL BRUCE SHARMAN , GAURAV SAREEN , HUGH EVAN WILLIAMS , JAY KUMAR GOYAL
CPC分类号： G06F17/30448 , G06Q30/0254
摘要： Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.
摘要翻译： 提供了方法，系统和媒体，用于识别和聚集正在日益普及的查询。 可以使用文本和时间相关性将所产生的聚类查询与其他存储的查询进行比较。 搜索包含最近爬取的内容源的信息和结果的新索引以获取最近的查询活动。 还搜索历史索引以获得与聚集查询流匹配的时间相关信息和结果。 可以计算穗的加权平均加速度，以区分合法穗和非合法穗。 合法集群与其他存储的集群组合，并以分组的内容结果呈现给用户输出设备。
-
公开(公告)号：US20110016115A1
公开(公告)日：2011-01-20
申请号：US12890043
申请日：2010-09-24
IPC分类号： G06F17/30
CPC分类号： G06F17/3064
摘要： An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.
摘要翻译： 提供了一种基于文档集合内的电子文档的链接结构来确定给定搜索查询的相关查询的方法。 文件标题用于表示潜在的搜索查询，电子文档之间的链接用于确定潜在搜索查询之间的关系。 因此，文档集可以被表示为有向图，其中文档标题（其表示潜在的搜索查询）是节点，并且链接是节点之间的边缘。 当接收到特定搜索查询时，识别相应的节点，并通过识别具有与该节点的连接的其他节点来确定相关查询。
-
公开(公告)号：US20110016134A1
公开(公告)日：2011-01-20
申请号：US12890086
申请日：2010-09-24
IPC分类号： G06F17/30
CPC分类号： G06F17/3064
摘要： An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.
-
4.发明申请公开(公告)号：US20090303238A1
公开(公告)日：2009-12-10
申请号：US12134334
申请日：2008-06-06
CPC分类号： G06F17/30389 , G06F17/30864
摘要： Computer-readable media and computerized methods for identifying candidate points on a graphical depiction of relative popularity of an entity (e.g., entertainer, sports team, and the like) are provided. Points on the graphical depiction are ranked based on a number of user-submitted web queries that reference the entity that are received during a particular time frame. Peak points and slope values (i.e., derived from an angle of inclination of inclines on the graphical depiction) may be captured by analyzing movements in the rank of an entity over time. An algorithmic process may then be applied to the peak points and slope values to determine points of interest of the entity's popularity, such as the highest-ranked periods and/or dramatic positive movements in rank of the entity. These points of interest are selected as candidate points and are surfaced as icons on a visual representation of the graphical depiction.
摘要翻译： 提供了用于识别实体（例如，艺人，运动团队等）的相对受欢迎程度的图形描绘上的候选点的计算机可读介质和计算机化方法。 基于在特定时间框架内引用实体的用户提交的Web查询的数量来对图形描述上的点进行排序。 峰值点和斜率值（即，从图形描绘上的倾斜倾角导出）可以通过分析实体随时间推移的运动来捕获。 然后可以将算法过程应用于峰值点和斜率值，以确定实体的受欢迎程度的兴趣点，例如实体排名中排名最高的周期和/或剧烈的正移动。 这些兴趣点被选为候选点，并且作为图形描绘的视觉表示的表示。
-
公开(公告)号：US20080306934A1
公开(公告)日：2008-12-11
申请号：US11761038
申请日：2007-06-11
CPC分类号： G06F17/3064
摘要： An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.
摘要翻译： 提供了一种基于文档集合内的电子文档的链接结构来确定给定搜索查询的相关查询的方法。 文件标题用于表示潜在的搜索查询，电子文档之间的链接用于确定潜在搜索查询之间的关系。 因此，文档集可以被表示为有向图，其中文档标题（其表示潜在的搜索查询）是节点，并且链接是节点之间的边缘。 当接收到特定搜索查询时，识别相应的节点，并通过识别具有与该节点的连接的其他节点来确定相关查询。
-
公开(公告)号：US20080235187A1
公开(公告)日：2008-09-25
申请号：US11690585
申请日：2007-03-23
申请人： KRISHNA CHAITANYA GADE , SRINATH REDDY AALETI , NICHOLAS ERIC CRASWELL , AMIT PRAKASH , HUGH EVAN WILLIAMS
发明人： KRISHNA CHAITANYA GADE , SRINATH REDDY AALETI , NICHOLAS ERIC CRASWELL , AMIT PRAKASH , HUGH EVAN WILLIAMS
IPC分类号： G06F17/30
CPC分类号： G06F17/3064 , G06F17/30864 , G06F17/30876
摘要： An inversion of the basic format of searching is provided herein. Instead of receiving a search query and providing web page results, a search engine receives a web page identifier as search input from an end user, determines related search queries for the associated web page, and provides the related search queries to the end user issuing the search. Related search queries for web pages may also be used to refine search engines performing the basic form of searching by facilitating the determination of web pages to index and the ranking of web pages as search results to user queries. Additionally, related search queries may be used in advertising revenue generation and sharing.
摘要翻译： 本文提供了搜索的基本格式的反转。 搜索引擎不是接收搜索查询和提供网页结果，而是从最终用户接收到作为搜索输入的网页标识符，确定相关网页的相关搜索查询，并且向最终用户发出相关搜索查询 搜索。 用于网页的相关搜索查询还可以用于通过促进确定网页的索引和将网页的排名作为用户查询的搜索结果来优化执行基本搜索形式的搜索引擎。 此外，相关搜索查询可用于广告收入生成和共享。
-
公开(公告)号：US20130339001A1
公开(公告)日：2013-12-19
申请号：US13526778
申请日：2012-06-19
IPC分类号： G06F17/27
CPC分类号： G06F17/273 , G06F16/951 , G06F17/24 , G06F17/2785
摘要： Methods, systems, and media are provided for generating one or more spelling candidates. A query log is received, which contains one or more user-input queries. The user-input queries are divided into one or more common context groups. Each term of the user-input queries is ranked within a common context group according to a frequency of occurrence to form a ranked list for each of the one or more common context groups. A chain algorithm is implemented to the respective ranked lists to identify a base word and a set of one or more subordinate words paired with the base word. The base word and all sets of the subordinate words from all of the respective ranked lists are aggregated to form one or more chains of spelling candidates for the base word.
摘要翻译： 提供了用于生成一个或多个拼写候选的方法，系统和媒体。 接收到查询日志，其中包含一个或多个用户输入的查询。 用户输入的查询被分成一个或多个常见的上下文组。 用户输入查询的每个术语根据发生的频率被排列在公共上下文组中，以形成一个或多个公共上下文组中的每一个的排名列表。 链路算法被实现到各个排列的列表，以识别基本词和与该基本词配对的一个或多个从属词的集合。 来自所有相应排名的列表的基本单词和所有下级单词集合以形成用于基本词的一个或多个拼写候选链。
-
公开(公告)号：US20130346400A1
公开(公告)日：2013-12-26
申请号：US13528411
申请日：2012-06-20
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Embodiment described herein are directed to an enhanced search engine with multiple feedback loops for providing optimal search results that are responsive a user's search query. The user's search query is parsed, and based on the underlying terms, different linguistic models and refinement techniques generate alternative candidate search queries that may yield better results. Searches are performed for the original search query and the candidate search queries, and different scores are used to select the best search results to present to the user. Results making it onto the list, as well as the underlying candidate search query, linguistic model, or refinement technique for generating that search query, will have their corresponding scores updated to reflect their success of generating a search result. Scores are stored and used by future searches to come up with better results.
摘要翻译： 本文描述的实施例涉及具有多个反馈回路的增强搜索引擎，用于提供响应用户搜索查询的最佳搜索结果。 用户的搜索查询被解析，并且基于基础术语，不同的语言模型和细化技术产生可能产生更好结果的替代候选搜索查询。 对原始搜索查询和候选搜索查询执行搜索，并且使用不同的分数来选择要呈现给用户的最佳搜索结果。 将其列入列表的结果以及用于生成该搜索查询的底层候选搜索查询，语言模型或细化技术将更新其相应的分数，以反映其生成搜索结果的成功。 未来的搜索记录和使用得分可以获得更好的结果。
-
公开(公告)号：US20120197905A1
公开(公告)日：2012-08-02
申请号：US13019696
申请日：2011-02-02
申请人： GIRISH KUMAR , ALFIAN TAN , NICHOLAS ERIC CRASWELL
发明人： GIRISH KUMAR , ALFIAN TAN , NICHOLAS ERIC CRASWELL
IPC分类号： G06F17/30
CPC分类号： G06F17/2785 , G06F17/279 , G06F17/3053 , G06F17/30684
摘要： Subject matter described herein is related to determining a document score, which suggests a relevance of a document (e.g., webpage) to a search query. For example, a search query is received that is comprised of one or more terms, which represent a subject. An equivalent subject is identified that is semantically similar to the subject. The document score is determined by accounting for both a subject frequency and an equivalent-subject frequency.
摘要翻译： 本文描述的主题涉及确定文档分数，其提示文档（例如，网页）与搜索查询的相关性。 例如，接收到由表示主题的一个或多个术语组成的搜索查询。 识别与受试者语义相似的等同主题。 通过计算主体频率和等效对象频率来确定文档得分。
-
-
-
-
-
-
-
-
搜索结果
9 条记录 (耗时 0.038 秒)
