Patent US5153831A successfully refreshed from Google Patents.
US5153831A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Electronic text
Assignee: Fep Holding Co
•
Filing: 1990-05-29
•
Granted: 1992-10-06
•
Expires: 2010-05-29
Abstract
Abstract A text is encoded as a file in electronic memory for reading and search purposes. A lexicon-file is established in which each term that can searched is incorporated. A text-file is established in which non-search terms are directly encoded and in which all of the search terms (that is all of the terms in the lexicon-file) are designated by linking numbers. The linking numbers link through each incidence of the lexicon word as a text word and finally link back to the same lexicon word in the lexicon-file and then from the lexicon-file back to the text-file. In this fashion, by using numbers to link through each incidence of a lexicon word in the text-file and the encoded lexicon word in the lexicon-file, the word is encoded in memory only once and all other entries for the word are in terms of linking numbers.
Inventors
- 👤 Peter N. Yianilos
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 21:15
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90348; G06F40/00; G06F40/10; G06F40/12; G06F40/123; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 27
Claim 1
Independent Claim
230 words
The method of storing a text in an electronic memory to permit reading and searching of the text, wherein the text has a plurality of search words, comprising the steps of: establishing a lexicon-file in memory, all incidences of a search word in the text being represented by a single lexicon-word entry in said lexicon-file, establishing a text-file in memory, each term in the text being represented by an entry in said text-file, ordering those of said entries which represent incidences of search words in said text-file in a manner that corresponds to the ordering of said search words in the text, providing first and second types of linking signals to represent incidences of each search word in said text-file, providing said first type of linking signal for at least one location of each search word in said text-file, said first type of linking signal locating the corresponding word in said lexicon-file, providing said second type of linking signal for the rest of the locations of the same search word in said text-file, said second type of linking signal locating another occurrence in said text-file of an entry that stands for the same search word, and providing a third type of linking signal for each lexicon-word in said lexicon-file to indicate the location of an entry in said text-file standing for a text-word that is the same as said lexicon-word.
Claim 2
Independent Claim
230 words
The method of storing a text in an electronic memory to permit reading and searching of the text, wherein the text has a plurality of search words, comprising the steps of: establishing a lexicon-file in memory, all incidences of a search word in the text being represented by a single lexicon-word entry in said lexicon-file, establishing a text-file in memory, each term in the text being represented by an entry in said text-file, ordering those of said entries which represent incidences of search words in said text-file in a manner that corresponds to the ordering of said search words in the text, providing first and second types of linking signals to represent incidences of each search word in said text-file, providing said first type of linking signal for at least one location of each search word in said text-file, said first type of linking signal locating the corresponding word in said lexicon-file, providing said second type of linking signal for the rest of the locations of the same search word in said text-file, said second type of linking signal locating another occurrence in said text-file of an entry that stands for the same search word, and providing a third type of linking signal for each lexicon-word in said lexicon-file to indicate the location of an entry in said text-file standing for a text-word that is the same as said lexicon-word.
Claim 3
Dependent Claim
46 words
The method of claim 1 wherein: said first type of linking signal is the last entry in said text-file of the search word involved, and said third type of linking signal in said lexicon-file identifies the first entry in said text-file of the search word involved.
Claim 4
Dependent Claim
20 words
The method of claim 2 further comprising the step of: in said text-file, including entries representing non-search words and symbols.
Claim 5
Dependent Claim
54 words
The method of claim 2 further comprising: dividing said text-file into a master-file and a search-file, in said search-file, including only entries corresponding to search words in the text, in said master-file, including a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 6
Dependent Claim
36 words
The method of claim 4 further comprising the steps of: searching for incidences of two different search words, and identifying only incidences where said two words searched are within a predetermined text-file distance of one another.
Claim 7
Dependent Claim
36 words
The method of claim 2 further comprising the steps of: searching for incidences of two different search words, and identifying only incidences where said two words searched are within a predetermined text-file distance of one another.
Claim 8
Dependent Claim
20 words
The method of claim 1 further comprising the step of: in said text-file, including entries representing non-search words and symbols.
Claim 9
Dependent Claim
54 words
The method of claim 1 further comprising: dividing said text-file into a master-file and a search-file, in said search-file, including only entries corresponding to search words in the text, in said master-file, including a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 10
Dependent Claim
36 words
The method of claim 1 further comprising the steps of: searching for incidences of two different search words, and identifying only incidences where said two words searched are within a predetermined text-file distance of one another.
Claim 11
Dependent Claim
82 words
The method of claim 1 further comprising the steps of: providing a fourth type of linking signal in said text-file for multiple entries of the same search word, said fourth type of linking signal locating the corresponding word in the lexicon-file, in reading mode, said fourth type of linking signal providing link back to said lexicon-file prior to completion of linking through said text-file, each text-file entry having said fourth type of linking signal also having said second type of linking signal.
Claim 12
Dependent Claim
46 words
The method of claim 10 wherein: said first type of linking signal is the last entry in said text-file of the search word involved, and said third type of linking signal in said lexicon-file identifies the first entry in said text-file of the search word involved.
Claim 13
Dependent Claim
54 words
The method of claim 11 further comprising: dividing said text-file into a master-file and a search-file, in said search-file, including only entries corresponding to search words in the text, in said master-file, including a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 14
Dependent Claim
36 words
The method of claim 12 further comprising the steps of: searching for incidences of two different search words, and identifying only incidences where said two words searched are within a predetermined text-file distance of one another.
Claim 15
Dependent Claim
54 words
The method of claim 10 further comprising: dividing said text-file into a master-file and a search-file, in said search-file, including only entries corresponding to search words in the text, in said master-file, including a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 16
Dependent Claim
36 words
The method of claim 10 further comprising the steps of: searching for incidences of two different search words, and identifying only incidences where said two words searched are within a predetermined text-file distance of one another.
Claim 17
Dependent Claim
212 words
In an electronic text that permits reading and searching of the text wherein the text has a plurality of search words, the compression improvement comprising: a lexicon-file in memory in which there is a single lexicon-word entry representing all incidences of a search word in the text, a text file in memory in which each term in the text is represented by an entry, said entries for the incidence of each search word in said text-file being ordered in a manner corresponding to the ordering of the search words in the text, said entries for the incidence of each search word in said text-file including: (a) a first type of linking signal for at least one location of a search word in said text-file to indicate the location of the corresponding word in said lexicon file, and (b) a second type of linking signal for the rest of the locations of the same search word in said text-file to indicate the location in said text-file of another occurrence of an entry that stands for the same search word, a third type of linking signal for each lexicon-word in said lexicon-file to indicate the location of an entry in said text-file standing for a text word that is the same as said lexicon-word.
Claim 18
Dependent Claim
212 words
In an electronic text that permits reading and searching of the text wherein the text has a plurality of search words, the compression improvement comprising: a lexicon-file in memory in which there is a single lexicon-word entry representing all incidences of a search word in the text, a text file in memory in which each term in the text is represented by an entry, said entries for the incidence of each search word in said text-file being ordered in a manner corresponding to the ordering of the search words in the text, said entries for the incidence of each search word in said text-file including: (a) a first type of linking signal for at least one location of a search word in said text-file to indicate the location of the corresponding word in said lexicon file, and (b) a second type of linking signal for the rest of the locations of the same search word in said text-file to indicate the location in said text-file of another occurrence of an entry that stands for the same search word, a third type of linking signal for each lexicon-word in said lexicon-file to indicate the location of an entry in said text-file standing for a text word that is the same as said lexicon-word.
Claim 19
Dependent Claim
46 words
The improvement of claim 16 wherein: said first type of linking signal is the last entry in said text-file of the search word involved, and said third type of linking signal in said lexicon-file indicates the first entry in said text-file of the search word involved.
Claim 20
Dependent Claim
14 words
The improvement of claim 17 wherein said text-file entries includes non-search words and symbols.
Claim 21
Dependent Claim
52 words
The improvement of claim 17 further comprising: said text-file having a master-file and a search file, said search-file having only entries corresponding to search words in the text, said master-file having a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 22
Dependent Claim
14 words
The improvement of claim 16 wherein said text-file entries includes non-search words and symbols.
Claim 23
Dependent Claim
52 words
The improvement of claim 16 further comprising: said text-file having a master-file and a search file, said search-file having only entries corresponding to search words in the text, said master-file having a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 24
Dependent Claim
73 words
The improvement of claim 16 further comprising: a fourth type of linking signal in said text-file for multiple entries of the same search word to locate the corresponding word in the lexicon-file, in reading mode, said fourth type of linking signal provides link back to said lexicon-file prior to completion of linking through said text-file, each text-file entry having said fourth type of linking signal also having said second type of linking signal.
Claim 25
Dependent Claim
52 words
The improvement of claim 22 further comprising: said text-file having a master-file and a search file, said search-file having only entries corresponding to search words in the text, said master-file having a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
Claim 26
Dependent Claim
46 words
The improvement of claim 22 wherein: said first type of linking signal is the last entry in said text-file of the search word involved, and said third type of linking signal in said lexicon-file indicates the first entry in said text-file of the search word involved.
Claim 27
Dependent Claim
52 words
The improvement of claim 24 further comprising: said text-file having a master-file and a search file, said search-file having only entries corresponding to search words in the text, said master-file having a place holder entry for each search word in the text and a directly encoded entry for non-search words and symbols.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-10-06 | 1996-04-06 | 1996-10-06 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-10-06 | 2000-04-06 | 2000-10-06 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-10-06 | 2004-04-06 | 2004-10-06 | $7700.00 | Window Closed / Lapsed |