Abstract: Systems and methods for processing search requests are provided, including automatic generation of taxonomies and query processing using those taxonomies.

Abstract: In a search processing system, a concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units based in part on patterns of units that appear together in queries. Units in the concept network that have some similar characteristic(s) are grouped into superunits. For each superunit, there is a corresponding signature that defines the similar characteristic of the group. A query is processed by identifying constituent units, determining the superunit membership of some or all of the constituent units, and using that information to formulate a response to the query.

Abstract: A set of concept networks is generated, with each concept network based on a different group of queries. From these concept networks, histogram vectors are defined for various units, where a unit's histogram vector reflects the frequency of occurrence of that unit in the different concept networks. Analysis of histogram vectors for different units across the same set of concept networks can enable detection of patterns of user behavior that can be used in responding to a subsequently received query.

Abstract: Methods and systems for reconstructing a full query based on a partial query are disclosed. Existing interfaces for search engines may be rigid and require users to submit full queries to perform searched. The methods and systems described herein may solve these problems by allowing a flexible way for users to submit a partial query and reconstruct a full query based on the partial query. A search may then be performed using the reconstructed query.

Abstract: A search query that includes a first spelling of a term is received. A second spelling of the term is generated. A first set of items that are associated with the first spelling of the term is accessed, and a second set of items that are associated with the second spelling of the term is accessed. A comparison is performed between the first set to the second set. A determination is made as to how to respond to the search query based, at least in part, on the comparison. The response may include a suggested search query that includes the second spelling of the term. The second spelling may be a suggested spelling correction or an alternative spelling. The response may include search results that are relevant to a search query that includes the first spelling of the term, the second spelling, or both the first and second spelling.

Abstract: A system and method for selecting a proxy keyword for an unknown document. An unknown document is received by a receiver. A plurality of candidate documents and corresponding keywords are determined for the unknown document. Using the keywords from the candidate documents, proxy keywords are determined for the unknown document based on a plurality of factors including a length of the keywords, a distance of the candidate documents from the unknown document, a similarity of the text between the unknown document and the respective candidate document, a rank of the keywords within each candidate document, and a frequency of the keyword within its respective candidate document.

Abstract: Multiple concept networks are generated from subsets of received queries. These concept networks can be used in various ways to enhance response to subsequent queries. In one embodiment, concept networks can be merged into a larger concept network that can be used to infer a user's likely intent given a query. In another embodiment, suggestions for related searches obtained using different concept networks can be merged or aggregated. Other users for concept networks in query processing, including assisted search, are also described.

Abstract: Search results are processed using search requests, including analyzing received queries in order to provide a more sophisticated understanding of the information being sought. A concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units. From these concept networks, queries can be automatically categorized into categories, or more generally, can be associated with one or more nodes of a taxonomy. The categorization can be used to alter the search results or the presentation of the results to the user. As an example of alterations of search results or presentation, the presentation might include a list of “suggestions” for related search query terms. As other examples, the corpus searched might vary depending on the category or the ordering or selection of the results to present to the user might vary depending on the category.

Abstract: Systems and methods for processing search requests are provided, including automatic generation of taxonomies and query processing using those taxonomies.

Abstract: Systems and method for enhancing search functionality provided to a user. In certain aspects, a query processing engine automatically decomposes queries into constituent units that are related to concepts in which a user may be interested. The query processing engine decomposes queries into one or more constituent units per query using statistical methods. In certain aspects, no real world knowledge is used in determining units. In other aspects, aspects of world and content knowledge are introduced to enhance and optimize performance, for example, manually using a team of one or more information engineers.

Abstract: In a search processing system, a concept network is generated from a set of queries by parsing the queries into units and defining various relationships between the units based in part on patterns of units that appear together in queries. Units in the concept network that have some similar characteristic(s) are grouped into superunits. For each superunit, there is a corresponding signature that defines the similar characteristic of the group. A query is processed by identifying constituent units, determining the superunit membership of some or all of the constituent units, and using that information to formulate a response to the query.

Abstract: Systems and method for enhancing search functionality provided to a user. In certain aspects, a query processing engine automatically decomposes queries into constituent units that are related to concepts in which a user may be interested. The query processing engine decomposes queries into one or more constituent units per query using statistical methods. In certain aspects, no real world knowledge is used in determining units. In other aspects, aspects of world and content knowledge are introduced to enhance and optimize performance, for example, manually using a team of one or more information engineers.