US5771378A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Associative text search and retrieval system having a table indicating word position in phrases
Assignee: Relx Inc
•
Filing: 1995-06-07
•
Granted: 1998-06-23
•
Expires: 2015-06-07
Abstract
Abstract An associative text search and retrieval system uses one or more front end processors to interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system. The system also includes storage for a plurality of text documents, and at least one processor, coupled to the front end processors and the document storage. The processor(s) search the text documents according to a search request provided by the user and provide to the front end processor a predetermined number of retrieved documents containing at least one term of the search request. The retrieved documents have higher ranks than documents not provided to the front end processor. The ranks are calculated using a formula that varies according to the square of the frequency in each of the text documents of each of the search terms.
Inventors
- 👤 John Holt
- 👤 David James Miller
- 👤 X. Allan Lu
- 👤 Ray Daley
- 👤 Minh Doan
- 👤 Richard G. Graham
- 👤 Catherine Leininger
- 👤 Darin W. McBeath
- 👤 Thomas Pease
- 👤 Stephen M. Sever
- 👤 Dale Waddell
- 👤 Franz Weckesser
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 04:52
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/253; G06F16/00; G06F16/30; G06F16/31; G06F16/316; G06F16/319; G06F16/33; G06F16/3331; G06F16/334; G06F16/3346; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99935; Y10S707/99936
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
139 words
A method of operating an associative text search and retrieval system, comprising the steps of: allowing a user to provide a plurality of search terms; using a table to detect phrases within the search terms provided by the user, the table containing entries which, for each word that can be part of a phrase, indicate a position that the word can occupy in any phrase; performing a search of text documents using the plurality of search terms provided by the user and the phrases, if any, detected by the table; calculating a score for each of the text documents containing at least one of the search terms; ranking the text documents based on their scores; and providing the user with a predetermined number of retrieved documents that are a subset of the text documents based on the documents' ranks.
Claim 2
Independent Claim
139 words
A method of operating an associative text search and retrieval system, comprising the steps of: allowing a user to provide a plurality of search terms; using a table to detect phrases within the search terms provided by the user, the table containing entries which, for each word that can be part of a phrase, indicate a position that the word can occupy in any phrase; performing a search of text documents using the plurality of search terms provided by the user and the phrases, if any, detected by the table; calculating a score for each of the text documents containing at least one of the search terms; ranking the text documents based on their scores; and providing the user with a predetermined number of retrieved documents that are a subset of the text documents based on the documents' ranks.
Claim 3
Dependent Claim
37 words
A method of operating an associative text search and retrieval system, according to claim 1, wherein the table has a bitmap associated with each entry, the bitmap indicating possible locations in a phrase of the associated entry.
Claim 4
Dependent Claim
85 words
A method of operating an associative text search and retrieval system, according to claim 2, wherein each bitmap entry is one byte long, a value of one at a particular bit position in the bitmap entry indicates that the word associated with the bitmap could appear in the corresponding position in a phrase, and a value of zero at a particular bit position in the bitmap entry indicates that the word associated with the bitmap could not appear in the corresponding position in a phrase.
Claim 5
Dependent Claim
41 words
A method or operating an associative text search and retrieval system, according to claim 2, wherein the table further has an ID for compressing the representations of each of the words by assigning a unique arbitrary number to represent each word.
Claim 6
Dependent Claim
49 words
A method of operating an associative text search and retrieval system, according to claim 4, wherein the table uses a tree having nodes corresponding to the ID's associated with words in a phrase, the nodes being connected according to the order that the words can appear in a phrase.
Claim 7
Dependent Claim
169 words
An associative text search and retrieval system, comprising: front end processing means for interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system; storage means for storing a plurality of text documents; processor means, coupled to the front end processing means and the storage means, for performing a search of the text documents using a plurality of search terms provided by the user, for calculating a score for each of the text documents containing at least one of the search terms, for ranking the text documents based on their scores, and for providing to the front end processing means a predetermined number of retrieved documents that are a subset of the text documents based on the documents' ranks; and a table used to detect phrases, the table containing entries which, for each word that can be part of a phrase, indicate a position that the word can occupy in any phrase.
Claim 8
Dependent Claim
169 words
An associative text search and retrieval system, comprising: front end processing means for interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system; storage means for storing a plurality of text documents; processor means, coupled to the front end processing means and the storage means, for performing a search of the text documents using a plurality of search terms provided by the user, for calculating a score for each of the text documents containing at least one of the search terms, for ranking the text documents based on their scores, and for providing to the front end processing means a predetermined number of retrieved documents that are a subset of the text documents based on the documents' ranks; and a table used to detect phrases, the table containing entries which, for each word that can be part of a phrase, indicate a position that the word can occupy in any phrase.
Claim 9
Dependent Claim
33 words
An associative text search and retrieval system, according to claim 6, wherein the table has a bitmap associated with each entry, the bitmap indicating possible locations in a phrase of the associated entry.
Claim 10
Dependent Claim
81 words
An associative text search and retrieval system, according to claim 7, wherein each bitmap entry is one byte long, a value of one at a particular bit position in the bitmap entry indicates that the word associated with the bitmap could appear in the corresponding position in a phrase, and a value of zero at a particular bit position in the bitmap entry indicates that the word associated with the bitmap could not appear in the corresponding position in a phrase.
Claim 11
Dependent Claim
37 words
An associative text search and retrieval system, according to claim 7, wherein the table further has an ID for compressing the representations of each of the words by assigning a unique arbitrary number to represent each word.
Claim 12
Dependent Claim
45 words
An associative text search and retrieval system, according to claim 9, wherein the table uses a tree having nodes corresponding to the ID's associated with words in a phrase, the nodes being connected according to the order that the words can appear in a phrase.
Claim 13
Dependent Claim
215 words
An associative text search and retrieval system, comprising: front end processing means for interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system; storage means for storing a plurality of text documents; processor means, coupled to the front end processing means and the storage means, for performing a search of the text documents using a plurality of search terms provided by the user, for calculating a score for each of the text documents containing at least one of the search terms, for ranking the text documents based on their scores, and for providing to the front end processing means a predetermined number of retrieved documents that are a subset of the text documents based on the documents' ranks, the retrieved documents having higher ranks than text documents not provided to the front end processing means, wherein the ranks are calculated using a formula that varies according to the square of the frequency in each of the text documents of each of the search terms; and a table used to detect phrases, the table containing entries which, for each word that can be part of a phrase, indicate a position that the word can occupy in any phrase.
Claim 14
Dependent Claim
215 words
An associative text search and retrieval system, comprising: front end processing means for interacting with a network having one or more user terminals connected thereto to allow a user to provide information to the system and receive information from the system; storage means for storing a plurality of text documents; processor means, coupled to the front end processing means and the storage means, for performing a search of the text documents using a plurality of search terms provided by the user, for calculating a score for each of the text documents containing at least one of the search terms, for ranking the text documents based on their scores, and for providing to the front end processing means a predetermined number of retrieved documents that are a subset of the text documents based on the documents' ranks, the retrieved documents having higher ranks than text documents not provided to the front end processing means, wherein the ranks are calculated using a formula that varies according to the square of the frequency in each of the text documents of each of the search terms; and a table used to detect phrases, the table containing entries which, for each word that can be part of a phrase, indicate a position that the word can occupy in any phrase.
Claim 15
Dependent Claim
33 words
An associative text search and retrieval system, according to claim 11, wherein the table has a bitmap associated with each entry, the bitmap indicating possible locations in a phrase of the associated entry.
Claim 16
Dependent Claim
81 words
An associative text search and retrieval system, according to claim 12, wherein each bitmap entry is one byte long, a value of one at a particular bit position in the bitmap entry indicates that the word associated with the bitmap could appear in the corresponding position in a phrase, and a value of zero at a particular bit position in the bitmap entry indicates that the word associated with the bitmap could not appear in the corresponding position in a phrase.
Claim 17
Dependent Claim
37 words
An associative text search and retrieval system, according to claim 12, wherein the table further has an ID for compressing the representations of each of the words by assigning a unique arbitrary number to represent each word.
Claim 18
Dependent Claim
45 words
An associative text search and retrieval system, according to claim 14, wherein the table uses a tree having nodes corresponding to the ID's associated with words in a phrase, the nodes being connected according to the order that the words can appear in a phrase.
References Cited (Backward Citations)
US4706212A
Cited
US4270182A
Cited
US4241402A
Cited
US4358824A
Cited
US4384329A
Cited
US4471459A
Cited
US4499553A
Cited
US4688195A
Cited
US4554631A
Cited
US4580218A
Cited
US5109509A
Cited
US4760528A
Cited
US4787035A
Cited
US4819156A
Cited
US5123103A
Cited
US4972349A
Cited
US4918588A
Cited
US4965763A
Cited
US4862408A
Cited
US4931935A
Cited
US4974191A
Cited
US4823306A
Cited
US4991087A
Cited
US4868750A
Cited
US5005127A
Cited
US4852003A
Cited
US4914590A
Cited
US4839853A
Cited
US5099425A
Cited
US4991094A
Cited
US5117349A
Cited
WO1992004681A1
Cited
US5321833A
Cited
US5323316A
Cited
US5265065A
Cited
US5544352A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-06-22 | 2001-12-22 | 2002-06-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-06-22 | 2005-12-22 | 2006-06-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-06-22 | 2009-12-22 | 2010-06-23 | $7700.00 | Window Closed / Lapsed |