Abstract: A method, system, and medium are provided for enhancing a search result snippet that is associated with a URL. Potentially descriptive terms of the URL are identified by reconciling multiple sources of terms related to the URL. One aspect includes comparing search terms of historically relevant queries to anchor text for the URL. The search result snippet might be intelligently enhanced by causing common terms to be visibly distinguished when the snippet is displayed.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method, system, and medium are provided for enhancing a search result snippet that is associated with a URL. Potentially descriptive terms of the URL are identified by reconciling multiple sources of terms related to the URL. One aspect includes comparing search terms of historically relevant queries to anchor text for the URL. The search result snippet might be intelligently enhanced by causing common terms to be visibly distinguished when the snippet is displayed.

Abstract: 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.

Abstract: A computer system, method, and media for associating locations with ranked websites are provided. The computer system includes a search engine, a log database, and a location database that are employed to respond to search requests from users by returning appropriately ranked websites to the user. The websites are ranked using the location of the website and the location of the user to select websites to receive high ranks. Additionally, the search engine includes a correction feature that reevaluates locations for a website or user when a large number of obtained locations suggest a different location than a currently associated location for the website or the user.

Abstract: 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.

Abstract: 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.