EP0097818A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Spelling verification method and typewriter embodying said method
Assignee: JP Morgan Delaware
•
Filing: 1983-05-25
•
Granted: —
•
Expires: 2003-05-25
Abstract
Abstract Spelling errors of words typed on the keyboard (14) of a typewriter are detected through the comparison of the keyed word with previously stored words of known spelling. The operator is immediately alerted. When the operator is notified through an alerting device (18) of a "no match", the operator may then modify the spelling of the word if it is incorrect or accept the word if it is correct but not found in the dictionary storage. Words previously not located in the dictionary storage are then stored in a memory for subsequent use and the word most recently verified as correct and stored in the memory may be maintained at the top of a stack while the most infrequently used words will eventually be removed from the memory as the memory fills and overflows.
Inventors
- 👤 Roderick Stacey Heard
- 👤 Joseph Charles Tremoulet
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-26 19:41
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/232
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
183 words
A spelling verification method characterized in that it comprises the steps of : providing a string of data signals representing characters forming at least a word; providing a stored library (28) of selected groups of data codes representing a first group of words; providing a memory (30) for receiving and storing groups of data codes representing a second group of words; comparing said string of data signals with said groups of data codes representing said first group of words to determine the existence of a match with any of said first group of words; comparing said string of data signals with any groups of data codes stored in said memory to determine the existence of a match with any of said groups of data codes representing said second group of words; operating an alarm (18) if no match exists in said first or second group of words to alert an operator to a condition of no match; storing in said memory (30) said string of data signals representing the last complete word upon further providing of data signals representing characters forming a word.
Claim 2
Dependent Claim
183 words
A spelling verification method characterized in that it comprises the steps of : providing a string of data signals representing characters forming at least a word; providing a stored library (28) of selected groups of data codes representing a first group of words; providing a memory (30) for receiving and storing groups of data codes representing a second group of words; comparing said string of data signals with said groups of data codes representing said first group of words to determine the existence of a match with any of said first group of words; comparing said string of data signals with any groups of data codes stored in said memory to determine the existence of a match with any of said groups of data codes representing said second group of words; operating an alarm (18) if no match exists in said first or second group of words to alert an operator to a condition of no match; storing in said memory (30) said string of data signals representing the last complete word upon further providing of data signals representing characters forming a word.
Claim 3
Dependent Claim
39 words
The spelling verification method of Claim 1 wherein said step of storing said string of data signals in said memory (30) is accomplished upon the providing of a second data signal which ends said word following said complete word.
Claim 4
Dependent Claim
39 words
The spelling check method of Claim 1 further comprising the step of: deleting a group of data codes representing one of the words of said second group from said memory (30) to provide room for said last complete word.
Claim 5
Dependent Claim
21 words
The spelling check method of Claim 1 wherein said step of operating an alarm (18) comprises illuminating an optical attention-getting device.
Claim 6
Dependent Claim
129 words
A typewriter (10) comprising an interactive spelling verification feature, said typewriter being of the type comprising a keyboard (14), a printer means (20) for displaying visually discernable characters, means (12) for controlling said keyboard operations, means (15) for controlling said printer operations, said means (12) for controlling said keyboard operations and said means (15) for controlling said printer operations being interconnected, said typewriter being characterized in that it further includes means (16, 18) for verifying the spelling of words represented by data codes processed by said means (12) for controlling said keyboard (14), through comparison with a predetermined data bank (28, 30) of data codes, and on an interactive basis alerting the operator as soon as said verification process has been completed of the possibility of an erroneous spelling.
Claim 7
Dependent Claim
129 words
A typewriter (10) comprising an interactive spelling verification feature, said typewriter being of the type comprising a keyboard (14), a printer means (20) for displaying visually discernable characters, means (12) for controlling said keyboard operations, means (15) for controlling said printer operations, said means (12) for controlling said keyboard operations and said means (15) for controlling said printer operations being interconnected, said typewriter being characterized in that it further includes means (16, 18) for verifying the spelling of words represented by data codes processed by said means (12) for controlling said keyboard (14), through comparison with a predetermined data bank (28, 30) of data codes, and on an interactive basis alerting the operator as soon as said verification process has been completed of the possibility of an erroneous spelling.
Claim 8
Dependent Claim
146 words
The typewriter of claims 5 wherein said means (16) for verifying the spelling of words represented by data codes processed by said means (12) for controlling said keyboard (14) include : means (24) for accumulating codes representing the words typed on said keyboard (14), means for comparing said codes with codes previously selected and stored for comparison in said data bank, (28, 30), means for determining the existence of stored codes identical to the codes resulting from the typing of a word on the keyboard (14), and if identity does not exist, the immediate alerting of the operator as to such condition, means (24, 26) to store said codes representing said word until such time as at least one additional complete word has been typed on said keyboard (14), memory means (30) for storing said word upon the typing of at least one complete additional word.
Claim 9
Dependent Claim
28 words
The typewriter of Claim 6 wherein said means (24, 26) to store said codes comprises a storage for plural words until a line ending command has been typed.
Claim 10
Dependent Claim
23 words
The typewriter of Claim 6 comprising indicator means (18) for indicating the occurrence of a non-match condition within a particular line of typing.
Claim 11
Dependent Claim
21 words
The typewriter of Claim 6 comprising means (15) for storing in said memory means (30) said words in a predetermined sequence.
Claim 12
Dependent Claim
30 words
The typewriter of Claim 7 wherein said means (15) for storing in said memory means inserts the last verified word in a predetermined storage position in said memory means (30).
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.