JPS62173568A - Electronic dictionary - Google Patents

Abstract

PURPOSE:To attain high-speed processing and also to improve the function of an electronic dictionary by providing an area where a user dictionary stores registered words by means of numerical data using a Hash method and an area where those words are stored in the form of character data. CONSTITUTION:A user dictionary 1 includes an index part 2, a data part 3 containing an area where words registered by users are stored by means of the numerical data using a Hash method, and a data part 4 containing an area where those registered words are stored in the form of the character data. The Hash method is available for the spelling check of the dictionary 1 and therefore the high-speed processing is possible. While the character data is available for such processes as registration, deletion, list output, etc. that require no high-speed operations.

Description

DETAILED DESCRIPTION OF THE INVENTION <Field of Industrial Application> The present invention relates to electronic dictionaries, and particularly to improvements to user dictionaries therein.

<Prior Art> Computer systems, word processors, electronic typewriters, etc. that handle word information are equipped with electronic dictionaries to check whether there are any errors in the spelling of input words. This electronic dictionary consists of a main dictionary and a user dictionary, where the main dictionary holds word information supplied in advance by the system, and the user dictionary holds word information registered by the user.

Normal spell checking, as shown in Figure 6, searches to see if the main dictionary has the same information as the word in question.
If the same information is not found, a search is made to see if the same word information exists in the user dictionary, and if the same word information is found in the main dictionary or user dictionary and the spelling is incorrect, it is determined that the spelling is incorrect.

<Problems to be Solved by the Invention> In the spell check described above, even if the main dictionary has a good data structure and processing is fast, if processing of the user dictionary takes time, the overall processing becomes slow. Unlike the main dictionary, the user dictionary is not provided by the system, but allows the user to freely register words, so it must have a certain degree of compatibility. That is, it is necessary to be able to realize high-speed processing like the main dictionary, and to be able to freely output a list of word information registered in the user dictionary. Since the area of the user dictionary is limited, when the data area expires, it is impossible to determine which word information to delete without the list.

FIG. 7 shows the structure of a user dictionary using only the l1ash method. In the II a s h method, the word information registered by the user is registered by combining numerical data and Hash, that is, meaningless information for making the data block length constant. In this user dictionary, the index is Ha s h
Data is allocated on average and the data search speed is fast, but it is difficult to replay the original word when the data section expires or when you want to check the currently registered words. It is. Another problem is what to do when words registered in the user dictionary happen to have the same Hash value. Since they have the same Hash value, if they are to be used together, it is difficult to know which one to delete or leave when deleting next time.

FIG. 8 is an example in which a character string is used without using the II a sh value. When just character strings are arranged in this way, the characters are compared according to the length of the word, but while it is possible to see what kind of words are registered in the user area, when checking the spelling, it is difficult to compare the characters. Since it is a comparison, the processing will inevitably be slow. To cover this, a method is sometimes taken to arrange the words in the user area in order of frequency or in the order of most recent use, but if a word that is actually spelled as entertainment is entered, it will still be until the end of the user area. Searching takes time. Furthermore, even if an index that does not use Hash is constructed from the initial letter of a word or the length of a word, as shown in FIG.
Data is not allocated on average like an index using 5h (there are many 8-letter words starting with C or S, but 2
There are almost no 8-letter words that start with `` or

Means for Solving the Problems〉 The electronic dictionary according to the present invention stores words registered by the user in Ha
The present invention is characterized in that it includes a user dictionary having an area for storing numerical data using the sh method and an area for storing the above words as character data.

<Example> FIG. 1 shows the structure of the user dictionary of this embodiment.

(7) Knee IJ' dictionary 1 consists of an index section 2, a data section 3 consisting of an area for storing words registered by the user as numerical data using the Hash method, and an area for storing the above words as character data. It is composed of a data section 4.

FIG. 2 shows the configuration of a computer system using this user dictionary W:1. The input device 5 is a device for inputting character and i-word information into the storage device 6, and includes, for example, a keyboard device, a tablet device, an OCR device, a magnetic tape device, and the like. The storage device 6 is an area that stores information on characters and words inputted from the input device 5, and includes, for example, a core memory, an IC memory, a magnetic disk, and the like. The output device 7 is a device that outputs the information stored and edited in the storage device 6, and is, for example, a printer or a display device.

Consists of magnetic tape devices, magnetic disk devices, etc.

The spell check dictionary device 8 is a dictionary area for supplying valid information as appropriate in response to inquiries about the spelling information of characters and words stored in the storage device 6, and includes a main dictionary (not shown) and the above-mentioned It consists of a user dictionary 1.

This spell check dictionary device 8 includes, for example, a core memory,
IC memory, ROM.

Consists of magnetic disks, etc. The control device 9 consists of a computer that controls the exchange of signals and data between the above components.

The effect will be explained below.

When performing a spell check, the Hash value of the word is calculated using the if a h method, and the Hash value of the word is
The data can be searched at high speed.

The data section 4 is mainly used to register, delete, and output a list of word information in the user dictionary 1.

When registering a word in the user dictionary 1, as shown in FIG. It is searched to see if it exists (Step #12). If the same word information exists in the main dictionary or data section 4, an error will occur. If the same word information does not exist, create a Hash value for the word information (Step #13), and set the same Hash value as the created Hash value.
A search is made to see if the s h value exists in the data section 3 (step #14).

If the same Hash value exists, turn on the double flag (
Step #15). The Hash value is represented by 27 bits, and the first 5 bits constitute an index, so the data part is represented by 22 bits. However, in reality, it is the data part of the user dictionary 1.

Since 3 is stored in 3 bytes, there is a margin of 2 bits. Therefore, if one of the two bits is ON, it means that the Hash value is used for 2M. After the above processing, the index is counted up, the Hash value is set, and character data is added to the data section 4, thereby completing the registration of word information (step #16).

When deleting a word from the "User Dictionary", as shown in Figure 4, first search to see if there is character data for the word in the User Dictionary 1 (Step #21), and if there is character data, delete it from the data section 4. This character data is deleted (step #22). Next, create a Hash value for the word (step #23), and use the same Hash value in the data section 3.
Search whether the double flag is ON for the value (Step #24). If the double flag is not ON, this II a s h value is deleted (step #25), and the index is counted down (step #29).

On the other hand, if the double flag is ON, Hash values are calculated for all words in user dictionary 1 using the 1-lash method, and the process is performed to determine whether there are more than one same Hash value (Steps #26 and #27) , if there are multiple indexes, just count down the index Step #2
9) If there is only one, the double flag is turned OFF (step 928), and the index is counted down (step #29).

When outputting a list of word information registered in the user dictionary 1, as shown in FIG.
31) If there is character data, send this character data to the output device 7 (step #32). Since the data section 4 holds word information in alphabetical order of initial letters, it is possible to output a list in an easy-to-read manner.

<Effects of the Invention> As explained above, in the present invention, the user dictionary has an area for storing registered words as numerical data using the Ra5h method and an area for storing the words as character data. Therefore, when spell checking a user dictionary, Hash values can be used for high-speed processing, and character data can be used for processes that do not require high speed, such as registration, deletion, and list output. This makes it possible to improve the functionality of electronic dictionaries.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the structure of a user dictionary according to an embodiment of the present invention, FIG. 2 is a block diagram showing the configuration of a computer system to which the present invention is applied, and FIGS. FIG. 6 is a flowchart showing an example processing procedure. FIG. 6 is a flowchart showing a spell check processing procedure. FIGS. 7, 8, and 9 are diagrams showing the structure of a conventional user dictionary. 1...User Dictionary 2...Index 3.4...Data Department Patent Applicant Sharp Co., Ltd. Representative Patent Attorney Nishi 1) New Figure 3 Course Avoidance) ■Drama? -IAS/LA 龜OKRIDO 1 Tode °'-9 & Uroshe 8 Lumis Fig. 7 Fig. 8 Fig. 9

Claims (1)

[Claims] An electronic dictionary comprising a user dictionary having an area for storing words registered by a user as numerical data using a Hash method and an area for storing the words as character data.