# Patent

## Title
Query rewriting with entity detection

## Abstract

A system determines whether a received search query includes an entity name, determines whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewrites the received search query when it is determined that the received search query should be rewritten. The system further determines whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten. The system also generates the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The system performs a search based on one of the received search query and the rewritten search query to obtain search results, presents the search results, and presents the rewriting suggestion when it is determined that the rewriting suggestion should be provided.

## Background
RELATED APPLICATION
This application is a continuation of application Ser. No. 10/813,359, filed Mar. 31, 2004, the disclosure of which is incorporated herein by reference.


BACKGROUND OF THE INVENTION
1. Field of the Invention
Systems and methods consistent with the principles of the invention relate generally to information retrieval and, more particularly, to rewriting of search queries based on detection of the names of certain entities in the queries.
2. Description of Related Art
The World Wide Web (“web”) contains a vast amount of information. Search engines assist users in locating desired portions of this information by cataloging web documents. Typically, in response to a user's request, a search engine returns links to documents relevant to the request.
Search engines may base their determination of the user's interest on search terms (called a search query) provided by the user. The goal of a search engine is to identify links to relevant results based on the search query. Typically, the search engine accomplishes this by matching the terms in the search query to a corpus of pre-stored web documents. Web documents that contain the user's search terms are considered “hits” and are returned to the user.
Some search engines permit a user to restrict a search to a set of related documents, such as documents associated with the same web site, by including special characters or terms in the search query. Oftentimes, however, users forget to include these special characters/terms or do not know about them.
SUMMARY OF THE INVENTION
According to one aspect consistent with the principles of the invention, a method may include receiving a search query, determining whether the received search query includes an entity name, determining whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewriting the received search query when it is determined that the received search query should be rewritten. The method may also include performing a search based on one of the received search query and the rewritten search query to obtain search results and presenting the search results.
According to another aspect, a system may include a memory and a processor. The memory may store information relating to prior searches. The processor may receive a search query, determine whether the received search query includes an entity name, determine whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on the information in the memory, and generate the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The processor may also perform a search based on the received search query to obtain search results, present the search results, and provide the rewriting suggestion when the rewriting suggestion should be provided.
According to yet another aspect, a system may include a memory and a processor. The memory may store information relating to prior searches. The processor may identify an entity name, generate variations of the entity name, and evaluate each of the variations of the entity name based on information relating to prior searches to determine whether to include the variations of the entity name in a table. The processor may use the table to rewrite a search query prior to performing a search based on the search query.
According to a further aspect, a method may include obtaining an entity name, generating variations of the entity name, evaluating each of the variations of the entity name based on information relating to prior searches, and determining whether to include the variations of the entity name in a table. The method may also include receiving a search query that includes one of the variations of the entity name, determining whether the one variation of the entity name is included in the table, and suggesting a different search query for the received search query when the one variation of the entity name is included in the table.
According to another aspect, a method may include receiving a search query and determining whether the received search query includes an entity name. The method may also include determining whether to rewrite the received search query based on information relating to prior searches involving the entity name and rewriting the received search query when it is determined that the received search query should be rewritten. The method may further include determining whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten and generating the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The method may also include performing a search based on one of the received search query and the rewritten search query to obtain search results, presenting the search results, and presenting the rewriting suggestion when it is determined that the rewriting suggestion should be provided.



BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate an embodiment of the invention and, together with the description, explain the invention. In the drawings,
FIG. 1 is a diagram of an exemplary network in which systems and methods consistent with the principles of the invention may be implemented;
FIG. 2 is an exemplary diagram of a client and/or server of FIG. 1 according to an implementation consistent with the principles of the invention;
FIG. 3 is an exemplary functional block diagram of a portion of a server of FIG. 1 according to an implementation consistent with the principles of the invention;
FIG. 4 is an exemplary diagram of a query log according to an implementation consistent with the principles of the invention;
FIG. 5 is an exemplary diagram of a list of candidate strings according to an implementation consistent with the principles of the invention;
FIG. 6 is an exemplary diagram of the query rewrite table of FIG. 3 according to an implementation consistent with the principles of the invention;
FIG. 7 is an exemplary diagram of the suggest query rewrite table of FIG. 3 according to an implementation consistent with the principles of the invention;
FIG. 8 is a flowchart of exemplary processing for generating the query rewrite and suggest query rewrite tables according to an implementation consistent with the principles of the invention;
FIG. 9 is a flowchart of exemplary processing for selectively rewriting a query according to an implementation consistent with the principles of the invention;
FIGS. 10 and 11 are diagrams of an automatic query rewrite example in a store context according to an implementation consistent with the principles of the invention;
FIGS. 12-14 are diagrams of a query rewrite suggestion example in the store context according to an implementation consistent with the principles of the invention;
FIGS. 15 and 16 are diagrams of an automatic query rewrite example in a news context according to an implementation consistent with the principles of the invention; and
FIGS. 17-19 are diagrams of a query rewrite suggestion example in the news context according to an implementation consistent with the principles of the invention.



DETAILED DESCRIPTION
The following detailed description of the invention refers to the accompanying drawings. The same reference numbers in different drawings may identify the same or similar elements. Also, the following detailed description does not limit the invention.
Overview
Systems and methods consistent with the principles of the invention may rewrite search queries or generate suggestion links to rewritten search queries upon detection of the names of certain entities. An “entity,” as used herein, may refer to anything that can be tagged as being associated with certain documents. Examples of entities may include stores, such as online stores, news sources, product categories, brands or manufacturers, specific product models, condition (e.g., new, used, refurbished, etc.), authors, artists, people, places, and organizations.
Some entity names are unambiguous and uniquely identify particular entities. A large number of names, however, are somewhat ambiguous or generic, making it more difficult to identify the entities to which they are intended to correspond when included in users' search queries. Systems and methods consistent with the principles of the invention provide mechanisms for determining the entities to which entity names correspond and rewriting users' search queries or suggesting rewriting of the users' search queries when the names are determined to correspond to the entities. Accordingly, a user's search query may be restricted to a search of document(s) associated with the entity that the user intended in the search.
Exemplary Network Configuration
FIG. 1 is an exemplary diagram of a network 100 in which systems and methods consistent with the principles of the invention may be implemented. Network 100 may include multiple clients 110 connected to multiple servers 120-140 via a network 150. Network 150 may include a local area network (LAN), a wide area network (WAN), a telephone network, such as the Public Switched Telephone Network (PSTN), an intranet, the Internet, a memory device, another type of network, or a combination of networks. Two clients 110 and three servers 120-140 have been illustrated as connected to network 150 for simplicity. In practice, there may be more or fewer clients and servers. Also, in some instances, a client may perform the functions of a server and a server may perform the functions of a client.
Clients 110 may include client components. A component may be defined as a device, such as a wireless telephone, a personal computer, a personal digital assistant (PDA), a lap top, or another type of computation or communication device, a thread or process running on one of these devices, and/or an object executable by one of these device. Servers 120-140 may include server components that gather, process, search, and/or maintain documents in a manner consistent with the principles of the invention. Clients 110 and servers 120-140 may connect to network 150 via wired, wireless, and/or optical connections.
In an implementation consistent with the principles of the invention, server 120 may include a search engine 125 usable by clients 110. Server 120 may crawl a corpus of documents (e.g., web pages), index the documents, and store information associated with the documents in a repository of crawled documents. Servers 130 and 140 may store or maintain documents that may be crawled by server 120. While servers 120-140 are shown as separate components, it may be possible for one or more of servers 120-140 to perform one or more of the functions of another one or more of servers 120-140. For example, it may be possible that two or more of servers 120-140 are implemented as a single server. It may also be possible for a single one of servers 120-140 to be implemented as two or more separate (and possibly distributed) devices.
A “document,” as the term is used herein, is to be broadly interpreted to include any machine-readable and machine-storable work product. A document may include an e-mail, a web site, a file, a combination of files, one or more files with embedded links to other files, a news group posting, a blog, a web advertisement, etc. In the context of the Internet, a common document is a web page. Web pages often include textual information and may include embedded information (such as meta information, images, hyperlinks, etc.) and/or embedded instructions (such as Javascript, etc.).
Exemplary Client/Server Architecture
FIG. 2 is an exemplary diagram of a client or server component (hereinafter called “client/server component”), which may correspond to one or more of clients 110 and servers 120-140, according to an implementation consistent with the principles of the invention. The client/server component may include a bus 210, a processor 220, a main memory 230, a read only memory (ROM) 240, a storage device 250, an input device 260, an output device 270, and a communication interface 280. Bus 210 may include a set of conductors that permit communication among the elements of the client/server component.
Processor 220 may include a conventional processor or microprocessor that interprets and executes instructions. Main memory 230 may include a random access memory (RAM) or another type of dynamic storage device that stores information and instructions for execution by processor 220. ROM 240 may include a conventional ROM device or another type of static storage device that stores static information and instructions for use by processor 220. Storage device 250 may include a magnetic and/or optical recording medium and its corresponding drive.
Input device 260 may include a conventional mechanism that permits an operator to input information to the client/server component, such as a keyboard, a mouse, a pen, voice recognition and/or biometric mechanisms, etc. Output device 270 may include a conventional mechanism that outputs information to the operator, including a display, a printer, a speaker, etc. Communication interface 280 may include any transceiver-like mechanism that enables the client/server component to communicate with other devices and/or systems. For example, communication interface 280 may include mechanisms for communicating with another device or system via a network, such as network 150.
As will be described in detail below, the client/server component, consistent with the principles of the invention, perform certain searching-related operations. The client/server component may perform these operations in response to processor 220 executing software instructions contained in a computer-readable medium, such as memory 230. A computer-readable medium may be defined as a physical or logical memory device and/or carrier wave.
The software instructions may be read into memory 230 from another computer-readable medium, such as data storage device 250, or from another device via communication interface 280. The software instructions contained in memory 230 may cause processor 220 to perform processes that will be described later. Alternatively, hardwired circuitry may be used in place of or in combination with software instructions to implement processes consistent with the principles of the invention. Thus, implementations consistent with the principles of the invention are not limited to any specific combination of hardware circuitry and software.
Exemplary Server
FIG. 3 is an exemplary functional block diagram of a portion of server 120 according to an implementation consistent with the principles of the invention. According to one implementation, one or more of the functions described below may be performed by search engine 125. According to another implementation, one or more of these functions may be performed by a component external to server 120, such as a computer associated with server 120 or one of servers 130 and 140.
Server 120 may include an entity identification unit 310 and an entity processing unit 320 connected to a repository. The repository may include information associated with documents that were previously crawled and stored, for example, by server 120. The repository may also store information associated with the behavior of users with regard to previously-performed searches. For example, the repository may store a query log that describes the searches that users have done in the past, the results that they selected (e.g., by clicking), and possibly other user behavior relating to this searching.
FIG. 4 is an exemplary diagram of a query log 400 that may be stored in the repository according to an implementation consistent with the principles of the invention. Query log 400 may include a number of entries associated with previously-performed searches. An entry in query log 400 might include a query field 410, a selected entity identifier (ID) field 420, and possibly a user behavior information field 430. Query field 410 may store information relating to the term(s) included in a search query entered by a user. Selected entity ID field 420 may store information that may uniquely identify a particular entity, such as a domain (or hostname or Uniform Resource Locator (URL)), a category identifier, a product identifier, etc., associated with a document that was selected by the user from the results of a search performed using the search query. User behavior information field 430 may store information relating to the user's access of a document associated with the entity, such as information that may tend to show the user's interest in the entity. Because a user may select more than one result associated with a search query, the same search query may appear in multiple entries in query log 400 (e.g., query 2).
An example of an entry in query log 400 might include “harry potter barnes and noble” for query field 410 and the domain “barnesandnoble.com” for selected entity ID field 420. User behavior information field 430 might store information relating to the amount of time that the user spent accessing the barnesandnoble.com domain, whether a conversion occurred (i.e., whether a subsequent purchase on barnesandnoble.com occurred), whether a partial conversion occurred (i.e., whether the user got as far as adding an item to a shopping cart on the barnesandnoble.com domain), and/or other information that may tend to show the user's interest in the barnesandnoble.com domain.
Returning to FIG. 3, entity identification unit 310 may generate a list of entity names. Entity identification unit 310 may obtain an initial set of entity names for entities in a particular context (e.g., store names in the store context or names of news sources in the news source context). There are many ways that entity identification unit 310 can obtain the initial set of entity names in a particular context. For example, entity identification unit 310 may obtain entity names from online directories, lists, group postings, by analyzing a corpus of documents, etc.
For each of these names, entity identification unit 310 may also identify an entity identifier, such as a homepage domain name or a category identifier, associated with the name. For example, if the name was Barnes & Noble, then the associated entity identifier might be barnesandnoble.com. Entity identification unit 310 may identify the associated entity identifier from, for example, an analysis of the document information in the repository.
Entity identification unit 310 may then process the entity names to produce a list of variations of the names. Entity identification unit 310 may apply several transformations to the name and its entity identifier, such as: using the entity name as is; using the entity identifier as is; removing modifiers, such as “a,” “the,” “inc,” “inc.,” “co,” and “co.” from the entity name; replacing spaces with hyphens or underscores, or vice versa, within the entity name; removing apostrophes from the entity name; interchanging “and” and “&” in the entity name and/or the entity identifier; removing “and” and “&” from the entity name and/or the entity identifier; removing the initial “www.” and/or the trailing “.com” from the entity identifier; and/or treating periods in the entity identifier with no spaces on either side of them as spaces or deleting the periods. Other or different transformations may also be used.
Entity identification unit 310 may form these name variations into a list of candidate strings. FIG. 5 is an exemplary diagram of a list of candidate strings 500 according to an implementation consistent with the principles of the invention. Candidate string list 500 might include a number of entries (candidate strings) associated with the various versions of entity names and their associated entity identifiers. An entry in list 500 might include an entity name field 510 and an entity ID field 520. Entity name field 510 may include a variation of an entity name or its associated entity identifier. Entity ID field 520 may include information that uniquely identifies the entity corresponding to the entity name in entity name field 510, such as a domain, a URL, or a category identifier. An example of an entry for Barnes & Noble might include “barnes&noble” in entity name field 510 and “www.barnesandnoble.com” in entity ID field 520.
Returning to FIG. 3, entity processing unit 320 may process the list of candidate strings to generate two tables: query rewrite table 330 and suggest query rewrite table 340. As described in more detail below, query rewrite table 330 may indicate whether a search query should be automatically rewritten and suggest query rewrite table 340 may indicate whether rewriting of a query should be suggested.
Entity processing unit 320 may evaluate each candidate string (i.e., each version of an entity name and/or entity identifier) using query log 400 (FIG. 4). For example, entity processing unit 320 may examine query log 400 to identify all search queries that include a candidate string. Entity processing unit 320 may then examine the clicks associated with the identified queries. For example, entity processing unit 320 may analyze the entity identifiers associated with documents that were selected by the users (e.g., by clicking) in association with the identified queries.
Entity processing unit 320 may then analyze the distribution of the clicks. For example, entity processing unit 320 may determine whether the most-clicked entity identifier is the entity identifier that is supposed to correspond to this candidate string. If not, entity processing unit 320 may ignore this candidate string and select the next candidate string to evaluate.
If the most-clicked entity identifier is the entity identifier that is supposed to correspond to this candidate string, entity processing unit 320 may determine whether the total number of clicks to the correct, most-clicked entity identifier exceeds a small threshold (e.g., 5). Using this threshold ensures that this candidate string is common enough to justify rewriting it as opposed to a fluke that one user clicked on once. If the total number of clicks is below the threshold, entity processing unit 320 may ignore this candidate string and select the next candidate string to evaluate.
If the correct, most-clicked entity identifier has a total number of clicks above the threshold, entity processing unit 320 may analyze the distribution of how many clicks were associated with each entity identifier. If the distribution is “peaked” enough in a statistical sense (e.g., most of the clicks were to the correct entity identifier and far fewer clicks were to other entity identifiers), then entity processing unit 320 may add the candidate string to query rewrite table 330. If, on the other hand, the distribution is not peaked, but falls off much more slowly (e.g., other entity identifiers got nearly as many clicks), entity processing unit 320 may add the candidate string to suggest query rewrite table 340.
Many possible tests for peakedness could be used, including information theoretic measures like the entropy of the distribution (treated as a multinomial distribution). For efficiency and simplicity, a simple test could be used, such as if the number of clicks to the correct, most-clicked entity identifier exceeds the combined number of clicks to the next most frequently clicked N entity identifiers (e.g., N=4), then it is peaked enough to add to query rewrite table 330.
In addition to the total number of clicks, other data in query log 400 may be used to determine peakedness, such as information in user behavior information field 430. For example, information relating to the amount of time that the users spent accessing documents associated with the entities, whether full or partial conversions occurred, and/or other information that may tend to show the users' interest in the entities may be factors in determining peakedness. Any of this data that tends to indicate a desired result could be associated with a continuous weight. For example, multiple of these could be used together and assigned a weight (e.g., a conversion could be weighted more than a partial conversion, which may be weighted more than a click). Alternatively, clicks may be weighted variable amounts depending on the amount of time that the users spent accessing documents associated with the entities or certain categories relating to the amount of time that the users spent accessing the documents associated with the entities. Then, the peakedness may be based on the overall weighted measure.
An advantage of this technique is that it directly captures what the users meant when they provided the search query. For example, Amazon.com is a commonly used store, but it is also a river in South America. If a vast majority of users only ever mean the store when they include it in a search query, it will be added to query rewrite table 330. If a significant fraction of the users mean the river or something else, they will click on other results and the distribution will not be peaked enough to add Amazon to query rewrite table 330. In this case, Amazon may be added to suggest query rewrite table 340.
Query rewrite table 330 may store information relating to entities whose names are unambiguous (i.e., it is fairly certain that their names correspond to the entities and nothing else, such as “barnes and noble”). FIG. 6 is an exemplary diagram of query rewrite table 330 according to an implementation consistent with the principles of the invention. Query rewrite table 330 may include a number of entries associated with name strings, which if they appear in a user search query, may be automatically rewritten to a particular entity identifier (e.g., domain, URL, or category identifier). An entry in query rewrite table 330 might include a string field 610 and a rewrite to field 620. String field 610 may store candidate strings as described above. Rewrite to field 620 may store an entity identifier to which the candidate string may be rewritten. For example, if a user search query includes “barnes & noble,” then, based on query rewrite table 330, the query may be rewritten to “store:barnesandnoble” to indicate that the search is to be restricted to the entity identifier (domain) associated with the store Barnes & Noble. The “store:” may correspond to a restrict identifier in the store context that indicates that the search should be restricted to the store that follows it. Similar restrict identifiers may be used in other contexts.
Suggest query rewrite table 330 may store information relating to entities whose names are ambiguous (i.e., the names may contain generic words that can have other meaning, such as “coach” that has several uses other than referring to the store Coach.com). FIG. 7 is an exemplary diagram of suggest query rewrite table 340 according to an implementation consistent with the principles of the invention. Suggest query rewrite table 340 may include a number of entries associated with name strings for which, if they appear in a user search query, a link to a particular entity identifier (e.g., domain, URL, or category identifier) may be suggested. An entry in suggest query rewrite table 340 might include a string field 710 and a suggest rewrite to field 720. String field 710 may store candidate strings as described above. Suggest rewrite to field 720 may store an entity identifier to which a link may be suggested for the candidate string. For example, if a user search query includes “coach,” then, based on suggest query rewrite table 340, a link may be generated to rewrite the search query to “store:coach” to indicate that the search is to be restricted to the entity identifier (domain) associated with the store Coach.
In one implementation, query rewrite table 330 and suggest query rewrite table 340 may be human-evaluated after they are generated. This may help new entities get placed in the correct table. Further, tables 330 and 340 may be periodically updated. It may be desirable to weight the user behavior (e.g., clicks) differently when updating tables 330 and 340 since the users' behavior may be influenced by the automatic query rewriting, as described in detail below.
Exemplary Processing
FIG. 8 is a flowchart of exemplary processing for generating tables 330 and 340 (FIG. 3) according to an implementation consistent with the principles of the invention. Processing may begin with obtaining a list of entity names for a particular context (act 810). For each of the entity names, a corresponding entity identifier may also be identified (act 820). Several techniques exist for identifying entity names and/or entity identifiers for the list. For example, entity names and/or entity identifiers may be identified from online directories, lists, group postings, by analyzing a corpus of documents, etc.
A list of candidate strings may then be produced by transforming the entity names and/or entity identifiers (act 830). For example, the list of candidate strings for a particular entity name and its associated entity identifier may include the entity name as is, the entity identifier as is, the entity name without modifiers (e.g., “a,” “the,” “inc,” “inc.,” “co,” and “co.”), the entity name with spaces replaced with hyphens or underscores, and vice versa, the entity name without apostrophes, the entity name and/or entity identifier with “and” replaced with “&,” and vice versa, the entity name and/or entity identifier without “and” and “&,” the entity identifier without an initial “www.” and/or a trailing “.com,” and the entity identifier with a period with no spaces on either side of it replaced with spaces or deleted. Other or different transformations may also be used.
The candidate strings (i.e., each version of an entity name and/or entity identifier) may then be evaluated and used to form query rewrite table 330 and suggest query rewrite table 340 (acts 840 and 850). For example, query log 400 may be searched to identify all entries that include a particular candidate string in their query field 410. The identified entries may then be examined to determine which entity identifiers (e.g., domains, URLs, or category identifiers) were clicked for the corresponding search queries. The distribution of the clicks may be analyzed to, for example, determine whether the most-clicked entity identifier is the entity identifier that is supposed to correspond to this candidate string. If not, the candidate string can be ignored and the next candidate string selected for evaluation.
If the most-clicked entity identifier is the entity identifier that is supposed to correspond to this candidate string, then it may be determined whether the total number of clicks to the correct, most-clicked entity identifier exceeds a small threshold (e.g., 5). If the total number of clicks is below the threshold, then this candidate string can be ignored and the next candidate string selected for evaluation.
If the correct, most-clicked entity identifier has a total number of clicks above the threshold, then the distribution of how many clicks were associated with each entity identifier may be determined. If the distribution is “peaked” enough (e.g., most of the clicks were to the correct entity identifier and far fewer clicks were to other entity identifiers), then the candidate string may be added to query rewrite table 330. If the distribution is not peaked, but falls off much more slowly (e.g., other entity identifiers got nearly as many clicks), then the candidate string may be added to suggest query rewrite table 340. Some possible tests for determining peakedness have been described above.
FIG. 9 is a flowchart of exemplary processing for selectively rewriting a search query according to an implementation consistent with the principles of the invention. Processing may begin with receiving a search query from a user (act 910). The search query may contain one or more terms, which may or may not include the name of an entity.
The search query may be evaluated using query rewrite table 330 and/or suggest query rewrite table 340 (act 920). For example, the entries of query rewrite table 330 may be searched to determine whether a term (or a combination of terms) of the search query match a name string in string field 610 (FIG. 6). If a term (or terms) of the search query matches one of the name strings, then the query may be automatically rewritten (acts 930 and 940). For example, if the original query included “harry potter barnes & noble,” then the query may be rewritten as “harry potter store:barnesandnoble” to indicate that the user intends to find products or information relating to Harry Potter on the Barnes & Noble web site and is not simply searching for documents containing the terms “harry,” “potter,” “barnes,” “&,” and “noble.”
Optionally, a query link may be generated to offer the original query to the user, asking the user if the user intended a different search query than the automatically rewritten query (act 950). In this case, the query link may offer the original query of “harry potter barnes & noble” to the user.
If none of the terms of the search query match the name strings in query rewrite table 330, then the entries of suggest query rewrite table 340 may be searched to determine whether a term (or a combination of terms) of the query match a name string in string field 710 (FIG. 7). If a term (or terms) of the search query matches one of the name strings, then a query link may be generated (acts 960 and 970). The query link may offer a query rewrite to the user, asking the user if the user intended a different search query. For example, if the original query included “purse coach,” then the query link may offer a rewritten query of “purse store:coach” (in the store context) to indicate that the user intends to find products or information relating to purses on the Coach web site and is not simply searching for documents containing the terms “purse” and “coach.”
A search may then be performed based on the rewritten query, if applicable, or the original query, if applicable, to identify documents that are relevant to the rewritten/original query. For example, a repository of documents may be searched to identify documents that include one or more terms of the query. The resulting documents may form search results that may be presented to the user (act 980). In one implementation, the search results might take the form of links to the documents.
Automatic Query Rewrite Example
Store Context
FIGS. 10 and 11 are diagrams of an automatic query rewrite example in the store context according to an implementation consistent with the principles of the invention. As shown in FIG. 10, a user may enter a search query via a graphical user interface associated with a search engine, such as search engine 125 (FIG. 1). In this example, the user enters the search query “harry potter amazon.” Assume that the term “amazon” unambiguously identifies the store Amazon.com and, thus, is included as a name string in query rewrite table 330 (FIG. 3).
Search engine 125 may evaluate the terms of the search query based on query rewrite table 330 and suggest query rewrite table 340. In this case, search engine 125 finds that the term “amazon” appears in the query rewrite table 330. Search engine 125 then rewrites the search query to “harry potter store:amazon,” as shown in FIG. 11.
Search engine 125 performs a search of a repository for documents (e.g., products) associated with the store Amazon.com that are relevant to the rewritten query. There are many ways to determine document relevancy. For example, documents that contain one or more of the search terms of the rewritten query may be identified as relevant. Documents that include a greater number of the search terms may be identified as more relevant than documents that include a fewer number of the search terms.
Search engine 125 may then present the relevant documents to the user as search results. As shown in FIG. 11, each search result may include a link 1110 to a corresponding document, a price and store identifier 1120 associated with the document, and a brief description 1130 of the corresponding document. The search result may also include an image 1140 associated with the document, if available. Optionally, search engine 125 may also provide a link 1150 to the original query entered by the user. In this case, link 1150 may correspond to a query associated with a search for the search term “harry,” the search term “potter,” and/or the search term “amazon.”
Suggest Query Rewrite Example
Store Context
FIGS. 12-14 are diagrams of a query rewrite suggestion example in the store context according to an implementation consistent with the principles of the invention. As shown in FIG. 12, a user may enter a search query via a graphical user interface associated with a search engine, such as search engine 125 (FIG. 1). In this example, the user enters the search query “purse coach.” Assume that the term “coach” is a generic term and ambiguously identifies the store Coach.com. Assume further that “coach” is included as a name string in suggest query rewrite table 340 (FIG. 3).
Search engine 125 may evaluate the terms of the search query based on query rewrite table 330 and suggest query rewrite table 340. In this case, search engine 125 finds that none of the search terms appear in query rewrite table 330, but that the term “coach” appears in the suggest query rewrite table 340. Search engine 125 then rewrites the search query as “purse store:coach” and generates a link 1310 (“Search Merchant Coach for Purse”) to the rewritten query, as shown in FIG. 13.
Search engine 125 performs a search of a repository for documents (e.g., products) that are relevant to the original search query. As described above, there are many ways to determine document relevancy. For example, documents that contain one or more of the search terms of the original query may be identified as relevant. Documents that include a greater number of the search terms may be identified as more relevant than documents that include a fewer number of the search terms. In this case, search engine 125 searches for documents that include the search term “purse” and/or the search term “coach.”
Search engine 125 may then present the relevant documents to the user as search results. As shown in FIG. 13, each search result may include a link 1320 to a corresponding document, a price and store identifier 1330 associated with the document, and a brief description 1340 of the corresponding document. Because the search was not limited to the store Coach, the search results are associated with a number of different stores (e.g., Yahoo! Auctions and Vendio). The search result may also include a link 1350 to additional documents associated with the store identified by store identifier 1330. The search result may further include an image 1360 associated with the document, if available.
If the user selects link 1310 associated with the rewritten query, search engine 125 performs a search of the repository for documents (e.g., products) associated with the store Coach.com that are relevant to the rewritten query. Search engine 125 may then present the relevant documents to the user as search results. As shown in FIG. 14, each search result may include a link 1410 to a corresponding document, a price and store identifier 1420 associated with the document, and a brief description 1430 of the corresponding document. The search result may also include an image 1440 associated with the document, if available. Optionally, search engine 125 may also provide a link 1450 to the original query entered by the user. In this case, link 1450 may correspond to a query associated with a search for the search term “purse” and/or the search term “coach.”
Automatic Query Rewrite Example
News Context
FIGS. 15 and 16 are diagrams of an automatic query rewrite example in the news context according to an implementation consistent with the principles of the invention. As shown in FIG. 15, a user may enter a search query via a graphical user interface associated with a search engine, such as search engine 125 (FIG. 1). In this example, the user enters the search query “george bush washingtonpost.” Assume that the term “washingtonpost” unambiguously identifies the news source washingtonpost.com and, thus, is included as a name string in query rewrite table 330 (FIG. 3).
Search engine 125 may evaluate the terms of the search query based on query rewrite table 330 and suggest query rewrite table 340. In this case, search engine 125 finds that the term “washingtonpost” appears in the query rewrite table 330. Search engine 125 then rewrites the search query to “george bush source:washington_post,” as shown in FIG. 16.
Search engine 125 performs a search of a repository for documents (e.g., news documents) associated with the source washingtonpost.com that are relevant to the rewritten query. There are many ways to determine document relevancy. For example, documents that contain one or more of the search terms of the rewritten query may be identified as relevant. Documents that include a greater number of the search terms may be identified as more relevant than documents that include a fewer number of the search terms.
Search engine 125 may then present the relevant documents to the user as search results. As shown in FIG. 16, each search result may include a link 1610 to a corresponding document, a news source identifier along with an indicator of when the document was created 1620, and a brief description 1630 of the corresponding document. The search result may also include links 1640 to other documents related to a topic of the document associated with link 1610. Optionally, search engine 125 may also provide a link 1650 to the original query entered by the user. In this case, link 1650 may correspond to a query associated with a search for the search term “george,” the search term “bush,” and/or the search term “washingtonpost.”
Suggest Query Rewrite Example
News Context
FIGS. 17-19 are diagrams of a query rewrite suggestion example in the news context according to an implementation consistent with the principles of the invention. As shown in FIG. 17, a user may enter a search query via a graphical user interface associated with a search engine, such as search engine 125 (FIG. 1). In this example, the user enters the search query “mutual funds business week.” Assume that the terms “business week” are generic terms and ambiguously identify the news source businessweek.com. Assume further that “business week” is included as a name string in suggest query rewrite table 340 (FIG. 3).
Search engine 125 may evaluate the terms of the search query based on query rewrite table 330 and suggest query rewrite table 340. In this case, search engine 125 finds that none of the search terms appear in query rewrite table 330, but that the terms “business week” appear in the suggest query rewrite table 340. Search engine 125 then rewrites the search query as “mutual funds source:businessweek” and generates a link 1810 (“Search News Source Business Week for Mutual Funds”) to the rewritten query, as shown in FIG. 18.
Search engine 125 performs a search of a repository for documents (e.g., news documents) that are relevant to the original search query. As described above, there are many ways to determine document relevancy. For example, documents that contain one or more of the search terms of the rewritten query may be identified as relevant. Documents that include a greater number of the search terms may be identified as more relevant than documents that include a fewer number of the search terms. In this case, search engine 125 searches for documents that include the search terms “mutual,” “funds,” “business,” and/or “week.”
Search engine 125 may then present the relevant documents to the user as search results. As shown in FIG. 18, each search result may include a link 1820 to a corresponding document, a news source identifier along with an indicator of when the document was created 1830, and a brief description 1840 of the corresponding document. Because the search was not limited to the news source Business Week, the search results are associated with a number of different news sources (e.g., San Antonio Express, Baltimore Sun, and Arizona Business Gazette).
If the user selects link 1810 associated with the rewritten query, search engine 125 performs a search of the repository for documents (e.g., news documents) associated with the news source businessweek.com that are relevant to the rewritten query. Search engine 125 may then present the relevant documents to the user as search results. As shown in FIG. 19, each search result may include a link 1910 to a corresponding document, a news source identifier along with a date indicator 1920 corresponding to the date on which the document was created, and a brief description 1930 of the corresponding document. Optionally, search engine 125 may also provide a link 1950 to the original query entered by the user. In this case, link 1950 may correspond to a query associated with a search for the search term “mutual,” the search term “funds,” the search term “business,” and/or the search term “week.”
Conclusion
Systems and methods consistent with the principles of the invention may rewrite search queries upon detection of the names of certain entities.
The foregoing description of preferred embodiments of the present invention provides illustration and description, but is not intended to be exhaustive or to limit the invention to the precise form disclosed. Modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention.
For example, it has been described that query rewrite table 330 and suggest query rewrite table 340 are generated and then used to assist the automatic rewriting of a search query or the generation of a suggestion link to a rewritten search query. In another implementation, the analysis that goes into generating tables 330 and 340 may be performed on-the-fly upon receipt of a search query from a user. In this case, query log 400 (FIG. 4) may be searched using the term(s) of the search query. The distribution of clicks and peakedness may then be determined in a manner similar to that described above. Analysis similar to that described above for storing the search term(s) in query rewrite table 330 or suggest query rewrite table 340 may be used to determine whether to automatically rewrite the query or generate a suggestion link to a rewritten query.
Further, different techniques may be used to determine what and whether to rewrite terms of search queries. One technique would be to create tables 330 and 340 by hand. Another general class of techniques would be to do a statistical analysis of any potential name based on a large corpus of text (possibly the repository of documents being searched) and determine whether the name is a generic term based on the variability of the context in which it appears or based on the relative number of times it appears in a known appropriate field (e.g., the store name field) rather than in the generic text of other more general fields, such as descriptions or the text body of an article. Combinations of these are also possible, such as using an automated approach followed by human evaluation and minor editing of the generated table entries.
Also, while series of acts have been described with regard to FIGS. 8 and 9, the order of the acts may be modified in other implementations consistent with the principles of the invention. Further, non-dependent acts may be performed in parallel.
In one implementation, server 120 may perform most, if not all, of the acts described with regard to the processing of FIGS. 8 and/or 9. In another implementation consistent with the principles of the invention, one or more, or all, of the acts may be performed by another component, such as another server 130 and/or 140 or client 110.
It will also be apparent to one of ordinary skill in the art that aspects of the invention, as described above, may be implemented in many different forms of software, firmware, and hardware in the implementations illustrated in the figures. The actual software code or specialized control hardware used to implement aspects consistent with the principles of the invention is not limiting of the present invention. Thus, the operation and behavior of the aspects were described without reference to the specific software code—it being understood that one of ordinary skill in the art would be able to design software and control hardware to implement the aspects based on the description herein.
No element, act, or instruction used in the present application should be construed as critical or essential to the invention unless explicitly described as such. Also, as used herein, the article “a” is intended to include one or more items. Where only one item is intended, the term “one” or similar language is used. Further, the phrase “based on” is intended to mean “based, at least in part, on” unless explicitly stated otherwise.

## Claims

1. A method comprising:
identifying, using one or more server devices, a plurality of search queries, where each of the plurality of search queries includes a same variation of an entity name;
identifying, using the one or more server devices, a plurality of entity identifiers, where each of the plurality of entity identifiers is associated with a document that was selected, from a plurality of search result documents, based on a corresponding search query of the identified plurality of search queries;
determining, using the one or more server devices, that a total quantity of selections of the document associated with a particular entity identifier, of the plurality of entity identifiers, is greater than a total quantity of selections of each of the documents associated with other ones of the plurality of entity identifiers; and
storing, in response to the determining, the same variation of the entity name in a memory that is used to rewrite search queries.

2. The method of claim 1, further comprising:
determining whether one or more terms, included in a received search query, match a variation of a particular entity name in the memory; and
rewriting, using the memory, the received search query into a rewritten search query,
where rewriting the received search query includes:
rewriting, using the memory, the received search query into the rewritten search query by replacing the one or more terms with an entity identifier, from the memory, associated with the variation of the particular entity name, when the one or more terms match the variation of the particular entity name in the memory; and
performing a search based on the rewritten search query.

3. The method of claim 2, where rewriting the received search query includes:
rewriting the received search query to be restricted to a domain associated with the entity identifier that is associated with the variation of the particular entity name,
the method further comprising:
presenting a result of the performed search concurrently with a link to the received search query,
where selection of the link to the received search query causes a search to be performed using the received search query.

4. The method of claim 1, further comprising:
determining whether the total quantity of selections of the document associated with the particular entity identifier is greater than a threshold; and
determining whether the total quantity of selections of the document associated with the particular entity identifier is greater than the total quantity of selections of each of the documents associated with the other ones of the plurality of entity identifiers, when the total quantity of selections of the document associated with the particular entity identifier is greater than the threshold,
where the same variation of the entity name is stored in the memory, when the total quantity of selections of the document associated with the particular entity identifier is greater than the total quantity of selections of each of the documents associated with the other ones of the plurality of entity identifiers.

5. The method of claim 1, further comprising:
generating candidate strings corresponding to variations of at least one of the entity name or the particular entity identifier, the generated candidate strings including the same variation of the entity name; and
selecting the same variation of the entity name, from the generated candidate strings, to determine whether to store the same variation of the entity name in the memory.

6. The method of claim 5, where generating the candidate strings includes:
modifying the entity name or the particular entity identifier by at least one of: replacing “and” with “&,” replacing “&” with “and,” removing “and” and “&,” removing “www.,” removing “.com,” or treating periods with no spaces on either side of the periods as spaces or deleting the periods.

7. The method of claim 1, further comprising:
determining that the total quantity of selections of the document associated with the particular entity identifier is statistically peaked relative to the total quantity of selections of each of the documents associated with the other ones of the plurality of entity identifiers; and
storing the same variation of the entity name in the memory based on determining that the total quantity of selections of the document associated with the particular entity identifier is statistically peaked relative to the total quantity of selections of each of the documents associated with the other ones of the plurality of entity identifiers.

8. A system comprising:
one or more server devices to:
identify entity identifiers, where each of the entity identifiers is associated with a document that was selected, from a plurality of documents, based on a search query including a same variation of an entity name;
determine whether a total quantity of selections of the document associated with a particular entity identifier, of the entity identifiers, is greater than a total quantity of selections of each of the documents associated with other ones of the entity identifiers; and
store, based on a result of the determining, the same variation of the entity name in a first memory that is used for rewriting search queries or a second memory that is used for suggesting rewritten search queries,
where the same variation of the entity name is stored in the second memory when the total quantity of selections of the document associated with the particular entity identifier is greater than the total quantity of selections of each of the documents associated with the other ones of the entity identifiers, and
where the same variation of the entity name is stored in the first memory when the total quantity of selections of the document associated with the particular entity identifier is substantially greater than the total quantity of selections of each of the documents associated with the other ones of the entity identifiers.

9. The system of claim 8, where the one or more server devices are further to:
determine whether the total quantity of selections of the document associated with the particular entity identifier is greater than a threshold,
where the one or more server devices are to determine whether the total quantity of selections of the document associated with the particular entity identifier is greater than the total quantity of selections of each of the documents associated with the other ones of the entity identifiers, when the total quantity of selections of the document associated with the particular entity identifier is greater than the threshold.

10. The system of claim 8, where, when determining whether the total quantity of selections of the document associated with the particular entity identifier is greater than the total quantity of selections of each of the documents associated with the other ones of the entity identifiers, the one or more server devices are to:
determine whether the total quantity of selections of the document associated with the particular entity identifier is peaked with respect to the total quantity of selections of each of the documents associated with the ones of the entity identifiers, and
where the one or more server devices are further to:
store the same variation of the entity name in the first memory when the total quantity of selections of the document associated with the particular entity identifier is peaked; and
store the same variation of the entity name in the second memory, when the total quantity of selections of the document associated with the particular entity identifier is not peaked.

11. The system of claim 8, where the one or more server devices are further to:
evaluate a second variation of the entity name,
where, when evaluating the second variation, the one or more server devices are to:
identify second entity identifiers, each of the second identifiers being associated with a second document that was selected based on a particular search query including the second variation, and
determine whether a total quantity of selections of the second document associated with a particular second entity identifier, of the second entity identifiers, exceeds a threshold;

determine whether to store the second variation in one of the first memory or the second memory when the total quantity of selections of the second document associated with the particular second entity identifier exceeds the threshold; and
discard the second variation of the entity name, from further consideration, when the total quantity of selections of the second document associated with the particular second entity identifier does not exceed the threshold.

12. The system of claim 8, where the one or more server devices are to:
rewrite a search query using one of the first memory or the second memory,
where, when rewriting the search query, the one or more server devices are further to:
determine whether a term, included in the search query, matches a variation of a particular entity name stored in the first memory;
rewrite, using the first memory, the search query into a rewritten search query that includes an entity identifier, in the first memory, associated with the variation of the particular entity name when the term matches the variation of the particular entity name in the first memory; and
perform a search based on the rewritten search query instead of performing a search based on the search query.

13. The system of claim 8, where the one or more server devices are to:
rewrite a search query using one of the first memory or the second memory,
where, when rewriting the search query, the one or more server devices are further to:
determine whether one or more terms, of the search query, match a particular variation of a particular entity name stored in the second memory when the one or more terms do not match a plurality of entries in the first memory;
rewrite the search query into a rewritten search query that includes an entity identifier, in the second memory, associated with the particular variation of the particular entity name when the one or more terms match the particular variation;
perform a search based on the search query to generate search results; and
present a link to the rewritten search query along with the search results,
where selection of the link to the rewritten search query causes a search to be performed using the rewritten search query.

14. The system of claim 8, where the one or more server devices are further to:
generate variations of the entity name,
where, when generating the variations of the entity name, the one or more server devices are to:
modify the entity name by at least one of: removing modifiers, replacing spaces with hyphens or underscores, replacing hyphens or underscores with spaces, removing apostrophes, replacing “and” with “&,” replacing “&” with “and,” or removing “and” and “&.”

15. A computer-readable memory device including instructions, executable by a processor, to perform a method, the method comprising:
determining, for each of a plurality of entity identifiers, a total quantity of selections of a document associated the entity identifier, where the document was selected, from a plurality of documents, based on a search query including a same variation of an entity name;
determining whether a particular entity identifier, of the plurality of entity identifiers, is a most-selected entity identifier, of the plurality of entity identifiers, based on the determined total quantity of selections of each of the documents associated with the plurality of entity identifiers; and
storing, based on a result of determining whether the particular entity identifier is the most-selected entity identifier, the same variation of the entity name in a first memory that is used for suggesting rewritten search queries or a second memory that is used for rewriting search queries,
where the same variation of the entity name is stored in the first memory when the particular entity identifier is the most-selected entity identifier, and
where the same variation of the entity name is stored in the second memory, when the particular entity identifier is the most-selected entity identifier and based on determining whether the determined total quantity of selections of the document associated with the particular entity identifier is peaked with respect to the determined total quantity of selections of each of the documents associated with other ones of the plurality of entity identifiers.

16. The computer-readable memory device of claim 15, where determining whether the particular entity identifier is the most-selected entity identifier includes:
determining that the particular entity identifier is the most-selected entity identifier; and
determining whether the determined total quantity of selections of the document associated with the particular entity identifier is peaked with respect to the determined total quantity of selections of each of the documents associated with the other ones of the entity identifiers, after determining that the particular entity identifier is the most-selected entity identifier,
the method further comprising:
storing, based on determining whether the determined total quantity of selections of the document associated with the particular entity identifier is peaked, the same variation of the entity name in the first memory or the second memory.

17. The computer-readable memory device of claim 16, the method further comprising:
storing the same variation of the entity name in the first memory, when the particular entity identifier is the most-selected entity identifier and when the determined total quantity of selections of the document associated with the particular entity identifier is not peaked; and
storing the same variation of the entity name in the second memory when the particular entity identifier is the most-selected entity identifier and when the determined total quantity of selections of the document associated with the particular entity identifier is peaked.

18. The computer-readable memory device of claim 15, where storing the same variation of the entity name in the first memory or the second memory includes:
storing the same variation of the entity name in the first memory or the second memory further based on information that includes at least one of an amount of time a user spent accessing the plurality of documents or whether a conversion occurred based on accessing the plurality of documents.

19. The computer-readable memory device of claim 18, where storing the same variation of the entity name in the first memory or the second memory includes:
assigning a first weight to the determined total quantity of selections of the document associated with the particular entity identifier;
assigning a second weight, different than the first weight, to the at least one of the amount of time the user spent accessing the plurality of documents or whether the conversion occurred based on accessing the plurality of documents; and
storing the same variation of the entity name in the first memory or the second memory based on the first weight and the second weight.

20. The computer-readable memory device of claim 15, the method further comprising:
rewriting, using the first memory or the second memory, a search query into a rewritten search query that includes the particular entity identifier when a term, included in the search query, matches the same variation of the entity name;
presenting search results, obtained by performing a search based on the search query, and a link to the rewritten search query when the same variation of the entity name is stored in the first memory,
where selection of the link to the rewritten search query causes a search to be performed using the rewritten search query; and
presenting search results, obtained by performing a search based on the rewritten search query, and a link to the search query when the same variation of the entity name is stored in the second memory,
where selection of the link to the search query causes a search to be performed using the search query.