US2006010126A1PendingUtilityA1

Systems and methods for interactive search query refinement

Individually held — no corporate assignee on recordPriority: Mar 21, 2003Filed: Jul 28, 2005Published: Jan 12, 2006
Est. expiryMar 21, 2023(expired)· nominal 20-yr term from priority
Y10S707/99943G06F 16/3325Y10S707/99935G06F 7/00
34
PatentIndex Score
0
Cited by
0
References
0
Claims

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

exact text as granted — not AI-modified
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.

Join the waitlist — get patent alerts

Track US2006010126A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.