Search engine designed for handling long queries

• US 20030014405A1
• Filed: 07/09/2001
• Published: 01/16/2003
• Est. Priority Date: 07/09/2001
• Status: Abandoned Application

• Current Assignee: Cybertaven LLC
• Original Assignee: Cybertaven LLC
• Inventors: Shapiro, Jacob, Lichtman, Igal, Gendler, Efim
• Application Number:
  US09/901,539
• Publication Number:
  US 20030014405A1
• Time in Patent Office: Days
• US Class Current: 707/5
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9532 Query formulation

Abstract

The search engine provides a method and apparatus for receiving long queries, assigning a weight to each relevant word of the query, allowing a user to reformulate the query before and/or after search on the basis of the weight of each word computed by the algorithm. The search engine further provides methods for decomposing a long query into several short queries based on the importance of terms computed by the algorithm. These generated queries are submitted to existing search engine(s) producing several ranked outputs, and the obtained ranked outputs are merged into one final ranked output.

Claims

1. A search engine including:

means for receiving an input query;

means for generating a list of words chosen from the input query and assigning a corresponding weight to each word from said list;

means for generating a set of queries based on a said list of words;

means for performing a series of searches based on said set of queries;

means for merging ranked results of said series of searches into a merged ranked search result; and

means for displaying said merged search result to a user.

2. The search engine of claim 1 further including means for displaying said list of words to a user and allowing the user to alter said list prior to performing said series of searches.

3. The search engine of claim 1 further including, subsequent to said means for displaying said merged search result, means for re-displaying said list of words to a user and allowing the user to alter said list.

4. The search engine of claim 1 wherein said means for performing a series of searches receives input from a means for decomposing said list of words into a variable number of terms and a fixed number of queries in said set of queries.

5. The search engine of claim 4 wherein said means for decomposing takes the first term in said list of words and iteratively adds successive terms from said list of words thereby constructing said set of queries as conjunctive queries.

6. The search engine of claim 5 wherein said means for decomposing stops iteratively adding successive terms when results from said series of searches in response to said set of queries exceeds a predetermined number of documents.

7. The search engine of claim 5 wherein said means for decomposing discards a given successive term when no results are returned in by one of said series of searches in response to a query from said set of queries including said given successive term.

8. The search engine of claim 7 wherein a next successive term is used to generate a query in said set of queries after said given successive term is discarded.

9. The search engine of claim 1 wherein said means for performing a series of searches receives input from a means for decomposing said list of words into a fixed number of terms and a variable number of queries in said set of queries.

10. The search engine of claim 9 wherein said fixed number of terms is calculated as all possible subsets based on a number of terms from said list of words and a minimum number of terms in a query in said set of queries.

11. The search engine of claim 1 wherein said means for generating a list of words from the input query and assigning a corresponding weight to each word from the list includes means for removing less relevant words from said input query, means for calculating said corresponding weight by calculating a product of term frequency and inverse document frequency;

and means for ordering said list of words in accordance with said corresponding weight.

12. The search engine of claim 11 wherein said means for displaying said list of words displays said list of words in descending order of corresponding weight in accordance with said means for ordering said list of words.