JPS61128365A - Spelling check system of word processing system - Google Patents

Abstract

PURPOSE:To attain simple and rapid processing by calculating the word No. of a word to be tested on the basis of the 1st and 2nd numeral lists and calculation formulas and deciding a current spelling when the No. exists in a dictionary memory. CONSTITUTION:A table for assigning numerals to respective characters in a word stored in a buffer 123 is prepared. A No. is assigned to the word on the basis of the table 124 and the calculation formula 125. The No. is compared with a No. in the dictionary memory 126 by a comparator 127, and if the coincident No. is detected, the spelling is decided as a normal one. If no error is detected in the 1st comparison, the No. N' is again calculated for the word stored in the buffer 123. Only when both the Nos. N, N' exist in the memory 126, the spelling of the word is decided as a correct one. Thus, the processing for spelling check can be simplified and the processing speed can be also improved.

Description

DETAILED DESCRIPTION OF THE INVENTION [Technical Field of the Invention] The present invention relates to a spell checking method in a word processing system.

[Technical background of the invention and its problems]

In recent years, the wave of modernization has swept over offices, and the combination
The electronic Type 2-Ita, a so-called word processor, which combines a TV screen (CRT monitor) and a printer, has come to occupy one corner of the office. Word processors continue to develop as core devices for OA (office automation), and can range from simple tasks such as inputting a document on a CRT monitor, making corrections, additions, deletions, etc., and starting a printer to obtain a document. There are a wide variety of high-quality, easy-to-use products on the market that can be used to check the spelling of input documents.

By the way, the word processors having the above-mentioned spell check function use the eight table and hash functions for spell checking, making the process complicated. Furthermore, if this processing is attempted to be simplified, a large memory capacity will be required, and the dictionary will be placed on an auxiliary memory such as a floppy disk, which will cause problems in terms of processing speed.

[Purpose of the invention]

The present invention has been made in view of the above-mentioned drawbacks, and it is an object of the present invention to provide a Kellspell check method for a word glossing system that is relatively simple and capable of high-speed processing.

[Summary of the invention]

In order to achieve the above object, the present invention performs spell checking according to the following procedure. That is, first, a word entered by the operator is extracted from the document memory, a number is assigned to each character composing the word by using a table, and the above number is assigned to each layer according to a polynomial prepared in advance. calculate. Then, the above number is calculated in advance for each layer, and the content is compared with the stored dictionary memory. If no spelling error is detected, a value different from the above, 5: Stored i. The accuracy of error detection is increased by performing recalculation and comparison using a different polynomial.

This relatively simplifies the spell checking process in the word glossing system, making it easier to develop and maintain spell checking functionality, and increasing processing speed.

[Embodiments of the invention]

1 is a block diagram showing an embodiment of an English word processor to which the method of the present invention is adopted.

As shown in the figure, an English word processor has a microprocessor II that controls its operations, a main memory II that has a program that executes spell checking, and a keyboard/display device KB/DSP that inputs keys and displays them. rs, and a floppy disk device FDI4 for loading an internally stored dictionary onto the memory port. The above microprocessor 11, main memory l 2゜KB/DSP13,
Floppy disk drive 14 is commonly connected to system path 15. The main part of the present invention is a memory U in which a program for executing a spell check is incorporated, and FIG. 2 shows the details thereof. The present invention will be explained in detail with reference to FIG.

In the figure, 121 is a document memory that stores the document to be checked, 122 is a comparator that checks the length of one word, 123 is a buffer that temporarily stores the extracted word, and 124 is a word structure. Table 125, which provides numbers corresponding to letters, is a polynomial and calculation device that generates numbers for extracted words. In addition, 12σ is a dictionary memory in which a similar number is calculated in advance and a dictionary in which the number is registered is loaded and stored from a floppy disk 3%, and 121 is generated by the above-mentioned device 125. This is a comparison instrument that compares the number with the registered number in the dictionary memory 126. Reference numeral 12B is an error processor that performs different processing depending on whether the spelling of the extracted word is correct or incorrect.Normally, the data input or modified by the operator using the keyboard/display device 13 is processed as a document. This is stored in the memory 121 and displayed. In the present invention, a word to be checked is extracted from this document memory 121. At the extraction stage, the length of the word is determined by the comparator 122. This is because there are generally no words consisting of 30 or 40 characters. In the embodiment of the present invention, any word longer than 15 characters is treated as an error.

The extracted words are temporarily stored in the buffer 123. A table for assigning numbers to each letter of this word is shown at 124, and in the embodiment of the present invention, to simplify the explanation, A=0, B==1, C=-2, . . .
A table for 26 uppercase English letters, Z=25, is prepared. Generally a word consisting of n letters an-Z r a n
-2"" a T a Each character of Q is Nn-1, In-2, ---, Nt by this table 124.
, No are assigned.

The word, in which each letter is assigned a number, is sent to a computing device 125 which uses a polynomial to generate a value. The word extracted here is given a single number. The number N is given by the following polynomial.

Hz Nrx-12"-'+Nn-22°-" + ・
...+Ns 2 '+No 2゜For example, 'APPIJ
' To find the value of the word ', table 124
From A=0 #P=15.

L=11, ff1=4. Since the number of characters n = 5, N
=0.2'+15.2'+15.2"+11
．． 2” + 4.2°=206.

Here, it is necessary to determine the upper limit of N (NK) due to memory constraints, but in the embodiment of the present invention, N=:
65535 (=2''-1).

Therefore, if the number N exceeds NWL, it is treated as an error, that is, a misspelling. N is NIIk
If it is equal to or smaller than lU, it is compared with the number on the dictionary memory 126 prepared in advance using the comparator 227, and if there is a match, the spelling is considered normal, and if there is no match, it is determined as an error. Process. The error processor 12/8 performs this process.

In the embodiment of the present invention, if the spelling of the extracted word is correct, nothing is done, but if the spelling is wrong, the entire word is displayed in reverse video to notify the operator.

An example of the contents of the dictionary memo I) 126 is shown in FIG. As shown in the figure, for example, if もAPPIJ:', N = 206 is determined and registered in advance using the same table and polynomial as the table 124 and the calculation device 125.

The entire dictionary is normally stored in an auxiliary storage device such as floppy disk drive 14, and is loaded into dictionary memory 126 when the spell check function is used. Since the dictionary memory 126 is located in the main memory 12, spell checking speed is increased.

Now, two problems arise here.

The first is that there may be multiple words with the same number N.

For example, the number of 'APPLffi' is 206
However, it is quite possible that a word with the same number exists. This will probably occur more frequently as the number of words registered in the dictionary increases.

The second is that the operator entered a random word.

This means that it is possible for the trees to match by chance. For example, enter FKAT I.

Then, N=206, which is the same as APPLE.

In order to solve these two problems, the present invention provides another table 224 and polynomial 226 as shown in the third example. In this table 224, the numbers corresponding to alphabetic characters are A==25, B=24, contrary to the table 124 mentioned above.
C=-23-, Z === O, and the polynomial is also given to the same material as N'=Nn-1'2°+N'n+z 2'-
The order of ascending powers is f-·ten N'12"-2+Ho'2"-1 (n: number of characters in the word).

If no error is detected in the first comparison as indicated by the dotted line in FIG.
and the polynomial 226, and the number N' is calculated again for the extracted word, that is, the word stored in the so-called buffer 123. The word is spelled correctly only if the numbers Nn and 7 exist at the same time. That is, 1
Two types of numbers are prepared for each word.

An example is shown in No. 4-. For example, APPfJ is N:2
06$N'==569, and i5RAuGg is N=7
88, N'=7.87. If there are words in the dictionary that still match, you can prepare a third table or polynomial, but generally this is sufficient.

〔Effect of the invention〕

As explained above, according to the present invention, the processing is relatively simple, and the development and maintenance of the spell check function is facilitated. In addition, the dictionary requires less space and can reside permanently in the main memory, improving the processing speed of spell checking.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of an English word processor employing the method of the present invention, and FIG. 2 is a diagram conceptually showing a spell check program executed in the main memory on the main memory. FIG. 3 shows another table and polynomial for reconfirming validity when no error occurs in the first check, and FIG. 4 shows an example of a dictionary memory. 11... Microprocessor, 12... Main memory,
13...Keyboard/display device, 14...
Floppy disk device, 121...Document memory, 122φ127...Comparator, 123...Buffer, 124/224...Table, 125...Total'H, device, 126/226... Dictionary memory, 128
...Error handler.

Claims (1)

[Claims] In a word processing system consisting of a keyboard, a display device, an auxiliary storage device such as a floppy disk, and a main memory, there is a table that assigns a number to each character that makes up a word, and a system that uses this table to assign numbers to words. A calculation device that prepares a polynomial and calculates it, a dictionary memory that calculates and stores this number for each word in advance, and compares the number stored in this dictionary memory with the number generated by the calculation device. a comparator, and the result of the comparison check by the comparator,
In a word processing system characterized in that, if a spelling error is not detected, a table storing different values from the above and another polynomial are prepared, and calculation by a calculation device and comparison by a comparator are performed again. Spell check method.