US4383307A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Spelling error detector apparatus and methods
Assignee: PMK Inc
•
Filing: 1981-05-04
•
Granted: 1983-05-10
•
Expires: 2001-05-04
Abstract
Abstract A spelling error detector apparatus employs a memory which stores alphabetical words as those existing in the English language in three major memory sections which constitutes a most frequently used word list (MFU), a master word list (MWL) and a personal word list (PWL). Each word is uniquely coded and stored as a 24 bit binary number. The system then retrieves words which are stored or entered into a processor memory and which words are indicative of a document to be printed. Each word emanating from the processor memory is converted into the same code as the stored words and then a search is made to determine whether the processor word compares with a word as stored. If a favorable comparison is had, it is assumed that the spelling of the processor word is correct. If an unfavorable comparison is had, it is assumed that the spelling is incorrect and the misspelled word is stored in a separate memory which can be accessed by the operator in order to make the necessary corrections. Similarly each word which is correctly spelled is also stored in a memory which has the capacity to store a plurality of the last words checked by the system. Based on the system considerations the coding of the words assures a very low collision rate and hence the system is extremely reliable in detecting misspelled words according to the disclosed techniques.
Inventors
- 👤 Stuart M. Gibson, III
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 05:16
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/232
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
308 words
A spelling error detector apparatus for use in detecting spelling errors in alphabetical words stored in a test memory associated with a word processor and indicative of a document to be printed from the stored words, comprising: a code storage memory having stored therein a plurality of digital codes, each code derived from a separate alphabetical word by first translating all letters in said word to a first digital code, then forming an all zero digital word of a given number of fixed bits, then adding the first code of the first letter to said digital word and then rotating said added word a given number of bits and then adding the first code of the second letter to said rotated word and continuing said rotation and addition for all letters in said word to form said code as stored in said memory, means for retrieving a word as stored in said text memory associated with said processor, means for converting said retrieved word into a code according to said code as stored in said code storage memory including means for translating each letter of said stored word into a first digital code; register means for forming an all zero digital word and adding means for adding said first digital code of said first letter of said retrieved word to said all zero word and means for rotating said added word said given number of bits and then adding said first digital code of said second letter to said rotated word and means for continuing said rotation and addition for all letters in said retrieved word to form a code indicative of said stored codes, means for comparing said code formed as indicative of said retrieved word with said stored codes with a favorable comparison manifesting a correct spelling and with an unfavorable comparison manifesting an incorrect spelling.
Claim 2
Dependent Claim
308 words
A spelling error detector apparatus for use in detecting spelling errors in alphabetical words stored in a test memory associated with a word processor and indicative of a document to be printed from the stored words, comprising: a code storage memory having stored therein a plurality of digital codes, each code derived from a separate alphabetical word by first translating all letters in said word to a first digital code, then forming an all zero digital word of a given number of fixed bits, then adding the first code of the first letter to said digital word and then rotating said added word a given number of bits and then adding the first code of the second letter to said rotated word and continuing said rotation and addition for all letters in said word to form said code as stored in said memory, means for retrieving a word as stored in said text memory associated with said processor, means for converting said retrieved word into a code according to said code as stored in said code storage memory including means for translating each letter of said stored word into a first digital code; register means for forming an all zero digital word and adding means for adding said first digital code of said first letter of said retrieved word to said all zero word and means for rotating said added word said given number of bits and then adding said first digital code of said second letter to said rotated word and means for continuing said rotation and addition for all letters in said retrieved word to form a code indicative of said stored codes, means for comparing said code formed as indicative of said retrieved word with said stored codes with a favorable comparison manifesting a correct spelling and with an unfavorable comparison manifesting an incorrect spelling.
Claim 3
Dependent Claim
73 words
The spelling error detector according to claim 1 wherein said storage code memory comprises, a first storage section for storing therein said codes indicative of most frequently used alphabetical words a second storage section for storing therein said codes indicative of a master word list indicative of a majority of other alphabetical words a third storage section for storing therein said codes indicative of a personal word list peculiar to a particular field.
Claim 4
Dependent Claim
30 words
The spelling error detector according to claim 1 further including; first misspelled storage means responsive to said unfavorable comparison for storing therein said new word code upon an unfavorable comparison.
Claim 5
Dependent Claim
31 words
The spelling error detector according to claim 1 further including, second properly spelled storage means responsive to said favorable comparison for storing therein said new word code upon a favorable comparison.
Claim 6
Dependent Claim
19 words
The spelling error detector according to claim 1 wherein each word is coded is represented by 24 binary bits.
Claim 7
Dependent Claim
22 words
The spelling error detector according to claim 2 wherein said first storage location is capable of storing between 5000 to 8000 words.
Claim 8
Dependent Claim
22 words
The spelling error detector according to claim 2 wherein said second storage location is capable of storing between 700,000 to 100,000 words.
Claim 9
Dependent Claim
22 words
The spelling error detector according to claim 2 wherein said third storage location is capable of storing between 1 to 10,000 words.
Claim 10
Dependent Claim
21 words
The spelling error detector according to claim 3 wherein said misspelled storage means is capable of storing at least 32 words.
Claim 11
Dependent Claim
23 words
The spelling error detector according to claim 4 wherein said second properly spelled storage means is capable of storing at least 64 words.
Claim 12
Dependent Claim
17 words
The spelling error detector according to claim 1 wherein said code storage memory is a disk memory.
Claim 13
Independent Claim
230 words
A method of coding alphabetical words of a given number of letters into digital words for storage in a memory for use in a misspelled word detector apparatus for providing a list of stored words each having a unique code for providing a low collision rate for said misspelled detector apparatus comprising the steps of: converting each letter of said word into a binary code having a given number of bits, forming an all zero binary word of a given bit length, adding the binary code of said first letter to said formed word to form a new word, rotating a given number of bits of said new word to form a rotated word, adding the binary code of the second letter to said rotated word to form a new word, rotating said new word, said given number of bits to form a new rotated word, adding the next binary code of the next letter to said new rotated word, and repeating said steps of adding and rotating until all the letters of said word are used, storing said final obtained word as a code uniquely indicative of said alphabetical word, and then comparing said stored final obtained word code with similarly coded and stored alphabetical words indicative of a document to be printed in a misspelled word detector apparatus to detect a possible misspelling of said indicative alphabetical words.
Claim 14
Independent Claim
230 words
A method of coding alphabetical words of a given number of letters into digital words for storage in a memory for use in a misspelled word detector apparatus for providing a list of stored words each having a unique code for providing a low collision rate for said misspelled detector apparatus comprising the steps of: converting each letter of said word into a binary code having a given number of bits, forming an all zero binary word of a given bit length, adding the binary code of said first letter to said formed word to form a new word, rotating a given number of bits of said new word to form a rotated word, adding the binary code of the second letter to said rotated word to form a new word, rotating said new word, said given number of bits to form a new rotated word, adding the next binary code of the next letter to said new rotated word, and repeating said steps of adding and rotating until all the letters of said word are used, storing said final obtained word as a code uniquely indicative of said alphabetical word, and then comparing said stored final obtained word code with similarly coded and stored alphabetical words indicative of a document to be printed in a misspelled word detector apparatus to detect a possible misspelling of said indicative alphabetical words.
Claim 15
Dependent Claim
14 words
The method according to claim 12 wherein said binary code is an ASCII code.
Claim 16
Dependent Claim
17 words
The method according to claim 12 wherein said word of a given bit length is 24 bits.
Claim 17
Dependent Claim
18 words
The method according to claim 14 wherein six letter words are rotated to the left using 7 bits.
Claim 18
Dependent Claim
19 words
The method according to claim 14 wherein all other letter words are rotated to the left using 5 bits.
Claim 19
Dependent Claim
19 words
The method according to claim 12 wherein the step of storing is storing said code on a floppy disk.
Claim 20
Dependent Claim
64 words
The method according to claim 17 wherein most common alphabetical length words as words having eight letters are stored on said disk as coded via said code in a concentric annular area located midway between the center and the outside edge of said disk with smaller length words stored in a concentric outer area and longer length words stored in a concentric inner area.
Claim 21
Dependent Claim
17 words
The method according to claim 18 wherein said most common alphabetical length words are 8 letter words.
Claim 22
Dependent Claim
71 words
The method of coding according to claim 12 further comprising the steps of: Placing an arbitrary alphabetical word into a storage location, converting each letter of said word into a binary code and thereafter performing the steps of claim 13 to form a new arbitrary coded word, comparing the code of said new word with the codes of all final stored words to find a match indicative of a correct spelling.
Claim 23
Dependent Claim
32 words
The method of coding according to claim 20 further including the step of: indicating when all final stored words do not compare with said arbitrary new word indicative of a misspelled word.
Claim 24
Dependent Claim
25 words
The method of coding according to claim 21 further including the step of storing said code indicative of said misspelled word in a separate memory.
References Cited (Backward Citations)
US3439341A
Cited
US3689915A
Cited
US3537076A
Cited
US3969700A
Cited
US3925761A
Cited
US4010445A
Cited
US3995254A
Cited
US4028677A
Cited
US4054948A
Cited
US4041467A
Cited
US4244031A
Cited
US4136395A
Cited
US4223393A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1986-05-09 | 1986-11-08 | 1987-05-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1990-05-09 | 1990-11-08 | 1991-05-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1994-05-09 | 1994-11-08 | 1995-05-10 | $7700.00 | Window Closed / Lapsed |