Systems and methods for interactive search query refinement

• US 20060010126A1
• Filed: 07/28/2005
• Published: 01/12/2006
• Est. Priority Date: 03/21/2003
• Status: Abandoned Application

• Current Assignee: Jollify Management Limited
• Original Assignee: Jollify Management Limited
• Inventors: Gourlay, Alastair, Thrall, John, Anick, Peter G.
• Application Number:
  US11/192,724
• Publication Number:
  US 20060010126A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/3325 Reformulation based on results of preceding query
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A received query is processed so as to generate an initial group of ranked documents corresponding to the received query. Each document in all or a portion of the documents in the initial group of ranked documents is associated with a respective set of ranked candidate terms such that each candidate term in the respective set of ranked candidate terms is embedded within the document. Each respective set of ranked candidate terms is identified at a time prior to the processing of the received query. In accordance with a selection function, a subset of the candidate terms in one or more of the respective sets of candidate terms is selected. In response to the received query, the initial group of ranked documents and the subset of candidate terms are presented.

Claims

1. A method of refining a received query, comprising:

processing said received query so as to generate an initial group of ranked documents corresponding to the received query, wherein

each document in all or a portion of the documents in said initial group of ranked documents is associated with a respective set of precomputed ranked candidate terms such that each candidate term in said respective set of ranked candidate terms is embedded within said document;

selecting, in accordance with a selection function, a subset of candidate terms that are in one or more of said respective sets of ranked candidate terms; and

presenting, in response to the received query, the initial group of ranked documents and said subset of candidate terms.

2. The method of claim 1 wherein, for all or a portion of the top-ranked documents in said initial group of ranked documents, the respective set of ranked candidate terms associated with said document is identified by:

(A) comparing a term in said document to a master list of candidate terms, wherein, when said term is in said master list of candidate terms, said term is added to a set of candidate terms;

(B) repeating said comparing a number of times; and

(C) ranking said candidate terms in said set of candidate terms, thereby forming said respective set of ranked candidate terms.

3. The method of claim 2 wherein, for all or a portion of the respective top-ranked documents in said initial group of ranked documents, a classification of the document is included with said respective set of ranked candidate terms associated with said document, wherein said classification comprises a first classification or a second classification.

4. The method of claim 2 wherein, for all or a portion of the top-ranked document in said initial group of ranked documents, a number of times a candidate term is identified by an instance of said comparing (A) is used by said ranking (C) to rank said candidate term in said set of ranked candidate terms.