JPH0412870B2 - - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to an electronic dictionary provided in a language processing device such as a Roman word processor, a Roman typewriter, or an electronic computer that handles character information.

(Prior Art) English word processors, English typewriters, and the like are known to be equipped with electronic dictionaries for checking the spelling of input words (spell check). . This electronic dictionary generally consists of a main dictionary (usually composed of ROM (read-only memory)) and a user dictionary (usually composed of RAM (random access memory)). While the spellings of words used are registered, the user dictionary also registers the spellings of words used individually by each user.

(Problem to be solved by the invention) However, according to the electronic dictionary as described above, if a character string that does not constitute a valid word is input to the language processing device, that is, a character string that is not registered in the electronic dictionary is input. However, if a word with a similar spelling is mistakenly entered instead of a certain word, it is judged as a misspelling. First, there was a problem that input errors were overlooked.

Specifically, for example, a character string meaning "calendar" is "calendar", and a character string with a similar spelling is "calender". In this case, even if you intended to input "calendar" and incorrectly entered "calender", it would not be determined as a misspelling. This is because "ca-lender" has the meaning of "a machine that burnishes paper, cloth, etc. with a roller," and is registered as a valid word in itself. As a similar example, if you incorrectly enter "runes" as a variation of the verb "run" when you should have entered "runs", it will be treated as the plural of "rune (ancient Norse)" and will not be considered a misspelling. Not judged.

In that case, considering that the usage frequency of "calender" and "runes" is extremely low, if the configuration is such that the user can delete "calender" and "runes" from the main dictionary if desired, "calendar" can be changed to "calendar". ” or the variation of “run” as “runes” can be determined as a misspelling. However, as a practical matter, since the main dictionary is usually configured with ROM as described above, it is difficult to change the contents of the main dictionary. Furthermore, if the spelling of a word is incorrectly registered in the main dictionary, it cannot be easily rewritten, so there is a problem that an accurate spell check function cannot be obtained.

(Means for Solving the Problems) In order to solve the above problems, the present invention provides a plus dictionary for registering spellings of words as a reference for spell checking in an electronic dictionary consisting of a memory device, and A minus dictionary that registers the spellings of specific words that are less frequently used among the registered words,
The present invention further includes detection means for detecting words other than those registered in the plus dictionary and words registered in the minus dictionary as misspellings. That is, by registering a character string representing a word to be determined as a misspelling in the minus dictionary, the same effect as deleting the word from the plus dictionary can be obtained.

The above-mentioned plus dictionary consists of a ROM area (corresponding to the above-mentioned main dictionary) and a RAM area (corresponding to the above-mentioned user dictionary), and the above-mentioned minus dictionary consists of
It is preferable to configure it with RAM.

(Examples) Hereinafter, the present invention will be described in more detail based on Examples with reference to the accompanying drawings.

FIG. 2 shows the general configuration of a language processing device to which the present invention can be applied. The device includes an input device 1 (for example, a keyboard device, a tablet device, an OCR (optical character reader), a magnetic tape device, etc.) for inputting character and word information, and character information input from the input device 1 and edited. A storage device 2 (e.g., core memory, IC memory, magnetic disk, etc.) that stores the information, and an output device 3 (e.g., printer, display device, magnetic tape, magnetic disk device, etc.) that outputs the character information stored in the storage device 2. ), and an electronic dictionary 4 (for example, core memory, IC memory, magnetic disk, ROM,
RAM, etc.) and a control device 5 (for example, a computer) that controls the exchange of signals between the devices 1 to 4.
It is made up of.

As shown in FIG. 1, the electronic dictionary 4 consists of a ROM, a main dictionary 6 in which the spellings of commonly used words are registered, and a RAM, in which the user registers words used individually. Dictionary 7 and
It is comprised of a RAM and includes a minus dictionary 8 that registers the spellings of words that are to be determined as misspellings among the words registered in the main dictionary 6. The user dictionary 7 and the minus dictionary 8 are backed up by a known method in order to preserve their stored contents.

The above-mentioned electronic dictionary 4 is processed separately from the main body side processing.
Equipped with a CPU (central processing unit) 9 dedicated to side processing,
The CPU 9 exchanges signals with each of the dictionaries 6 to 8 via the bus 11 based on the system program stored in the program memory 10. or,
The CPU 9 is connected via a bus 12 to an I/F driver/receiver 13 on the main body side in serial or parallel fashion.

Next, spell check processing by the dictionary 4 will be explained in detail based on a flowchart.

In this embodiment, the main body side and the dictionary 4 side operate separately, and when a spell check request is issued from the main body side to the dictionary 4 side, the CPU 9 of the dictionary 4
performs spell check processing according to flowchart a on the right side of FIG. At this time, the alphanumeric character string of the word to be spell-checked is sent from the I/F driver/receiver 13 on the main body side to the CPU 9 on the dictionary 4 side by interrupt processing according to flowchart b on the left side of FIG. . The details will be explained below.

In the flowchart of FIG. 3a, when a spell check request is issued from the main unit, step 0 is executed.
Initial settings of various conditions, etc. are performed at (S0...hereinafter S is represented by steps). The flag is turned off in S1. This flag is used to determine whether spell check processing is being performed, and when the flag is on, it indicates that the spell check processing is being performed.

In S2, a CTC (control timer clock) that controls the timing of interrupts from the main unit is started to enable interrupts at predetermined time intervals, and in S3, interrupts from the main unit (described later) are enabled. Wait until the word to be spell-checked is sent by .

In S3, once the word that should be spell checked is sent from the main unit and the flag is turned on,
Proceeding to S4, a spell check is performed according to the flowchart of FIG. 4 (described later), and the result is output to the main body in S5. Continue back to S1, turn off the flag, and prepare to spell check the next word.

Next, interrupt processing will be explained.

In the flowchart of Fig. 3b, when character data of a word to be spell-checked is supplied to the CPU 9 by an interrupt, it is determined in S6 whether the flag is on or not, and if the flag is off, that is, the spell-check is executed. If not, the supplied character data is sequentially stored in the buffer character by character by the input command of S7. On the other hand, if the flag is on in S6, that is, spell checking is in progress, the process returns to the routine shown in FIG. 3a without storing the supplied character data in the buffer.

In S8, it is determined whether the supplied data is a punctuation code representing the end of a word, and if no, the process returns to the routine of FIG. 3a,
If yes, proceed to S9 and flag is turned on,
Further, in S10, the CTC is disabled, that is, an interrupt from the main body side is disabled, and then the routine returns to the routine shown in FIG. 3a.

Next, the spell check processing procedure will be explained based on the flowchart of FIG.

If word information is supplied in S11, the word is converted into a normal code or hash code in S12.

Subsequently, in S13, it is first searched to see if the supplied word exists in the main dictionary 6, and if it exists in the main dictionary 6, the process proceeds to S14, where it is further searched to see if the word exists in the minus dictionary 8. Ru.
If it exists in the minus dictionary 8, it is determined that it is a misspelling, and if it does not exist, it is determined that the spelling is correct.

At S13, the supplied word is added to the main dictionary 6
If the word does not exist in the user dictionary 7, it is subsequently searched to see if it exists in the user dictionary 7 (S15), and if it exists in the user dictionary 7, it is determined that the spelling is correct, and if it does not exist, it is determined that it is a misspelling. .

(Effects of the Invention) As described above, in the present invention, since a minus dictionary is provided in addition to the conventional plus dictionary, the following advantages arise.

() have spellings that are similar to each other as mentioned above,
One is used frequently and the other is used less frequently2
If there are two words (such as “calendar” and “calender”), there are two words (such as “calendar” and
etc.) in the minus dictionary, if you intend to enter a frequently used word but accidentally enter a less frequently used word registered in the minus dictionary, it can be determined as a misspelling. . Note that if you want to use a word that has been registered in the minus dictionary, you can delete that word from the minus dictionary. In that case, if the minus dictionary is configured with RAM as described above, registration and deletion from the minus dictionary can be easily performed.

() If a word is incorrectly spelled in the plus dictionary, registering the same spelling in the minus dictionary will have the same effect as deleting the incorrectly spelled word from the plus dictionary. can be obtained, thereby preventing spell check errors.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an electronic dictionary according to an embodiment of the present invention, FIG. 2 is a block diagram of a language processing device including the electronic dictionary of FIG. 1, and FIG. 3 is a dictionary side diagram of an embodiment of the present invention. FIG. 4 is a flowchart showing in detail the spell check processing steps included in the flowchart of FIG. 6, 7...Main dictionary, user dictionary (plus dictionary), 8...Minus dictionary.

Claims (1)

[Scope of Claims] 1. In an electronic dictionary comprising a memory device, a plus dictionary that registers the spellings of words that serve as standards for spell checking, and spellings of specific words that are less frequently used among the words registered in the plus dictionary. What is claimed is: 1. An electronic dictionary comprising: a minus dictionary for registering words; and detection means for detecting words other than those registered in the plus dictionary and words registered in the minus dictionary as misspellings. 2. The electronic dictionary according to claim 1, wherein the plus dictionary consists of a ROM area and a RAM area, and the minus dictionary consists of a RAM.