JPS619726A - Electronic dictionary - Google Patents

Abstract

PURPOSE:To facilitate easy correction of an English word by presuming a correct word corrsponding to a designated English word from the word data of a dictionary memory in case the English word designated by a character key is not detected out of the dictionary memory. CONSTITUTION:It is checked whether an input English word is included or not in the word data stored in a memory. If the English word is not included in the memory, the 1st comparison means compares each letter of the input English word with the letters of the words of the word data stored in the memory in accordance with the order of array to obtain pairs of different letters. Then the 2nd comparison means shifts or rearranges the letters of either one of both sides in response to the number of paired letters obtained by the 1st comparison meand and carries out the second comparison to obtain the different pairs of letters. Based on the results of both comparison means, a selection means presumes the compared word data as an English word of correct spelling and displays it to a display means.

Description

[Detailed Description of the Invention] Structure of the Invention (Field of Industrial Application) This invention relates to an electronic dictionary, and more specifically, when an English word specified by a character key does not exist in the dictionary memory, the correct This invention relates to an electronic dictionary that estimates and displays English words from word data in a dictionary memory.

(Prior Art) Conventionally, in electronic dictionaries, English words input using character keys are displayed on a display device such as a CRT. And at this time,
If the input English word is incorrect and there is no corresponding word among the word data pre-stored in the dictionary memory provided in the electronic dictionary, the English word displayed on the display device will be displayed blinking and the corresponding word will be displayed. I was informing you of the mistake.

(Problem to be solved by the invention) However, when correcting this incorrect English word, if one does not know the correct spelling, one has to look it up in a dictionary or other means, which is extremely troublesome.

(Means for Solving the Problem) In order to solve the above problems, the present invention provides an input means for inputting English words etc. character by character, and a corresponding English word based on the output signal of the input device. a first display means for displaying words etc. on a display device; a storage device for storing a large number of word data; and an English word inputted from the input means is included in the word data stored in the storage device. a search means for searching whether the word exists or not, and when the input English word does not exist in the storage device in the search by the search means, each character of the input English word and each word data stored in the storage device; a first comparison means that compares the letters of the words according to their arrangement order to find different character sets; The second step is to shift one of the characters or rearrange the characters of both words and compare again to find different character sets.
a selection means for estimating and selecting the compared word data as a correctly spelled English word based on the results of the first and second comparison means; The gist thereof is an electronic dictionary comprising a second display means to be displayed on a display device.

(Function) When the search means searches whether the English word input from the input means exists in the word data stored in the storage device, if the input English word does not exist in the storage device, first The first comparing means compares each character of the input English word with the characters of the word of each word data stored in the storage device according to their arrangement order to find different character sets.

Next, a second comparing means shifts the characters of one of the two words or rearranges the characters of both words according to the number of different character sets determined by the first comparing means and compares again. Find different character sets.

Then, based on the results of the first and second comparing means, the selecting means estimates and selects the compared word data as a correctly spelled English word, and selects the English word based on the selected word data as a correctly spelled English word. The word is displayed as a word on the display device using the second display means.

(Example) Hereinafter, an example in which the electronic dictionary of the present invention is embodied in a Roman language word processor will be described with reference to the drawings.

In FIG. 1, a Roman word processor 1 is provided with a large number of character keys 3 and a space key 4 on an input board 2 as input means. When the character keys 3 are operated, corresponding character data, ie, various character data such as alphabets and numbers, are selected and input.

A CRT 5 as a display device is provided behind the input board 2, and English words and numbers input using the character keys 3 are displayed. A printer device 6 is provided on the side of the CRT 5, and prints English text input using the character keys 3 onto a printing paper 7.

Next, an electric circuit built into the Latin word processor 1 configured as described above will be explained.

In FIG. 2, first and second display means, search means,
A central processing unit (hereinafter referred to as CPU) 11 serving as first and second comparison means and selection means displays characters on the CRT 5 based on the ON signal of each character key 3.

The dictionary memory 12 is a read-only memory, and word data of English words are stored in alphabetical order from the first address to the last address in the word storage section of each address.

The working memory 13 is a random access memory, and stores character data input using the character keys 3 and word data estimated and selected by the CPU 11, which will be described later.

The CPU 11 has a function of searching whether or not an English word input using the character key 3 and the space key 4 exists among a large number of word data stored in the dictionary memory 12. has a comparison function that compares each character of the input English word data with the characters of the English word of each word data stored in the storage dictionary memory 12 in accordance with their arrangement order to find different character sets. are doing.

This comparison function consists of a first comparison processing operation and a second comparison processing operation, and the first comparison processing operation sequentially reads word data from the dictionary memory 12 and aligns the read word data with each other. The input English words are compared according to the order of their characters. At this time, the comparison method for each character set to be compared is such that the read word data is
In CoRRECT'l0NJ, the input English word is rcO
In the case of RRECTEONJ, as shown in FIG. 3, the character codes of both characters to be compared are logically ANDed, and if they match, it is set as "1", and if they do not match, it is set as fOJ, and the comparison is made to find the number of "Oj".

Then, the CPU 11 returns "0" as a result of the first comparison processing operation.
, that is, the number of different character sets is 1, the CPLll stores the compared word data in the working memory 13 as estimated word data. That is, the CPU 11 determines that the wrong key operation was made to read rcORRECTEQNJ instead of [C0RRECT 10NJ.

Next, if the number of different character sets is 2 or more, CPU1l
performs the second comparison processing operation. In the second comparison processing operation, when the number of different character sets is two, as shown in Figure 4, the characters on the input English word side of the character set that became rOJ are swapped, and the characters are swapped. Compare the English words and the previously compared word data again. Then, when all of the words are "1" (when they match), the CPU II stores the word data in the working memory 13 as estimated word data.

However, in this case, when the key was supposed to be rED ITORJ, it was changed to rEDITROJ.
The PU 11 is designed to make a judgment.

On the other hand, if there is no match or if the number of character sets that differ from the above is three or more, the second comparison processing operation of the CPU 11 compares the number of characters of the input English word with the number of characters of the word data being compared. Then, the one with the smaller number of characters is shifted to the right and the ends are aligned with each other, and a comparison processing operation similar to the first comparison processing operation is performed.

For example, if the English word you entered is incorrectly spelled [PINTER]
J and the single 8H read out from the dictionary memory 12
If the data is IPolNTERJ, as shown in FIG. The same comparison processing operation as the comparison processing operation is performed. Then, the logical sum of the calculation results of the comparison processing operations of both cylinders 1 and the second comparison processing operation is taken to find the number of "0".

When the number of "0"s is one, the CPU 11 stores the word data in the working memory 13 as estimated word data. In other words, the CPU 11 determines that the key was operated incorrectly as rPINTERj instead of [Po■NTERJ].

On the other hand, if there are two or more rOJs, CP
U11 reads the next word data from the dictionary memory 12 and repeats the same processing operations as described above.

The CPL III displays the estimated word data stored in the working memory 13 on the right corner of the CRT 5, and also displays the English words that have been input earlier and are displayed on the CRj 5 in a flashing manner. Note that if the word data has fewer characters, the word data is shifted to the right and the ends are aligned, as shown in FIG. 6, and the comparison process is performed.

Next, the operation of the Latin word processor 1 configured as described above will be explained with reference to FIGS. 7 and 8.

Now, when CI) Ull is waiting for the operation of various keys on the input board 2, when an English character is input from the character key 3 (step 1), the CPU 11 transfers that character to the CRT 5.
are sequentially displayed, and the character data corresponding to the characters is stored in the working memory 13 (step 2). In this way, after inputting the desired English word using character key 3,
In step 3), when the space key 4 is pressed to create a predetermined interval between the following English words, the CPU 11
recognizes the previous English character string as an English word (step 4), and searches whether the English word exists in the dictionary memory 12.

First, the CPU 11 checks whether there is word data to be searched (step 5), and then first reads out one word data in alphabetical order from the word data stored in the dictionary memory 12 (step 6).

Next, the CPU 11 aligns the read word data and the input English word, and compares the letters of the aligned English words to see if they match by ANDing the character sets corresponding to their arrangement order (step 7). As a result of comparing the characters of each character set, it is determined that there is no "0" value in each logical product and all are 11", that is, the input English word matches the compared word data (step 8) , C
After clearing the storage area for storing estimated word data in the working memory 13 (step 9), the PU 11 waits for input of the next English word (steps 1 and 3).

On the other hand, if the input English word does not match the compared word data, the CPU 11 checks whether the number of different character sets is one among each character set (step 10). If the number of different character sets is 1, then CP
U11 checks whether the number of characters in both cars z■ is the same (step 11), and if they are the same, the word data read from the dictionary memory 12 for this comparison is converted into a correctly spelled English word, that is, estimated word data. It is stored in the working memory 13 as (step 12). Next, CPU11
causes the arrow wheel iiH displayed on the CRT5 to blink,
In addition to indicating that the English word is incorrectly spelled, an English word based on the estimated word data stored in the working memory 13 is displayed on the right corner of the CRT 5, and an English word that is thought to be correctly spelled is marked as having a one-letter difference. It is presented along with the message (step 13), and a "spelling error" message is displayed (step 14) to instruct correction and wait for the next operation of the character key 3 (steps 1, 3).

On the other hand, if the number of different character sets is not 1, CPU1l
checks whether the number of different character sets is two (step 15). Then, if the number of different character sets is two, the CPU 11 rearranges the input English word characters in the Minona character set in alphabetical order as shown in FIG. 4 (step 16).Next, the CPU 11 compares the transposed English word with the previously compared word data again (step 17), and checks whether there is a "0", that is, whether there is a match (step 18).Then, When the word data matches the English words that have been compared and replaced again, the CPU
11 stores the word data in the working memory 13 as estimated single item data (step 19).

Next, CPtJll flashes the English word displayed on the CRT 5 in the same manner as above to indicate that it is an incorrectly spelled English word, and also displays the English word based on the estimated word data stored in the working memory 13. After displaying the word in the right corner of the CRT 5 and presenting the English word that seems to be the correct slurp together with the message with the opposite spelling (step 20), the processing operation of step 14 is carried out to instruct its correction and the next step. Waiting for the operation of the character key 3 (steps 1 and 3). On the other hand, if the number of different character sets is not 2, or if the English word formed by transposing the word and the word data compared earlier do not match, the CPU 11 Compare the number of characters of the input English word with the number of characters of the word data being compared, shift the one with the smaller number of characters to the right, and align the ends with each other (Step 2
1) Find the logical product of the character sets corresponding to the alignment order of the ICC English word characters (step 22).

The CPU 11 calculates the value of this logical product and the value obtained in step 7 above.
The logical sum of the j logical product values is determined (step 23). Then, the CPU 11 checks the number of [01s] (step 24).

As a result of this check, if the number of "0" is one or less, C
The PU 11 stores the word data as estimated word data in the working memory 13 (step 25).

Next, the CPU 11 flashes the English word displayed on the CRT 5 in the same manner as described above to indicate that it is an incorrectly spelled English word, and also displays the English word based on the estimated word data stored in the working memory 13. After displaying the word in the right corner of the CRT 5 and presenting the English word that is thought to be correctly spelled with a message that if there is one more character, there is one more character, and if there is one character less, one character is less (step 26),
The processing operation of step 14 is performed, the correction is instructed, and the next operation of the character key 3 is awaited (steps 1 to 3). In addition,
Similar processing operations are performed even if the numbers of characters do not match in step 11.

On the other hand, if the number of rOJs is two or more, the CPU 11 reads the next search target word data from the dictionary memory 12 (step 5), and repeats the same process as above until matching word data or estimated word data is found. Performs comparison processing operations, etc. Then, if all the word data in the dictionary memory 12 is read out and there is no matching word data or estimated word data, a "spelling error" message is displayed on the CRT 5 to indicate that the word is incorrectly spelled. 14), waits for the next operation of character key 3 (step 1.3).

In this way, in this embodiment, when an English word input by operating the character key 3 is spelled incorrectly and does not exist in the dictionary memory 12, estimated word data that is likely to be a correctly spelled English word is determined. Since the information is displayed on the CRT 5, there is no need to check the correct spelling of an incorrectly spelled English word using a dictionary or other means, and the work of correcting the English word can be done quickly.

In addition, in this embodiment, when searching for word data, the same-lP R data or estimated word data is obtained for the word data read out sequentially. , the estimated word data may be searched only when there is no matching word data.

(Effects of the Invention) According to the present invention, there is no need to use a dictionary or other means to find out the correct spelling for incorrectly spelled English words, and the work of correcting English words can be done quickly. It has excellent effects.

[Brief explanation of drawings]

Figure 1 shows a European language wordpress set embodying this invention.
Figure 2 is a perspective view of the circuit, Figure 2 is its electric block circuit diagram, Figures 3~
Figure 6 is an explanatory diagram illustrating a comparison method for comparing input English words and word data read from the sound memory, and Figures 7 and 8 show processing operations of the central processing unit (CPU). It is a flowchart. In the figure, 1 is a Roman word processor, 2 is an input board, and 3
1 is a character key, 4 is a space key, 5 is a CRT, 11 is a central processing unit (CPtJ), 12 is a dictionary memory, and 13 is a working memory.

Claims (1)

[Scope of Claims] An input means for inputting English words, etc. character by character, and a first display means for displaying the corresponding English words, etc. on a display device based on the output signal of the input device. , a storage device that stores a large number of word data; a search device that searches whether or not an English word input from an input device exists in the word data stored in the storage device; During a search, if the input English word does not exist in the storage device, each character of the input English word is compared with the characters of the word of each word data stored in the storage device in accordance with their arrangement order to determine the difference. The first step is to find a character set.
Shift the characters of one of the two words according to the number of different character sets determined by the comparison means and the first comparison means, or rearrange the characters of both words and compare again to determine the difference. a second comparison means for determining a character set; a selection means for estimating and selecting the compared word data as a correctly spelled English word based on the results of the first and second comparison means; and the selected word data. second display means for displaying English words based on the above on the display device.