Patent US2651078A successfully refreshed from Google Patents.
Patent US4933896A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4933896A Expired / Lapsed US ⏱️ 0.0 years remaining

Word processing apparatus for comparing entered data with stored data from a selected address and in a selected order

Assignee: Brother Industries Ltd
•
Filing: 1988-02-04
•
Granted: 1990-06-12
•
Expires: 2008-02-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A word processing apparatus has the capability of comparing entered data stored in a text memory with stored data in a dictionary memory from a selected address in the text memory and in a selected order.

Inventors

  • 👤 Toshiyuki Sakai

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 15:13
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/232

Claims Analysis

Total Claims: 6
Claim 1
Independent Claim 393 words
A word processing apparatus for comparing entered data with stored data from a selected address and in a selected order comprising: entering means for entering data representative of characters, words formed by characters, symbols and various command signals; a text memory for storing data entered from said entering means; display means for displaying at least a portion of said entered data at specified addresses, where said entered data are stored in said text memory, on a display, said display means comprising cursor control means for controlling movement of a cursor on said display; a dictionary memory storing word data representative of a correct spelling of a plurality of words; spelling check means for processing a search of said dictionary memory for word data having a spelling coincident with a spelling of word data read out from said text memory; start address specifying means for selectively specifying a start address in said text memory for starting said read out of data stored in said text memory to be searched by said spelling check means, said start address specifying means comprising a cursor display position counter for storing data indicating a cursor position on said display in response to movement of the cursor and a cursor position pointer for specifying an address of data stored in said text memory corresponding to the position of the cursor as indicated by the data of said cursor display position counter, and said start address specifying means specifying the address indicated by said cursor position pointer as said start address; order specifying means for selectively specifying an order of reading out data stored in said text memory from said specified start address, said order specifying means comprising a forward spell check key installed on said entering means for commanding said search by said spelling check means sequentially from said start address toward an end address in said text memory and a reverse spell check key installed on said entering means for commanding said search by said spelling check means from said start address toward a head address in said text memory; and result output control means for controlling said display means to display a word on a center of said display corresponding to word data read out from said text memory having a spelling which is not coincident with the spelling of word data contained in said dictionary memory.
Claim 2
Dependent Claim 393 words
A word processing apparatus for comparing entered data with stored data from a selected address and in a selected order comprising: entering means for entering data representative of characters, words formed by characters, symbols and various command signals; a text memory for storing data entered from said entering means; display means for displaying at least a portion of said entered data at specified addresses, where said entered data are stored in said text memory, on a display, said display means comprising cursor control means for controlling movement of a cursor on said display; a dictionary memory storing word data representative of a correct spelling of a plurality of words; spelling check means for processing a search of said dictionary memory for word data having a spelling coincident with a spelling of word data read out from said text memory; start address specifying means for selectively specifying a start address in said text memory for starting said read out of data stored in said text memory to be searched by said spelling check means, said start address specifying means comprising a cursor display position counter for storing data indicating a cursor position on said display in response to movement of the cursor and a cursor position pointer for specifying an address of data stored in said text memory corresponding to the position of the cursor as indicated by the data of said cursor display position counter, and said start address specifying means specifying the address indicated by said cursor position pointer as said start address; order specifying means for selectively specifying an order of reading out data stored in said text memory from said specified start address, said order specifying means comprising a forward spell check key installed on said entering means for commanding said search by said spelling check means sequentially from said start address toward an end address in said text memory and a reverse spell check key installed on said entering means for commanding said search by said spelling check means from said start address toward a head address in said text memory; and result output control means for controlling said display means to display a word on a center of said display corresponding to word data read out from said text memory having a spelling which is not coincident with the spelling of word data contained in said dictionary memory.
Claim 3
Dependent Claim 30 words
A word processing apparatus according to claim 1, further comprising a word data memory for storing word data from said text memory to be processed by said spelling check means.
Claim 4
Dependent Claim 43 words
A word processing apparatus according to claim 2, further comprising a text data pointer for sequentially detecting a last position of character data in said text memory forming a word and for storing an address of said last position in said text memory.
Claim 5
Dependent Claim 52 words
A word processing apparatus according to claim 3, wherein data of said cursor position pointer is written to said text data pointer and subsequently word data corresponding to the address specified by said text data pointer is written to said word data memory and compared with word data of said dictionary memory.
Claim 6
Dependent Claim 62 words
A word processing apparatus according to claim 1, further comprising a new address specifying means for specifying a start address for starting said readout of data from said text memory after completion of said search by said spelling check means from said start address and a new order specifying means for specifying an order of reading out data in said text memory.

References Cited (Backward Citations)

US4136395A Cited
US4481607A Cited
US4758977A Cited
US4651300A Cited
US4751674A Cited
US4671684A Cited
US4775251A Cited
US4787059A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-06-11 1993-12-11 1994-06-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-06-11 1997-12-11 1998-06-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-06-11 2001-12-11 2002-06-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag