Google Inc.

Oleksandr Grushetskyy

Steven D Baker

Hyung-Jin Kim

Andrei Lopatenko

Evgeny A Cherepanov

Dmitry N Orlov

Trystan G Upstill

Navneet Panda

Andrei Damian

Aysel Ozgur

A computer-implemented method for processing query information includes receiving data representative of a search query from a user search session. The method also includes identifying a plurality of search results based upon the search query. Each search result is associated with a plurality of user characteristics and data that represents requestor behavior relative to previously submitted queries associated with the respective search result. The method also includes ordering the plurality of user characteristics based upon the data that represents requestor behavior relative to previously submitted queries and the respective search result. The method also includes adjusting the ordered plurality of user characteristics based upon at least one predefined compatibility associated with the user characteristics. The method also includes ranking the search results based upon the adjusted plurality of user characteristics.

Refining search results

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for servicing search queries. In one aspect, a method includes determining that a general search query is a locally significant query for a user location that is associated with the user general search query. In turn, a local search query is generated using the general search query and a location phrase representing the user location. A set of set of general search results responsive to the general search query and a set of local search results responsive to the local search query are requested. A final set of search results responsive to the search query are selected. The final set of search results include at least one search result that is included in the set of local search results, and is not included in a pre-specified quantity of highest ranking search results from the set of general search results. Data that cause presentation of the final set of search results are provided.

Locally significant search queries

One embodiment of the present invention provides a system that automatically generates synonyms for words from documents. During operation, this system determines co-occurrence frequencies for pairs of words in the documents. The system also determines closeness scores for pairs of words in the documents, wherein a closeness score indicates whether a pair of words are located so close to each other that the words are likely to occur in the same sentence or phrase. Finally, the system determines whether pairs of words are synonyms based on the determined co-occurrence frequencies and the determined closeness scores. While making this determination, the system can additionally consider correlations between words in a title or an anchor of a document and words in the document as well as word-form scores for pairs of words in the documents.

Document-based synonym generation

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating suffix rewriting rules. A method includes obtaining a plurality of canonical suffix-rewriting rules each associated with one or more words, generating a suffix tree from the words, selecting a minimum colored subset of the nodes and leaves in the suffix tree, and generating a plurality of final suffix-rewriting rules from the nodes in the minimum colored subset. Another method includes receiving applicable and non-applicable words for a suffix-rewriting rule, generating a suffix tree from the applicable words and the non-applicable words, selecting a minimum colored subset of the nodes and leaves in the suffix tree, and generating a plurality of suffix-rewriting rules, wherein each rule corresponds to a node in the minimum colored subset with a valid status.

Growing community of inventors

Cupertino, CA, United States of America

Oleksandr Grushetskyy