Patent US5893092A successfully refreshed from Google Patents.
US5893092A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Relevancy ranking using statistical ranking, semantics, relevancy feedback and small pieces of text
Assignee: University of Central Florida Research Foundation Inc
•
Filing: 1997-06-23
•
Granted: 1999-04-06
•
Expires: 2017-06-23
Abstract
Abstract Search system and method for retrieving relevant documents from a text data base collection comprised of patents, medical and legal documents, journals, news stories and the like. Each small piece of text within the documents such as a sentence, phrase and semantic unit in the data base is treated as a document. Natural language queries are used to search for relevant documents from the data base. A first search query creates a selected group of documents. Each word in both the search query and in the documents are given weighted values. Combining the weighted values creates similarity values for each document which are then ranked according to their relevant importance to the search query. A user reading and passing through this ranked list checks off which documents are relevant or not. Then the system automatically causes the original search query to be updated into a second search query which can include the same words, less words or different words than the first search query. Words in the second search query can have the same or different weights compared to the first search query. The system automatically searches the text data base and creates a second group of documents, which as a minimum does not include at least one of the documents found in the first group. The second group can also be comprised of additional documents not found in the first group. The ranking of documents in the second group is different than the first ranking such that the more relevant documents are found closer to the top of the list.
Inventors
- 👤 James R. Driscoll
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 12:39
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/30; G06F16/33; G06F16/3331; G06F16/334; G06F16/3346; G06F16/332; G06F16/3322; G06F16/3329; G06F16/3332; G06F16/3334; G06F16/3344; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935; Y10S707/99936; Y10S707/99939
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
168 words
A method for retrieving relevant text data from a text database collection in a computer without annotating, parsing or pruning the text database collection, comprising the steps of: (a) searching a text database collection in a computer using a first search query of natural language to retrieve a first group of selected small pieces of text, where each of the selected small pieces of text corresponds to a document; (b) ranking each of the selected small pieces of text into a first ranked list of relevant documents; (c) applying feedback information based on a manual determination of the relevancy of each of the selected small pieces of text in the first ranked list to automatically create a second search query, the second search query being different than the first search query; (d) repeating steps (a) to (b) to form a second ranked list, wherein the second ranked list includes a second group of selected small pieces of text, and the second group is different than the first group.
Claim 2
Independent Claim
168 words
A method for retrieving relevant text data from a text database collection in a computer without annotating, parsing or pruning the text database collection, comprising the steps of: (a) searching a text database collection in a computer using a first search query of natural language to retrieve a first group of selected small pieces of text, where each of the selected small pieces of text corresponds to a document; (b) ranking each of the selected small pieces of text into a first ranked list of relevant documents; (c) applying feedback information based on a manual determination of the relevancy of each of the selected small pieces of text in the first ranked list to automatically create a second search query, the second search query being different than the first search query; (d) repeating steps (a) to (b) to form a second ranked list, wherein the second ranked list includes a second group of selected small pieces of text, and the second group is different than the first group.
Claim 3
Dependent Claim
31 words
The method for retrieving relevant text data of claim 1, wherein each of the small pieces of text includes at least one of: a sentence, a phrase, and a semantic unit.
Claim 4
Dependent Claim
26 words
The method for retrieving relevant text data of claim 1, wherein the second search query includes: at least one less word from the first search query.
Claim 5
Dependent Claim
26 words
The method for retrieving relevant text data of claim 1, wherein the second search query includes: at least one additional word to the first search query.
Claim 6
Dependent Claim
28 words
The method for retrieving relevant text data of claim 1, wherein the second group includes: at least one less document that had been listed in the first group.
Claim 7
Dependent Claim
28 words
The method for retrieving relevant text data of claim 1, wherein the second group includes: at least one additional document that was not found in the first group.
Claim 8
Dependent Claim
27 words
The method for retrieving relevant text data of claim 1, wherein the second ranked list includes: a different ranked order of documents than the first ranked list.
Claim 9
Independent Claim
205 words
A method for retrieving relevant text data from a text database collection in a computer without annotating, parsing or pruning, comprising the steps of: (a) searching a text database collection in a computer using a first search query to retrieve a first group of selected small pieces of text, where each of the selected small pieces of text corresponds to a document; (b) semantically weighting the selected small pieces of text to form document weighted values for each of the selected small pieces of text in the first group; (c) semantically weighting the first search query to form query weighted values; (d) combining the query weighted values and the document weighted values to form similarity values for each of the selected small pieces of text; (e) ranking the similarity values for each of the selected small pieces of text to form a first ranked list; (f) automatically updating the first search query into a second search query based on feedback information on whether documents in the first ranked list are relevant, (g) repeating steps (a) to (e) to form a second ranked list, wherein the second ranked list includes a second group of selected small pieces of text which is different than the first group.
Claim 10
Independent Claim
205 words
A method for retrieving relevant text data from a text database collection in a computer without annotating, parsing or pruning, comprising the steps of: (a) searching a text database collection in a computer using a first search query to retrieve a first group of selected small pieces of text, where each of the selected small pieces of text corresponds to a document; (b) semantically weighting the selected small pieces of text to form document weighted values for each of the selected small pieces of text in the first group; (c) semantically weighting the first search query to form query weighted values; (d) combining the query weighted values and the document weighted values to form similarity values for each of the selected small pieces of text; (e) ranking the similarity values for each of the selected small pieces of text to form a first ranked list; (f) automatically updating the first search query into a second search query based on feedback information on whether documents in the first ranked list are relevant, (g) repeating steps (a) to (e) to form a second ranked list, wherein the second ranked list includes a second group of selected small pieces of text which is different than the first group.
Claim 11
Dependent Claim
31 words
The method for retrieving relevant text data of claim 8, wherein each of the small pieces of text includes at least one of: a sentence, a phrase, and a semantic unit.
Claim 12
Independent Claim
139 words
A method for retrieving relevant text from a text database collection in a computer without annotating, parsing or pruning the text database collection, comprising the steps of: (a) searching a text database collection in a computer using a first search query to retrieve a first group of selected text; (b) ranking each of the selected text to form a first ranked list; (c) determining relevancy of each of the selected text with a manual pass-through of the first ranked list; and (d) automatically updating the first search query based on the relevancy determination of the manual pass-through into a second search query, the second search query being different than the first search query; and (e) searching the text database collection using the second search query to retrieve a second group of selected text being different than the first group.
Claim 13
Independent Claim
139 words
A method for retrieving relevant text from a text database collection in a computer without annotating, parsing or pruning the text database collection, comprising the steps of: (a) searching a text database collection in a computer using a first search query to retrieve a first group of selected text; (b) ranking each of the selected text to form a first ranked list; (c) determining relevancy of each of the selected text with a manual pass-through of the first ranked list; and (d) automatically updating the first search query based on the relevancy determination of the manual pass-through into a second search query, the second search query being different than the first search query; and (e) searching the text database collection using the second search query to retrieve a second group of selected text being different than the first group.
References Cited (Backward Citations)
US5319790A
Cited
US5297027A
Cited
US5301109A
Cited
US5299125A
Cited
US5309359A
Cited
US5404295A
Cited
US5321833A
Cited
US5305208A
Cited
US5351190A
Cited
US5325298A
Cited
US5321608A
Cited
US5297039A
Cited
US5293552A
Cited
US5323313A
Cited
US5251316A
Cited
US5325465A
Cited
US5537586A
Cited
US5321609A
Cited
US5418951A
Cited
US5598557A
Cited
US5331554A
Cited
US5544352A
Cited
US5331556A
Cited
US5694592A
Cited
US5724567A
Cited
US5642502A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-04-05 | 2002-10-05 | 2003-04-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-04-05 | 2006-10-05 | 2007-04-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-04-05 | 2010-10-05 | 2011-04-06 | $7700.00 | Window Closed / Lapsed |