US6088692A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Natural language method and system for searching for and ranking relevant documents from a computer database
Assignee: University of Central Florida Research Foundation Inc
•
Filing: 1999-04-05
•
Granted: 2000-07-11
•
Expires: 2019-04-05
Abstract
Abstract Natural Language 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 document 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-27 23:03
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: 9
Claim 1
Independent Claim
130 words
A natural language search method for retrieving relevant information from a computer database collection, comprising the steps of: (a) searching a database collection in a computer using a first search query of natural language to retrieve a first group of selected small pieces of information each being dissimilar from one another; (b) ranking each of the selected small pieces of information into a first relevant ranked list of the selected small pieces of information; (c) applying feedback information based on a subsequent determination of the relevancy of each of the small pieces of information in the first ranked list to create a second query different from the first query; and (d) repeating steps (a) to (b) to form a second relevant ranked list of the selected small pieces of information.
Claim 2
Dependent Claim
130 words
A natural language search method for retrieving relevant information from a computer database collection, comprising the steps of: (a) searching a database collection in a computer using a first search query of natural language to retrieve a first group of selected small pieces of information each being dissimilar from one another; (b) ranking each of the selected small pieces of information into a first relevant ranked list of the selected small pieces of information; (c) applying feedback information based on a subsequent determination of the relevancy of each of the small pieces of information in the first ranked list to create a second query different from the first query; and (d) repeating steps (a) to (b) to form a second relevant ranked list of the selected small pieces of information.
Claim 3
Dependent Claim
30 words
The natural language search method of claim 1, further including the step of: retrieving the first relevant ranked list and the second relevant ranked list without annotating, parsing or pruning.
Claim 4
Dependent Claim
50 words
The natural language search method of claim 1, further comprising the steps of: (e) repeating step (c) to create a third query different from the first query and the second query; and (f) repeating step (d) to form a third relevant ranked list of the selected small pieces of information.
Claim 5
Dependent Claim
52 words
The natural language search method of claim 3, further comprising the steps of: (g) repeating step (c) to create a fourth query different from the first query, the second query and the third query; (h) repeating step (e) to form a fourth relevant ranked list of the selected small pieces of information.
Claim 6
Dependent Claim
146 words
A natural language search method for retrieving relevant information from a computer database, comprising the steps of: (a) searching a computer database using a first natural language search query to retrieve a first group of selected portions of information each of the portions of information being dissimilar from one another; (b) ranking each of the selected portions of information in a first relevant ranked list of the selected portions of information; (c) applying feedback information based on a subsequent determination of the relevancy of each of the portions of information in the first ranked list to create a second search query different from the first search query; and (d) searching the computer database using the second search query to retrieve a second group of the selected portions of information and ranking the second group in a second relevant ranked list of the selected portions of information.
Claim 7
Dependent Claim
146 words
A natural language search method for retrieving relevant information from a computer database, comprising the steps of: (a) searching a computer database using a first natural language search query to retrieve a first group of selected portions of information each of the portions of information being dissimilar from one another; (b) ranking each of the selected portions of information in a first relevant ranked list of the selected portions of information; (c) applying feedback information based on a subsequent determination of the relevancy of each of the portions of information in the first ranked list to create a second search query different from the first search query; and (d) searching the computer database using the second search query to retrieve a second group of the selected portions of information and ranking the second group in a second relevant ranked list of the selected portions of information.
Claim 8
Dependent Claim
126 words
A natural language search method for retrieving relevant information from a computer data base, comprising the steps of: searching a computer database using a first natural language search query to retrieve a first group of selected portions of information, each of the portions of information being different from one another; ranking each of the selected portions of information in a first relevant ranked list of the selected portions of information; applying feedback information based on a subsequent determination of the relevancy of each of the portions of information in the first ranked list to create a second search query different from the first search query; and searching the computer database using the second search query to retrieve a second group of the selected portions of information.
Claim 9
Dependent Claim
126 words
A natural language search method for retrieving relevant information from a computer data base, comprising the steps of: searching a computer database using a first natural language search query to retrieve a first group of selected portions of information, each of the portions of information being different from one another; ranking each of the selected portions of information in a first relevant ranked list of the selected portions of information; applying feedback information based on a subsequent determination of the relevancy of each of the portions of information in the first ranked list to create a second search query different from the first search query; and searching the computer database using the second search query to retrieve a second group of the selected portions of information.
References Cited (Backward Citations)
US5319790A
Cited
US4849898A
Cited
US5056021A
Cited
US5297042A
Cited
US5297027A
Cited
US5301109A
Cited
US5299125A
Cited
US5309359A
Cited
US5404295A
Cited
US5321833A
Cited
US5305208A
Cited
US5351190A
Cited
US5325298A
Cited
US5321608A
Cited
US5293552A
Cited
US5323313A
Cited
US5251316A
Cited
US5325465A
Cited
US5537586A
Cited
US5321609A
Cited
US5418951A
Cited
US5598557A
Cited
US5331554A
Cited
US5331556A
Cited
US5576954A
Cited
US5694592A
Cited
US5724567A
Cited
US5642502A
Cited
US5893092A
Cited
US5717913A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-07-11 | 2004-01-10 | 2004-07-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-07-11 | 2008-01-10 | 2008-07-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-07-11 | 2012-01-10 | 2012-07-11 | $7700.00 | Window Closed / Lapsed |