Prioritization of search responses system and method
The present invention provides systems and methods for accurately parsing an information retrieval query and for generating accurate results based on the query. Queries are processed as a collection of atomic terminals of one or more search domains. The systems and methods typically implement a lexicon comprising a set of associations between known terminals and the phrase types to which they belong and a grammar comprising a set of deterministic syntax rules for translating a single phrase type of the domain into an ordered set of phrase types of similar expressiveness. Parsing includes separating a query into identifiable terminals of the domain language and comparing a collection of phrase types against the grammar to see if any subset of phrases types can be grouped together and translated into a higher level phrase type. The invention enables generation of a collection of potentially ambiguous semantic phrase types capable of assigning meaning to the uncovered syntactical structure of the query terminals.
1 . A method for processing queries, comprising
parsing a query to obtain corresponding semantic interpretations;
obtaining search results based on the semantic interpretations; and
disambiguating the semantic interpretations and the search results to provide an optimal result.
2 . The method of claim 1 wherein the step of parsing includes mapping known terminals of a search domain to corresponding phrase types.
3 . The method of claim 1 wherein the step of parsing includes mapping a first set of phrase types to a second set of phrase types.
4 . The method of claim 3 wherein mapping is based on an adaptive set of deterministic rules.
5 . The method of claim 1 and further comprising
identifying one or more terminals in the query; and
assigning a probability to each of the one or more terminals.
6 . The method of claim 1 , and further comprising separating one or more terminals in the query to obtain a tokenized query.
7 . The method of claim 6 and further comprising translating the one or more terminals using morphological analysis.
8 . The method of claim 6 and further comprising assigning a probability to each of the one or more terminals in the tokenized query.
9 . The method of claim 6 and further comprising storing one or more new terminals for processing future queries.
10 . The method of claim 1 , wherein disambiguating includes determining an optimum interpretation from the semantic interpretations.
11 . The method of claim 10 , wherein determining an optimum interpretation includes determining a most likely objective.
12 . The method of claim 1 , and further comprising the step of predicting the search results based on the query using an adaptive probability engine, wherein the probability engine maintains historical data including prior queries and corresponding predictions and results.
13 . The method of claim 12 , wherein the probability engine includes predictive logic that is adaptable in response to performance factors including information related to differences between predicted and observed results.
14 . The method of claim 2 wherein the mapping includes updating a lexicon based on system usage, wherein the lexicon is for mapping the terminals to the phrase types.
15 . The method of claim 3 wherein the mapping includes updating a grammar based on prior system usage, wherein the grammar maintains deterministic rules for mapping the first set of phrase types to the second set of phrase types.
16 . The method of claim 15 wherein the mapping further includes updating the grammar based on user feedback.
17 . A system for processing queries, comprising
a query parser for providing semantic interpretations of a query;
a service call manager for obtaining search results based on the semantic interpretations; and
a results analyzer for disambiguating the semantic interpretations and the search results to provide an optimal result.
18 . The system of claim 17 wherein the parser includes a lexicon for mapping known terminals of a search domain to corresponding phrase types.
19 . The system of claim 17 wherein the parser includes a grammar including deterministic rules for mapping a first set of phrase types to a second set of phrase types.
20 . The system of claim 17 and further comprising a terminal comparison component for identifying terminals in the query.
21 . The system of claim 20 , wherein the terminal comparison component includes a spell checker.
22 . The system of claim 21 , wherein the spell checker is sensitive to context provided in the query.
23 . The system of claim 21 , wherein identification of the terminals includes identifying terminals based on misspellings in prior queries.
24 . The system of claim 17 wherein the results analyzer provides an optimal result based on feedback from a user responsive to one or more ambiguous interpretations of the search results.