JPS60186959A - Control system for dictionary data - Google Patents

Abstract

PURPOSE:To update data at a high speed with dictionary data having plural retrieval keys. CONSTITUTION:When the 1st method of an input means 4 is used, input data is inputted to a specific area of a user storage area in the form of ''i*A,...''. At this time, the input data is inputted to a comparing means 3 through the output 43 of the input means 4 and a specific key of the input data is inputted to a dictionary storage retrieving meand 1 through the output 41 of the input means 4. The dictionary storage retrieving means 1 performs dictionary retrieval on the basis of the inputted specific key and when the retrieval is successful, the retrieved data is inputted to the comparing means 3 through the output 13 of the dictionary storage retrieving means 1. The comparing means 3 collates keys other than the specific key of the input data with keys other than the specific key of the retrieved data.

Description

[Detailed Description of the Invention] (Industrial Application Field) In addition to the normal dictionary data addition process, the present invention is useful when inputting dictionary data that has some dictionary contents in common with already registered dictionary data. , relates to a dictionary data management method that enables smooth and high-speed registration by using already registered dictionary data.

(Prior art and its problems) Conventionally, when adding dictionary data, if the data has already been registered, data duplication is avoided by overwriting the data in the same location.

Further, when inputting data that is known to have some common relationship with already registered data, additional processing is performed without using the registered data.

However, in the conventional method, although it is possible to avoid data duplication, it takes a corresponding amount of time to perform the writing process. Furthermore, since registered data is not used, it is necessary to input the entire contents of the dictionary data, resulting in a disadvantage that it takes time.

(Object of the Invention) An object of the present invention is to provide a dictionary data management method f that eliminates such conventional drawbacks and processes data updates at high speed.

(Structure of the Invention) According to the present invention, an input means for inputting dictionary data having a plurality of search keys into a predetermined storage area, a dictionary search is performed using a specific key of the dictionary data, and the searched dictionary data is retrieved. dictionary storage and retrieval means for displaying on a display screen and storing dictionary data; comparison means for comparing the dictionary data retrieved by the dictionary storage and retrieval means with keys other than the specific key; and spelling mistakes in input dictionary data. A dictionary data management system is obtained which includes a spelling bt space detection means for detecting spelling bt.

Further, according to the present invention, there is provided an input means for inputting dictionary data having a plurality of horizontal tree keys into a predetermined storage area, and storing the dictionary data and performing a dictionary search using a specific key of the dictionary data. dictionary storage and retrieval means for displaying and correcting dictionary data and storing the corrected dictionary data; and comparison means for comparing dictionary data that has been unsuccessfully searched by the dictionary storage and retrieval means with keys other than the specific key. , a dictionary data management system is obtained which is characterized by comprising a spelling error detection means for detecting spelling errors in input dictionary data.

(Example) Next, an example of the present invention will be explained with reference to the drawings.
, FIG. 1 is a block diagram of the dictionary data management system of the present invention. There are two methods for the input means 4. In other words, there are cases where it is known that dictionary data having content common to input dictionary data has been manually created, and cases where it is not.

Therefore, the first method is when you input all the multiple search keys of dictionary data when you do not know whether they have been input or not, and the second method is when you do not know if they have been input or not. This is a case where a specific key of registered dictionary data having some dictionary contents in common with the specific key is input when the key is known. According to the flowchart in Figure 2,
A second method is shown by chart 70 in FIG.

The flow of dictionary data management will be explained using Figures 1.2 and 3.4.

In the case of the first method of the input means 4, the input data is "1t-
A.

...into a predetermined area of the user storage area (not shown). At this time, the input data is input to the input means 4.
The specific key of the input data (for example, you can arbitrarily specify American as a specific key based on the contents of the input data) is sent to the comparison means 3 via the output 43 of the input means 4. The information is input to the dictionary storage and retrieval means 1 via.

The dictionary storage and search means 1 executes a dictionary search using the input specific key, and when the search is successful, that is, when data having the same specific key as the specific key exists, the dictionary storage and search means 1 performs a dictionary search using the input specific key. l output 13 through 17
is input. In FIG. 4, the comparison means 3 is not shown. The comparing means 3 compares a key other than the specific key of the input data with a key corresponding to the key other than the specific key of the data searched using the specific key.

If the matching is successful, if the input data matches the retrieved data, it is determined that the input data has already been registered, so the process ends without doing anything. However, if the collation is not successful, that is, if the contents of the input data and the retrieved data do not match, the input data is input to the dictionary storage and retrieval means 1 via the output 31 of the comparison means 3, and the Input data is registered without being corrected in a predetermined format. However, if the search using the specific key fails, the specific key is input to the misspelling detection means 2 via the output 12 of the dictionary storage and retrieval means 1, and misspellings in the input dictionary data are detected.

Therefore, the specific key is corrected, and the corrected specific key is again input to the dictionary storage and retrieval means 1 via the output 21 of the misspelling detection means 2 to perform the search again. Here, if a misspelling is not detected or if the search is not successful even after correction, the input data is registered by the dictionary storage and search means 1.

Next, in the case of the second method of input means, the input data is "b"
With the key C (specific key) 1, input is made to a predetermined area of the user's storage area (not shown). For example, “5peak”
When creating a dictionary for "talk", it is assumed that a dictionary for "talk" has already been input. At this time, the specific key (“C
'') That is, "talk" is input to the dictionary storage and retrieval means IK via the output 41.

In the dictionary storage means 1, the input specific key "talk"
A dictionary search is executed from K, and when it is successful, the searched data, that is, the dictionary data of "talk" is displayed on the display screen. Here, the specific key C
("talk") is converted and corrected to a newly created included specific key (Nideke% "5peak"), and the converted data is registered by the dictionary storage and retrieval means 1. However, if the search using the specific key fails, the misspelling detection means 2, as in the first method,
Although the misspelling is corrected, if the misspelling is not detected or the search is not successful even after correction, it is determined that the requested specific key has not been registered and the search fails. This example takes advantage of the fact that "5peak" and "(alk") have a common dictionary inscription.

Furthermore, even if there is no spelling error detection means, if a human does the work for you, you will not be able to sleep soundly.

If the classification of synonyms, etc. is stored in the database VCl, and the word to be registered is entered, the synonyms can be restored on the display, thereby saving the trouble of looking up the synonyms. Also, among misspellings, 11” AI%
By adding a means to replace and automatically correct frequent mistakes such as ``l '' r H5oon Htion when a dictionary search fails, it is possible to search faster.

(Effects of the Invention) As described above, the present dictionary data management method provides a method that can quickly update data in which some data self-answers have a common relationship with a simple means.

Whether the data has a fixed length or a variable length, deep sleep is performed in the same manner as described above. In one embodiment of the present invention, the dictionary storage and retrieval means 1 can be implemented as a B-1ree.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of the dictionary data management method of the present invention;
2 and 3 are overall flowcharts for each input child stage, and FIG. 4 is a 70-chart of the comparison means. In FIG. 1, the reference numeral 1 represents a dictionary storage and retrieval means, the reference numeral 2 represents a misspelling detection means, the reference numeral 3 represents a comparison means, the reference numeral 4 input means, and the reference numeral 12.
Reference numeral 13 represents the output of the dictionary storage and retrieval means, reference numerals 21 and 23 represent the misspelling detection means, reference numeral 31 represents the output of the comparison means, and reference numerals 41 and 43 represent the output of the input means, respectively. Figure 1 Figure 2 Figure 3

Claims (1)

[Scope of Claims] 1. An input means for inputting dictionary data having a plurality of search keys into a predetermined storage area; and an input means for storing the dictionary data, performing a dictionary search using a specific key of the dictionary data, and performing a dictionary search using a specific key of the dictionary data. a dictionary storage/retrieval means for displaying and correcting dictionary data and storing the corrected dictionary data; and a comparison means for comparing dictionary data not searched by the dictionary storage means with a key other than the specific key. A dictionary data management method characterized by: 2. Input means for inputting dictionary data having a plurality of search keys into a predetermined storage area, storing the dictionary data, performing a dictionary search using a specific key of the dictionary data, and displaying and correcting the searched dictionary data. a dictionary storage and retrieval means for storing the corrected dictionary data; a comparison means for comparing the dictionary data retrieved by the dictionary storage and retrieval means with a key other than the specific key; and a comparison means for checking spelling mistakes in the input dictionary data. A dictionary data management method comprising a spelling error detection means.