JPH02257257A - Managing system for dictionary data for kana to kanji capable of associative storage - Google Patents

Abstract

PURPOSE:To obtain information (an antonym, a synonym, a polite word, etc.) associated from a converted arbitrary word and to make a word processor function intellectual by adding an associative storage list to dictionary data for a KANA (Japanese syllabary) to KANJI (Chinese character) conversion. CONSTITUTION:In the case when there are plural words of its reading with respect to some input KANA (Japanese syllabary) data, it is generated as one word information record. Each word record 3 contained therein is generated from length 4 of a word, a word substance, converting information (information of a part of speech, an inflection classification, etc.) 6 of its word, and an associative storage list 7. The associative storage list 7 is constituted of a repetition of data in which an associative information classification, the number of words corresponding to its associative information, and a point to each associative word are collected to one, and in the case when there is the associative information, only necessary information is registered in the associative storage list 7. In such a way, the associative information is obtained, and a word processor can be made intellectual.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a data management method for dictionary data for kana-kanji conversion.

[Prior Art] Conventionally, dictionary data for kana-kanji conversion has consisted of human-generated kana data, words with their pronunciations, and conversion information for the words (information on parts of speech, conjugation types, etc.).

[Problems to be Solved by the Invention] However, the conventional dictionary data management method described above has a data structure that combines input kana data and its corresponding kanji representation, so a kana-kanji conversion function that utilizes this data structure is required. was simply a display and selection of kanji expressions with that reading based on human-generated kana data.

[Means for Solving the Problems] That is, the dictionary data management method of the present invention uses data indicating individual kanji expressions in conventional dictionary data as an associative memory list. , polite language, etc.) is characterized by having information indicating a certain word.

[Example] Embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is an embodiment of the present invention, and shows the data structure of dictionary data created using an associative memory system.

If there are multiple words with the same pronunciation for certain input kana data, they are created as one word information record. Each word record is created from the word length, word entity, conversion information for the word (part of speech, conjugation type, etc.) and an associative memory list. The associative memory list is composed of repeating data in which a type of associative information and a pointer to each associative word corresponding to the associative information is one group. In the associative memory list, only necessary information is registered when there is associative information.

FIG. 2 is an example of a list showing types of association information.

Define such a − list in the kana-kanji conversion function,
Allows you to display and select related information during kana-kanji conversion.

FIGS. 3 and 4 are specific examples of word records in which association information is stored. Figure 3 shows the registered antonyms for the word ``Natural°''.

In the word record, first, the length of the word, the expression of the word, and the conversion information are arranged. This is followed by an associative memory list. In this example, two opposite words are registered for "nature": "population" and "man-made". The example in FIG. 4 is a synonym that is registered for the word "matchmaker." In this example, “Matchmaker °
``A matchmaker.

Three synonyms have been registered: “Geksukabijin” and “Mizuiri”. A plurality of pieces of association information can be registered for one word.

FIG. 5 is an embodiment of a kana-kanji conversion function having a dictionary having the data structure shown in FIG. 1, and is a flowchart of the operation for outputting association information.

Conventional kana-kanji conversion processing was performed in the following manner. The user of the kana-kanji conversion function first inputs the kana code from the input device (S11). Thereafter, using a conversion key, the kana code is converted into a word expressed in kanji (S12). Then, the word pattern complement to be converted is displayed on the screen (813). Then, the user selects a word from the displayed conversion target word candidates (S14) L
, this word is determined as a conversion target (S16). Once the converted word is determined, the process returns to the next input step (811) and repeats the process.

Here, we will show the flow of using an associative memory list to enable the display and selection of associative information in the process of kana-kanji conversion processing. The associative memory list is stored in the word record, and when a word is selected from the conversion target word candidates (S14), the presence or absence of associative information for that word is checked (S15). If there is no association information, processing is performed in exactly the same flow as conventional kana-kanji conversion processing. If there is associative information, the type of associative information registered for that word is displayed on the screen (S゛17), and the user can obtain the associative information by following the instructions provided by the kana-kanji conversion function. . If the user does not need associative information, there is no need to select these instructions, and in that case, the process is the same as conventional kana-kanji conversion.

If the user wants to obtain any information in the associative information, he selects the type he wants to display (types of antonyms, synonyms, etc.) from the displayed associative information types (S17) (318).
. Then, word information corresponding to the selected type is displayed (S19). The user can select a necessary word from among these (S20) and determine the word in the same way as the conversion word (S21). When the user completes the process by simply referring to the related word, the first input (S
11) Step of selecting words by directly converting data (S1
Return to 4).

[Effects of the Invention] As explained above, the present invention adds an associative memory list to the dictionary data for kana-kanji conversion, thereby adding information associated with any converted word (opposite words, synonyms, polite words, etc.). ). This makes it possible to make the word processor function more intelligent.

[Brief explanation of drawings]

Fig. 1 shows an example of a dictionary data structure using the associative memory list of the present invention, Fig. 2 shows an example of a list showing the types of associative information, and Fig. 3 shows an example of a word record with an associative list (“natural Figure 4 is an example of a 111-word record with an association list (a synonym for matchmaker), Figure 5 is the same as Figure 1, but uses the Kana-Kanji conversion function that has a dictionary with a data structure. A flowchart of the operation when

Claims (1)

[Claims] 1) In each word data in the dictionary used for the kana-kanji conversion function used for Japanese data input, information that identifies words with meanings related to that word is stored, and when converting to kanji, related information is stored. A dictionary data management method for kana-kanji conversion that allows you to display and select words.