Information processing system with device for checking spelling of selected words extracted from mixed character data streams from electronic typewriter

• US 4,980,855 A
• Filed: 08/25/1987
• Issued: 12/25/1990
• Est. Priority Date: 08/29/1986
• Status: Expired due to Fees

• Current Assignee: Brother Kogyo Kabushiki Kaisha
• Original Assignee: Brother Kogyo Kabushiki Kaisha
• Inventors: Kojima, Yasumichi
• Primary Examiner(s): Williams, Jr., Archie E.
• Assistant Examiner(s): Mohamed, Ayni
• Application Number:
  US07/089,267
• Time in Patent Office: 1,218 Days
• Field of Search: 364/200 MS File, 364/900 MS File, 400/63
• US Class Current: 715/236
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation

Abstract

A date checking system optionally attached to a host device like a typewriter has two buffers, a predetermined cut-out rule and a dictionary ROM. A data queue from the host device is temporarily stored in one of the buffers, and then one word is cut out therefrom by cut-out codes like a space or punctuation mark to be stored in another buffer, where the word is locked up in the dictionary ROM to determine if the spelling thereof is correct.

Claims

1. A data processing apparatus separate from an electronic typewriter outputting data as a queue of data comprising:

input terminal means for receiving a queue of data from the electronic typewriter;

input buffer means for sequentially storing the data received by the input terminal means;

cut-out means for cutting out a group of data preceding a stop data as a word from said queue of data stored in the input buffer means in accordance with a predetermined cut-out rule to divide said queue of data into words, the cut-out rule being such that a block of data is cut-out when one of code data including a space code data, a punctuation code data, a hyphen code data, and a quotation mark code data follows the block of data;

reference information store means for storing correct spellings of a plurality of words;

search means for searching out a reference information corresponding to the block of data cut-out by the cut-out means from the reference information store means;

output means for outputting a search result at the search means; and

data correction means responsive to a correction command from the electronic typewriter for correcting data in the queue of data in the input buffer means, said data correction means including;

a pointer memory for indicating an address of the input buffer means, the pointer memory normally pointing to an address representing one end of the input buffer means;

backspace means responsive to a backspace code data from the electronic typewriter for proceeding the address in the pointer memory toward the other end of the input buffer means;

delete means responsive to a correction code data from the electronic typewriter for shifting the queue of data between the address pointed to by the pointer memory and said other end of the input buffer means toward said one end of the input buffer means by one address.

2. A data processing apparatus according to claim 1, wherein said one end is assigned with a lowest address and said other end is assigned with a highest address in the input buffer means.