Patent US4531201A successfully refreshed from Google Patents.
US4531201A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Text comparator
Assignee: Individual
•
Filing: 1982-01-25
•
Granted: 1985-07-23
•
Expires: 2002-01-25
Abstract
Abstract A text comparator which includes a decoded data memory (13) which contains a plurality of shift registers (SR2.0.-SR7F), one shift register for each one of the plurality of different symbols forming the data base stored within the mass storage device (11). The decoded signal is applied to the input lead of the shift register associated with that character, and a clock signal applied to each shift register of the decoded data memory. In this manner, the decoded data memory will provide signals on the output leads of each shift register indicative of the most recently received character, as well as each of the preceding K characters received from the mass storage device and decoded, where K is the number of bits contained in each shift register of the decoded data memory. The output lead of the shift registers are connected to the input leads of a variety of logical gates, such as AND gates and OR gates, in order to provide an output signal indicating when the desired textual phrase has been located on the disk. In addition, word counters, paragraph counters, and other devices are employed as desired to provide special text comparison functions.
Inventors
- 👤 James T. Skinner, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 10:42
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90344
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
200 words
A textual comparison system for locating desired character strings within textual material formed from a predefined sequence of characters comprising: means for sequentially receiving a plurality of stored textual characters; means for sequentially decoding said plurality of stored textual characters, thereby providing a sequence of decoded characters, said means for decoding said stored textual characters having a plurality of N output leads, where N is an integer equal to the number of unique textual characters which are to be decoded; each said N output leads being uniquely associated with one of said textual characters to be decoded, where the unique one of said N output leads associated with the specific character being decoded provides a signal when the textual character associated with said output lead has been decoded; means for storing said decoded characters and information as to the relative positioning of said decoded characters within said predefined sequence of characters; means for comparing said decoded characters and said information as to the relative positioning of said decoded characters with information defining said desired character strings, whereby the presence of desired character strings is determined; and means for providing a signal indicating that a desired character string has been located.
Claim 2
Dependent Claim
200 words
A textual comparison system for locating desired character strings within textual material formed from a predefined sequence of characters comprising: means for sequentially receiving a plurality of stored textual characters; means for sequentially decoding said plurality of stored textual characters, thereby providing a sequence of decoded characters, said means for decoding said stored textual characters having a plurality of N output leads, where N is an integer equal to the number of unique textual characters which are to be decoded; each said N output leads being uniquely associated with one of said textual characters to be decoded, where the unique one of said N output leads associated with the specific character being decoded provides a signal when the textual character associated with said output lead has been decoded; means for storing said decoded characters and information as to the relative positioning of said decoded characters within said predefined sequence of characters; means for comparing said decoded characters and said information as to the relative positioning of said decoded characters with information defining said desired character strings, whereby the presence of desired character strings is determined; and means for providing a signal indicating that a desired character string has been located.
Claim 3
Dependent Claim
70 words
Structure as in claim 1 wherein said means for storing said decoded characters and information as to the relative positioning of said decoded characters comprises a plurality of N shift registers, where N is an integer equal to the number of unique textual characters which are to be decoded, and where each of said plurality of N shift registers is associated with a unique one of said N textual characters.
Claim 4
Dependent Claim
39 words
Structures as in claim 2 wherein each of said N shift registers receives as an input data signal the signal on the output lead of said decoder means associated with the unique textual character associated with said shift register.
Claim 5
Dependent Claim
27 words
Structure as in claim 3 wherein each of said shift registers is clocked once upon the decoding of each character which is decoded by said decoder means.
Claim 6
Dependent Claim
54 words
Structure as in claim 4, wherein each of said shift registers is capable of storing a plurality of K bits, where K is a positive integer, and the data stored within said N shift registers indicates which textual characters have been decoded and the relative position of said textual characters within said textual material.
Claim 7
Dependent Claim
24 words
Structure as in claims 1, 2, 3, 4 or 5 wherein said textual characters are stored in ASCII and N is equal to 96.
Claim 8
Dependent Claim
95 words
Structure as in claim 5 wherein said means for comparing comprises a plurality of logical gates, each said logical gate corresponding to one character string to be decoded and wherein each said logical gate comprises: a plurality of K input leads corresponding to an equal plurality of K characters comprising a desired character string, said input lead corresponding to the kth character (where kth is an integer given by 1≦/≦K) from the end of said desired character string being connected to the kth least significant bit of said shift register associated with said kth character.
Claim 9
Dependent Claim
34 words
Structure as in claim 7 wherein said signal on each of said output leads of said decoder means is a logical zero only when said character associated with said output lead has been decoded.
Claim 10
Dependent Claim
33 words
Structure as in claim 8 wherein said logical gate comprises a NOR gate and the output signal from said NOR gate is a logical one when said desired character string has been located.
Claim 11
Dependent Claim
41 words
Structure as in claim 7 which further includes a plurality of J (where J is a positive integer less than or equal to K) latches for storing information as to whether an associated one of J character strings has been located.
Claim 12
Dependent Claim
38 words
Structure as in claim 10 which further includes a logical gate having input leads connected to the output leads of said latches, thereby providing an output signal indicating whether all of said J character strings have been located.
Claim 13
Dependent Claim
41 words
Structure as in claim 11 wherein said latches are reset at the beginning of each document, thereby causing said logical gate to provide an output signal indicating whether all of said J character strings have been located within the same document.
Claim 14
Dependent Claim
41 words
Structure as in claim 11 wherein said latches are reset at the beginning of each paragraph, thereby causing said logical gate to provide an output signal indicating whether all of said J character strings have been located within the same paragraph.
Claim 15
Dependent Claim
41 words
Structure as in claim 11 wherein said latches are reset at the beginning of each sentence, thereby causing said logical gate to provide an output signal indicating whether all of said J character strings have been located within the same sentence.
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) | 1988-07-22 | 1989-01-21 | 1989-07-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-07-22 | 1993-01-21 | 1993-07-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-07-22 | 1997-01-21 | 1997-07-23 | $7700.00 | Window Closed / Lapsed |