Abstract: Computer-readable media and computerized methods for automatically organizing search results according to task groups are provided. The methods involve aggregating a gallery of entities (e.g., search queries that share a common categorization) into a query class and assigning a dictionary (e.g., list of terms that are drawn from various sources) to the query class. The task groups are identified from the list of terms within the dictionary. The process of identification includes analyzing patterns of user search behavior to select terms from the list of terms, which reflect popular user search intents, and ranking the selected terms based on predetermined parameters to produce an ordering. Based on the ordering, a set of the selected terms that are highest ranked are declared the task groups. The task groups are employed to arrange the search results on a UI display and to provide a consistent and intuitive format for refining a search.

Abstract: Embodiments of the invention disclose an advertisement or segment of a webpage that displays suggested search queries as selectable links. Suggested queries may be based on content associated with the webpage, or the description of the webpage (such as a URL), or default suggestions. In one example, content of a page is crawled for terms that are mapped to suggested queries. Queries may be represented as textual links or multimedia images embedded in pages accessed over a network, and selection of a query may direct or enhance search engine traffic.

Abstract: Computer-readable media and computerized methods for automatically organizing search results according to task groups are provided. The methods involve aggregating a gallery of entities (e.g., search queries that share a common categorization) into a query class and assigning a dictionary (e.g., list of terms that are drawn from various sources) to the query class. The task groups are identified from the list of terms within the dictionary. The process of identification includes analyzing patterns of user search behavior to select terms from the list of terms, which reflect popular user search intents, and ranking the selected terms based on predetermined parameters to produce an ordering. Based on the ordering, a set of the selected terms that are highest ranked are declared the task groups. The task groups are employed to arrange the search results on a UI display and to provide a consistent and intuitive format for refining a search.

Abstract: Described herein are methods for creating categorized documents, categorizing documents in a distributed database and categorizing Resulting Pages. Also described herein is an apparatus for searching a distributed database. The method for creating categorized documents generally comprises: initially assuming all documents are of type 1; filtering out all type 2 documents and placing them in a first category; filtering out all type 3 documents and placing them in a second category; and defining all remaining documents as type 4 documents and placing all type 4 documents in a third category. The apparatus for searching a distributed database generally comprises at least one memory device; a computing apparatus; an indexer; a transactional score generator; and a category assignor; a search server; and a user interface in communication with the search server.

Abstract: The present invention provides a method and system for identifying terms in a requested Web document which can be used to identify other web page documents in which the user is likely to have an interest. Terms on previously prepared lists are compared to the content of the Web page document, and where matches are found, mathematical techniques including linear regression can be used to determine the relevance of the textual term to the content of the page. This can be used to suggest other linked Web page documents in which the user is likely to have an interest. Where the prepared lists include a term that has been purchased by advertisers, and there is a match for that term on the Web page document, an ad which is likely to interest the reader can be displayed on the requested Web page document, and can include a link to the advertiser's web site.

Abstract: Various embodiments are directed to a system and method providing associative matching of terms. Candidate terms are selected for building one or more associative matching models from one or more selected candidate sources. Associativity is defined to give editors the ability to label sample associative term pairs from the one or more candidate sources. The editors label sample candidate term pairs as being related. Features are determined that can differentiate associative from non-associative pairs. The selected features are used to build a model. The model is applied to determine whether a received query-candidate pair are associative.

Abstract: An example embodiment of the present invention provides processes for visually emphasizing the displayed URLs in query results based on implicit relevance feedback. In one process, the process identifies a web page which includes results returned by a search engine. Each result might include a displayed URL and an actual URL. The process determines whether the displayed URL matches any stored URLs which were included in previous results returned by the search engine and clicked through by the user. The process detects a click-through by matching the actual URL in an HTTP request emanating from a browser to an actual URL for a stored URL. The process visually emphasizes the displayed URL when presenting the web page to the user, if the displayed URL does not match any stored URL which has been clicked through and other factors indicate a probability the user will click through the displayed URL.

Abstract: Various embodiments are directed to a system and method providing associative matching of terms. Candidate terms are selected for building one or more associative matching models from one or more selected candidate sources. Associativity is defined to give editors the ability to label sample associative term pairs from the one or more candidate sources. The editors label sample candidate term pairs as being related. Features are determined that can differentiate associative from non-associative pairs. The selected features are used to build a model. The model is applied to determine whether a received query-candidate pair are associative.

Abstract: The likely relevance of each term of a search-engine query of two or more terms is determined by their deletion probability scores. If the deletion probability scores are significantly different, the deletion probability score can be used to return targeted ads related to the more relevant term or terms along with the search results. Deletion probability scores are determined by first gathering historical records of search queries of two or more terms in which a subsequent query was submitted by the same user after one or more of the terms had been deleted. The deletion probability score for a particular term of a search query is calculated as the ratio of the number of times that particular term was itself deleted prior to a subsequent search by the same user divided by the number of times there were subsequent search queries by the same user in which any term or terms including that given term was deleted by the same user prior to the subsequent search. Terms are not limited to individual alphabetic words.

Abstract: Described herein are methods for creating categorized documents, categorizing documents in a distributed database and categorizing Resulting Pages. Also described herein is an apparatus for searching a distributed database. The method for creating categorized documents generally comprises: initially assuming all documents are of type 1; filtering out all type 2 documents and placing them in a first category; filtering out all type 3 documents and placing them in a second category; and defining all remaining documents as type 4 documents and placing all type 4 documents in a third category. The apparatus for searching a distributed database generally comprises at least one memory device; a computing apparatus; an indexer; a transactional score generator; and a category assignor; a search server; and a user interface in communication with the search server.

Abstract: In one implementation a method for disambiguation of search phrases is provided, which may include identifying interpretation clusters using bidded search terms of content providers and influencing a position of a search result in a search results list based on the interpretation clusters. In one implementation a method is provided for interpretation clustering, which may include identifying terms and associated content providers and calculating a matrix from the identified terms and associated content providers. Similarity scores between content providers based on the matrix are calculated and interpretation clusters are assigned using the similarity scores. Bidded search terms and/or searcher clickthrough terms may be used. In one implementation, a method is provided for increasing the relevance of search results, which may include receiving a search query and identifying the search query as ambiguous.

Abstract: Described herein are methods for creating categorized documents, categorizing documents in a distributed database and categorizing Resulting Pages. Also described herein is an apparatus for searching a distributed database. The method for creating categorized documents generally comprises: initially assuming all documents are of type 1; filtering out all type 2 documents and placing them in a first category; filtering out all type 3 documents and placing them in a second category; and defining all remaining documents as type 4 documents and placing all type 4 documents in a third category. The apparatus for searching a distributed database generally comprises at least one memory device; a computing apparatus; an indexer; a transactional score generator; and a category assignor; a search server; and a user interface in communication with the search server.