WORD SPELLING CHECKING SYSTEM

Abstract: A word processing circuit comprises a memory for storing the spelling of a plurality of basic words except those of compounds, an address counter for selecting an address for the memory, an input device for inputting a specific word, a register responsive to the input device for registering the specific word, a spelling checking circuit reponsive to the register and the memory for checking whether the spelling of the specific word is stored in the memory, and a control circuit responsive to the spelling checking circuit for controll­ ing the operation of the register and the address counter.

Description: WORD SPELLING CHECKING CIRCUIT BACKGROUND OF THE INVENTION The present invention relates to a circuit of a word processor and, more particularly, to a word spelling checking circuit for use in a word processor. Conventionally, to check whether the spelling of an inputted word is correct or not, a word processor recognizes that if the spelling of the inputted word is stored in a - memory storing a great number of spellings of words, it is detected that this spelling is correct. Since the number of the word spellings in a language is vast, it is desired to compress the data amount of the word spellings to be stored as much as possible. SUMMARY OF THE INVENTION Accordingly, it is an object of the present invention to provide an improved word spelling checking circuit of a word processor for compressing word spelling data. It is another object of the present invention to provide an improved word spelling checking circuit of a word processor comprising a memory storing a great number of basic words having a iniflilrurn capacity. It is a further object of the present invention to provide an improved word spelling checking circuit for a word processor comprising a memory storing a limited number of basic word spellings and not storing any spellings of compounds as formed with the composition of some spellings of the basic words. Briefly described, in accordance with the present invention, a word spelling checking circuit for a word processor comprises memory means for storing the spellings of a plurality of basic words except those of compounds, address counter means for selecting an address of the memory means, input means for inputting a specific word, register means responsive to the input means for registering the inputted word, spelling checking means responsive to the register means and.the memory means for checking whether the spelling of the inputted word is stored in the memory means, and control means responsive to the spelling checking means for controlling the operation of the register means and the address counter means. BRIEF DESCRIPTION OF THE DRAWINGS The present invention will become more fully understood from the detailed description given hereinbelow and the accompanying drawings which are given by way of illustration only, and thus are not limitative of the present invention and wherein: FIG. 1 is a block diagram of a word spelling checking circuit for a word processor according to the present invention; and .-FIG. 2 is a table showing the typical contents of a memory in the present invention. DESCRIPTION OF THE INVENTION FIG. 1 is a block diagram of a word spelling checking circuit for use in a word processor according to the present invention. The principle of checking the word spelling in accordance with the present invention is explained first with reference to some specific examples of basic words and their compounds. A basic word memory is provided for storing the spellings of a plurality of basic words able to form some compounds. For example, these basic words may be "motor", "boat", "car", "cycle" and the like. This memory should not store sorne compounds as formed by the composition with these basic words. For example, these non-stored compounds based on the basic words "boat", "car", and "cycle" may be "motorboat", "motorcar", and "motorcycle". If these non-stored compounds may be inputted as input words, it is detected that the first five letters "m", "o", "t", neo", and "r" of this compound are stored within the memory as the basic word, and that the remaining letters are also stored in this memory as the other basic words. Referring now to FIG. 1, the word spelling checking circuit comprises a word memory 1, an address counter 2, a register 3, a spelling checking circuit 4, and a control circuit 5. These circuit elements are operated as explained below: (l) Word Memory 1: This is provided for storing spellings of a plurality of basic words. Responsive to some address information developed by the address counter 2, it develops a spelling of a word corresponding to the address information. For convenience' sake of description, in a preferred embodiment of the present invention, it is assumed that words to be checked are not inflectional, although it may be possible to check the inflectional words. Each time the address counter 2 is counted up, this memory l devellops a single word in the alphabetical order. (2) Address Counter 2: This is provided for advancing the address of the word. memory 1. The address counter 2 is responsive to a non-equivalent signa1wi3 from the spelling checking circuit 4 for counting up. It is responsive to a signal S4 from the control circuit 5 for resetting the counting operation to thereby re-start the counting. When the signal S3 is applied to the address counter 2 for counting up and, therefore, the counter 2 detects that no relevant words are stored in the word memory l, the counter 2 develops an error signal 55 indicating that this word is error. (3) Register 4: This register 3 has some letter storage figures and stores an inputted word for spelling checking in response to an input means for inputting the word. Responsive to a shift signal S6 from the control circuit 5, the register 3 shifts the letter figures of the inputted word toward the left side by instructed figure number, so that some of the first letters of the inputted word are overflowed from the letter storage figures of the register 3. (4) Spelling Checking Circuit 4: This is provided for checking the word spellings as developed from the word memory 1 and the register 3. When the word spelling from the word memory 1 is completely equivalent to that from the register 4, the spelling checking circuit 4 develops an equivalent signal Sl. Although not completely equivalent and when the letters of the word from the word memory 1 are equivalent to some of first letters of the word from the register 3, the splling checking circuit 4 develops a signal S2 toward the control circuit 5, the signal S2 representing the number of the equivalent first letters of the word from the word memory l. Based on this signal 52, the control circuit 5 outputs the shift signal S6 into the register 3 to shift all of the figures of the register 3 as being equivalent to this number. In the other cases, the circuit 4 develops a non-equivalent signal S3. The spelling checking circuit 4 may comprise a plularity of exclusive OR gates and a single AND gate. (5) Control Circuit 5: It is responsive to the signal S2 from the spelling checking circuit 4 for developing toward the register 3 the shift number information for shifting the its figures. It also develops the signal S4 to reset the address counter 2. FIG. 2 is a table representative of the typical contents of the word memory 1. The operation of the circuit elements of FIG. 1 will be described with reference to FIG. 2. (A) It is assumed that a word "motorist" is inputted into the register 3: The address counter 2 is started in response to a signal (not shown), so that it selects a first address. For example, responsive to the first address of the address counter 2, the word memory 1 develops a first word, for example, "zounds". This word is not equivalent to the spelling of the inputted word and any letters of this first word are not equivalent to some of the first letters of the inputted word. Therefore, the spelling checking circuit 4 develops the signal S3 toward the address counter 2, so that the address of the address counter 2 is advanced. Such an operation is repeated per word. Eventually, when the word memory 1 develops a word "rtorist", the spelling checking circuit 4 generates the signal Sl, representing that the inputted word has a correct spelling. (B) It is assumed that a word "motorcar" is inputted into the register 3: The spelling of the inputted word is checked by the spelling checking circuit 4. When the address counter 2 selects a specific adress for a word "motor" to the word memory l, the word memory l develops the first word "motor" and the register 3 develops the inputted word "motorcar". Since some letters, five in this instance, of the inputted word "motorcar" are contained in the first letters of the word developed by the word memory l, the spelling checking circuit 4 generates the signal S2 toward the control circuit 5. Responsive thereto, the control circuit 5 develops the signal S6 toward the register 3 so that all of the figures of the register 3 are left shifted by the number of the letters "motor", five in this instance. Thus, all of the figures of the register 3 are left shifted and the letters in the five first figures are thereby overflown. The register 3 now leaves new letters "car" instead of the previous letters "motorcar". The control circuit 5 resets the address counter 2, so that it starts to select its address, again. When the word memory 1 generates a word "car" and then the register 3 outputs the letters "car", the spelling checking circuit 4 develops the equivalent signal Sl, representing the confirmation of the correct spelling. When the letters "car" are not stored in the word memory 1, the address counter 2 reaches to select the final address. In such a case, the counter 2 outputs the error signal S5, representing that the inputted word is not stored in the word memory l meaning that the inputted word seems to be error. As described above, in accordance with the present invention, it is unnecessary for the memory to store any compounds as the composition of some basic words. The capacity of the memory can thereby be minimized. Although the above description is assumed that the language of the words is English, any other languages can be applied. For instance, since German has a great number of compounds, the present invention can be employed usefully. Further, English, German, and the like have many conjugations and inflections. However, since most of the words in these languages are inflected at their ends and the significant letters of each of them are unchanged, the present invention is useful to compress a word memory capacity because of unnecessity of storing the compounds. For the inflected words, it may be useful for the memory to additionally store the inflected parts. In response to the detection of the spelling checking circuit 4, the word processor - proceeds with an operation. The invention being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the scope of the invention. There are described above novel features which the skilled man will appreciate give rise to advantages. These are each independent aspects of the invention to be covered by the present application, irrespective of whether or not they are included within the scope of the following claims.

Claims: CLAIMS: 1. A word processing circuit comprising: memory means for storing the spellings of a plurality of basic words except those of compounds; address counter means for selecting an address of said memory means; input means for inputting a specific word; register means responsive to said input means for registering the specific word; spelling checking means responsive to said register means and said memory means for checking whether the spelling of the inputted word is stored in said memory means; and control means responsive to said spelling checking means for controlling the operation of said register means and said address counter means. 2. The circuit of claim 1, wherein said spelling checking means operates to detect how many letters of the specific word from said register means are equivalent to some letters of the basic words from said memory means. 3. The circuit of claim 2, wherein said register means is responsive to the detection of said spelling checking means for overflowing some of the first letters of the specific word in said register means, this newly-formed word being further subjected to the spelling checking operation by said spelling checking means. 4. The circuit of claim 3, wherein said spelling checking means is adapted to detect that the spelling of the specific word is correct if the newly-formed word is stored also in said memory means and that the spelling of the same is error if the newly-formed word is not stored in said memory means. 5. A system for checking the spelling of words entered into the system wherein the system has a record of correct word spellings and compound words are checked by first seeking to identify correspondence between a word held in said record and a first part of the compound word and, in response to such identification, seeking to identify correspondence between the as yet unidentified part of the compound word and a word held in said record. 6. A system according to claim 5 wherein a word entered into the system is stored in a register and, in response to correspondence being identified between a word held in said record and a first part of a compound word stored in said register, said first part of said compound word is removed from said register and the remaining part of the compound word is investigated for correspondence with a word held in said record. 7. A system according to claim 5 or 6 wherein the system record contains few or no compound word spellings.

Inventors: YOSHIDA, KUNIO
Applicants: SHARP KABUSHIKI KAISHA
Application year: 1984
Main classification: G06F15
IPC codes: G06F17