JPH0769916B2 - Kana-Kanji converter - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION (a) Field of Industrial Application The present invention is mainly used in an information processing apparatus having a kana-kanji conversion dictionary, such as a Japanese word processor, to input an input kana character string into kanji characters. The present invention relates to a kana-kanji conversion device for converting mixed sentences.

(B) Conventional technology In general, a word in Japanese may have a plurality of notations that are allowed depending on the way the sword is attached.
For example, in the case of the word "remember", there are sending of "reminder", "reminder", "memorandum", "reminder", etc.

In the conventional Kana-Kanji conversion device, for example, in order to input a word with a large number of feeds, such as the above-mentioned "Oregaraki", in a desired feed, all words with different feeds are registered in the Kana-Kanji conversion dictionary. Then, from there, select the desired word.

Only one notation for one word for one word is registered in the kana-kanji conversion dictionary, and after kana-kanji conversion, the desired notation is corrected.

The algorithm removes garbage. In other words, only the notation with all the syllabary is added to the dictionary, which is used as the first candidate for conversion, and the syllabary is deleted in order from that. For example, when there are four candidates for the syllabary, such as "Origakeki", such as "Reminder", "Reminder", "Memorandum", and "Reminder", the notation with the largest number of characters Is the first candidate, and the first candidate (remember) → second
Candidates (memorandum or memorandum) → Third candidates (memorandum) are used to automatically delete the syllabary. The method like this is used.

(C) Problem to be Solved by the Invention However, as described above, registering all the words with different feeds in the kana-kanji conversion dictionary causes a decrease in the number of registered words within a limited dictionary capacity. In addition, even if you have registered, there are "favorite" and "habit" in the way to attach the feed, and you must select the feed pattern that uses only one or two of them. On the contrary, the operation becomes complicated.

Further, as described above, when only one notation for the word is registered for one word, the notation must be corrected (addition or deletion of the notation) each time the word is read. It's inconvenient.

Further, as described above, when the feed is deleted by the algorithm, it is difficult to process the notation in the direction of adding the feed. For example, in the case of “remembering”, the first candidate is “ In the case of making a memorandum or a memorandum, there is a problem in that it is difficult to set the next candidate as the memorandum (additional processing of the invoice).

The present invention has been made in consideration of such a situation, and for a word in which plural notations exist in the sending,
The kana-kanji conversion dictionary is stored as a table separately from the kana-kanji conversion dictionary, and when the word is read, the kana-kana is changed based on the table to add or delete the kana-kana as in the past. It is intended to provide a kana-kanji conversion device that does not require correction operations such as.

(D) Means for Solving the Problems FIG. 1 is a block diagram showing the configuration of the present invention.

As shown in the figure, the present invention is a dictionary means 101 that stores a large number of words including Chinese characters together with their reading information, and a dictionary means 1
From the input means 104, an identification code 102 attached to a word having a plurality of types of syllabary for the word stored in 01, and a stub storage means 103 that stores a syllabary pattern of the word to which the identification code 102 is attached as a table. The reading means 105 for reading the word corresponding to the inputted reading information from the dictionary means 101, and the table stored in the feedless storage means 103 when the word read by the reading means 105 is attached with the identification code 102. A kana-kanji conversion device comprising a conversion means (106) for sequentially converting the notation of the word into the plurality of types of kana-kana notation based on the above, and a display means (107) for displaying the words of which the kana-kana notation has been converted by the conversion means 106. .

The dictionary means 101 in the present invention may be any one that can store a large number of words including Chinese characters together with its reading information, such as a ROM or a floppy disk device,
An external storage medium such as a magnetic disk device is used.

As the identification code 102, various codes such as identifiable numbers and symbols are used.

Further, as the feed means storage means 103, as long as it is possible to store the feed shape pattern of the word with the identification code 102 as a table, similar to the dictionary means 101, ROM,
Alternatively, an external storage medium such as a floppy disk device or a magnetic disk device is used.

The input unit 104 may be any device that can input a kana and kanji character string as kanji reading information, and for example, a keyboard, a tablet device, an OCR, a magnetic tape device, or the like is used.

Further, the reading means 105 may be any one that can read the word corresponding to the reading information input from the input means 104 from the dictionary means 101, and the conversion means 106 can be read by the reading means 105. When the identification code 102 is attached to the word to be written,
As long as it is possible to sequentially convert the notation of the word into a plurality of kinds of notation based on the table stored in, the reading means 105 and the converting means 106 are generally convenient to use a microprocessor. is there.

The display means 107 may be any one capable of displaying the word whose syllabary is converted by the conversion means 106, and a printer, a display device, a magnetic tape device, a magnetic disk device, or the like is used. A display device is suitable for quick confirmation.

(E) Action As shown in FIG. 1, according to the present invention, the input means 104
When the reading information is input from, the reading unit 105 reads the word corresponding to the reading information from the dictionary unit 101.

At this time, when the identification code 102 is attached to the word to be read, the conversion means 106 causes the unresponsive storage means 1
Based on the table stored in 03, the notation of the word is sequentially converted into a plurality of notation of notation and displayed by the display means 107.

Therefore, since the word forwarding is converted based on the table set in advance, there is no need to perform correction operations such as addition and deletion of the conventional forwarding, and only one word can be registered for words with different forwarding. Can be saved.

(F) Embodiment Hereinafter, the present invention will be described in detail based on an embodiment shown in the drawings. The present invention is not limited to this.

FIG. 2 is a configuration block diagram showing an embodiment of the present invention.

In this figure, 1 is a kana key or function key,
Further, it is a keyboard provided with a kana-kanji conversion key for instructing kana-kanji conversion, or an execution key for confirming the input content, and inputs the reading information of words by kana to the control unit 2.

The control unit 2 is composed of a microprocessor and performs various data processing described later according to a control program written in the program memory 3 including a ROM.

Reference numeral 4 is an input buffer for storing the reading information of the word by kana input from the keyboard 1.

Reference numeral 5 denotes a Kana-Kanji conversion dictionary consisting of a ROM, which has an independent word dictionary 6 in which a large number of words including Kanji are stored together with its reading information, a part-of-speech table 7 in which part-of-speech information is stored, and a kana-gana table 8 in which kana-gana information is stored. There is.

Among the words stored in the independent word dictionary 6, a word having plural kinds of swords (hereinafter referred to as a word with fluctuations in the swords. In particular, a change in the swords is simply referred to as a fluctuation).
Is attached with a non-sending number as will be described later.

In addition, in the feed-notch table 8, the feed-notice patterns for the words to which the feed-notice numbers in the independent word dictionary 6 are added are stored as a table.

Reference numeral 9 is a display device including a CRT display, an LC (liquid crystal) display, an EL display, or the like.

The control unit 2 stores the reading information of the word input from the keyboard 1, that is, the kana character string in the input buffer 4, and when the kana-kanji conversion is instructed to the kana character string, it corresponds to the kana character string. The word to be read is read from the independent word dictionary 6.

Then, when the read word is provided with an infeed number, the notation of the word is sequentially changed to a plurality of types of infeed based on the infeed table located at the pointer of the infeed table 8. It is converted and displayed on the display device 9.

FIG. 3 is an explanatory diagram showing the storage format of the independent word dictionary 6.

As shown in the figure, the independent word dictionary 6 has a word length of 10, a duplicate 11, a phonetic 12, a part of speech number 13, and a notation 14 for each word.
Is provided, and further, for a word with a fluctuation in the sword, the item with the sword number 15 is provided.

The word length 10 is the record length for one word, the duplication 11 is information that only the changed portion of the same notation is stored to avoid storing the duplicated portion of the word. , Hiragana notation as headings are stored respectively.

Further, the part-of-speech number 13 is where the information of the part-of-speech such as noun and verb is stored, but the part-of-speech information for each word is
It is separately stored in the part-of-speech table 7, and the part-of-speech number 13 stores a pointer (numerical value) in which record of the part-of-speech table 7 the part-of-speech information of the word is stored. The notation 14 stores the notation of words including Chinese characters.

These word length 10, duplicate 11, reading 12, phonetic part number 13,
The notation 14 is based on the structure of a conventionally known independent word dictionary.

As with the part-of-speech table 7 above,
Pointer (numerical value) in which record of the word feed table 8 the word feed pattern is stored
Is remembered.

Then, it is judged whether or not the insignificant number 15 is added to the word based on whether or not the part-of-speech number 13 exceeds a certain value. That is, by registering the part-of-speech information about a word with a fluctuation in the latter half of the part-of-speech table 7 and checking the part-of-speech number 13, it is possible to determine whether or not the unsuccessful fifteen number 15 is added to the word. I am trying.

FIG. 4 is an explanatory diagram showing the storage format of the forwarding table 8.

As shown in the figure, in the feed-off table 8, the feed-off patterns are arranged in the order of the feed-off numbers, that is, the first candidate, the second candidate,
The third candidate, ..., Candidate patterns for each word are stored. For example, if the feed number is n, it is the first candidate (11100000), the second candidate (10100000), and the third candidate (11110000).

The contents of this sagaana table correspond to the kanji notation in 1-byte units. For example, "Origaki"
In the case of the word having the sword-fixing pattern of the sword-fixing number n in FIG. 4, since the reading character data is (sense = 2) (e = 1) (writing = 1) (ki = 1) = 2111, In this 4-digit notation, as shown in FIG.
One bit is allocated from the beginning. Then, as shown in FIG. 6, only the notation in which the bit is “1 (on)” is extracted.

With such a processing method, if the word forwarding of the selected word is stored in the learning buffer once, it will be written in the desired forwarding with the single conversion from the second time. Can be obtained.

In this way, FIG. 4 shows a table of feed patterns as 1-byte information.

FIG. 7 is an explanatory diagram showing an example in which the kana-kanji conversion of the kana-kana pattern shown by the 1-byte information in FIG. 4 is actually performed.

As shown in the figure, in the case of the above-mentioned “reminder”, which is the feed pattern indicated by the feed number n in FIG. 4, the first candidate (memo) → the second candidate (memo) → the third Candidates (notes) → 4th candidate (memorandum) → 5th candidate (remembering) → 6th candidate (Oboegaki) are sequentially converted.

In this way, for example, in the case of "Origaki", the pattern of the feed is
If you convert it into bits with the information of "1 (on)" and "0 (off)" and enter it as "Oregaraki" and convert it into kana-kanji, the reading data of the first four characters is read. The bit of the feed pattern corresponding to is "1 (on)"
Only the notation characters are extracted.

Of these conversions, for the fifth and sixth candidates, the first character of the word is usually not deleted, so
Using this, if the beginning is "0 (off)", that is, if it is a deletion bit, all readings of that word are flat,
Or, it is an example in which it is written in katakana.

If there are no more than 255 types of feed patterns,
The feed number is 1-byte information, the feed pattern information has a fixed length, and the feed pattern type is
If there are 256 types or more, the feed number is 2-byte address information, and the feed pattern information is variable length data that is an integral multiple of 1 byte.

Further, the 1-byte information of the sending pattern shown in FIG. 7 is an example, and for example, in the case of "remember", "1 (on)" and "0" are set for the first 4 bits.
FIG. 8 shows an example in that case, which is the reverse of "(OFF)".

Next, the contents of the processing operation of the control unit 2 will be described with reference to the flowcharts shown in FIGS. 9 and 10.

FIG. 9 is a flowchart showing the processing contents when kana-kanji conversion is performed.

When Kana-Kanji conversion is performed, first use the keyboard 1
When a character string is input from (step 201) and the character string is stored in the input buffer 4 and then kana-kanji conversion is instructed (step 202), the control unit 2 determines whether there is a homonym. Then, if there are homonyms (step 203), homonyms are extracted and displayed on the display device 9 (step 204), and those are selected (step 205).

Next, the part-of-speech number 13 in the independent word dictionary 6 is searched to determine whether or not there is fluctuation in the sending (step 20).
6) If there are fluctuations in the feed, fluctuations in the feed are extracted and displayed on the display device 9 (step 20).
7), those choices are made (step 208).

If the character string is input again, step 201
If no character string is input, the kana-kanji conversion processing ends (step 209).

FIG. 10 is a detailed flowchart for the case where the fluctuating Fana-gana shown in FIG. 9 is extracted.

In the case where the sword-feeding fluctuation is extracted, it is first determined whether or not the sword-feeding number is added in the independent word dictionary 6 (step 301). The feed-off table 8 is referred to (step 302), and the feed-off table 8 is searched for information on the corresponding feed-off pattern (step 303).

Then, based on the 1-byte information of the kana character pattern corresponding to the kanji notation, the kana character is created and output (step 304).

In this way, only the words to which the phonetic numbers are added to the independent word dictionary 6 are registered in advance in the phonetic table 8 and the phonetic words of the words are converted based on the table. It is possible to write a word with a desired sword without increasing the number of registered words of 6.

(G) Effect of the Invention According to the present invention, for a word having a plurality of types of syllabary, the patterns of the syllabary are stored as a table separately from the dictionary means, and when the word is read, the table is stored. Based on this, the notation of that word is converted to the notation of multiple types of syllabary, which eliminates the need for correction operations such as the addition and deletion of conventional syllabary, and registers words with multiple types of syllabary. Since only one word is required, the dictionary capacity can be saved.

Further, in the case of the candidate rank of the notation of “Sentana”, for example, in the case of “memorize”, the first candidate (memo) → the second candidate (memo) → the third candidate (memo) → the fourth candidate (memo) )
Since it can be set arbitrarily as in the above, not only the processing of deleting the syllabary such as deleting the syllabary with the conventional algorithm, but the addition of the syllabary for each word,
And the deletion process becomes possible.

[Brief description of drawings]

FIG. 1 is a block diagram showing the configuration of the present invention, FIG. 2 is a configuration block diagram showing an embodiment of the present invention, FIG. 3 is an explanatory diagram showing the storage format of the independent word dictionary 6, and FIG. FIG. 5 is an explanatory diagram showing a storage format of the table 8, FIG. 5 is an explanatory diagram showing an example of allocating bites of a feed, FIG. 6 is an explanatory diagram showing an example of extracting bits of a feed, and FIG. FIG. 8 is an explanatory diagram showing an example in the case where kana-kanji conversion is performed, FIG. 8 is a diagram corresponding to FIG. 7 showing the case where the bit pattern is reversed, and FIGS. 9 and 10 are flowcharts showing the operation of the embodiment. 1 ... keyboard, 2 ... control unit, 3 ... program memory, 4 ... input buffer, 5 ... Kana-Kanji conversion dictionary,
6 ... independent word dictionary, 7 ... part-of-speech table, 8 ... sendable table, 9 ... display device.

Claims (1)

[Claims] 1. A dictionary means which stores a large number of words including Chinese characters together with its reading information, and stores a plurality of kinds of words with an identifying code by storing an identifying code, and a dictionary means for storing the identifying code and the plurality of kinds of words. Furagana storage means for storing each pattern of furagana as a table, reading means for reading words corresponding to reading information input from the input means from the dictionary means, and the identification code for the words read by the reading means. When the symbol is attached, a conversion unit that sequentially converts the notation of the word into the plural types of notation based on the table, and a display unit that displays the word in which the notation of notation is converted by the conversion unit A kana-kanji conversion device characterized by this.