Search query dominant location detection
First Claim
1. One or more computer-storage media with computer-executable instructions embodied thereon for performing a method for tokenizing a query, the method comprising:
- receiving a query;
wherein the query is one or more terms submitted to a search engine for returning a list of web pages related to the one or more terms;
receiving search results based on the query;
breaking the query into one or more tokens, wherein each token includes one or more terms from the query;
analyzing the search results to determine the frequency of the one or more tokens from the query in the search results, wherein the frequency is a number of times the token is found in the search results; and
generating a first assembly that includes a first token having the highest frequency, if one or more useful tokens remain after the first token is added to the first assembly, then adding a second token to the first assembly that is useful and has the highest remaining frequency among the one or more useful tokens, if one or more useful tokens remain after the first token and the second token are added to the first assembly, then adding a third token to the first assembly that is useful and has the highest remaining frequency among the one or more useful tokens, adding further tokens starting with a useful token having with the highest remaining frequency until the collection of tokens in the first assembly contains all terms in the query, wherein the useful token only contains query terms yet to be included in the first assembly; and
storing the first assembly in a data store.
2 Assignments
0 Petitions
Accused Products
Abstract
A system and method for location-specific searching. The invention correctly identifies explicit and implicit locations in a search query, and provides an appropriate dominant location. Top search results are obtained and analyzed to determine which terms in the query often appear in combination, and the query is tokenized based on the analysis. An explicit location indicating a location intent is most likely treated as an individual token, and the explicit location is treated as the dominant location of the query. In the case of a false positive, wherein the explicit location in a query is not the location intent, the explicit location is likely to be present with other terms that provide context. A token will likely include these terms together. The explicit location will therefore not be used to generate location-specific results in the case of a false positive.
43 Citations
9 Claims
-
1. One or more computer-storage media with computer-executable instructions embodied thereon for performing a method for tokenizing a query, the method comprising:
-
receiving a query;
wherein the query is one or more terms submitted to a search engine for returning a list of web pages related to the one or more terms;receiving search results based on the query; breaking the query into one or more tokens, wherein each token includes one or more terms from the query; analyzing the search results to determine the frequency of the one or more tokens from the query in the search results, wherein the frequency is a number of times the token is found in the search results; and generating a first assembly that includes a first token having the highest frequency, if one or more useful tokens remain after the first token is added to the first assembly, then adding a second token to the first assembly that is useful and has the highest remaining frequency among the one or more useful tokens, if one or more useful tokens remain after the first token and the second token are added to the first assembly, then adding a third token to the first assembly that is useful and has the highest remaining frequency among the one or more useful tokens, adding further tokens starting with a useful token having with the highest remaining frequency until the collection of tokens in the first assembly contains all terms in the query, wherein the useful token only contains query terms yet to be included in the first assembly; and storing the first assembly in a data store. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
Specification