JPH1021231A - Japanese syllabary-chinese character conversion device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide the KANA (Japanese syllabary)-KANJI (Chinese character) conversion device which can generate a rule dictionary of smaller size with less trouble and can perform accurate KANA-KANJI conversion. SOLUTION: When an item has reading partial matching information (S46: YES) during a rule rewriting process, a KANA-KANJI converting process is performed first (S52) so that the matching part is rewritten with a described word (S50) and the reading of the remaining part is connected gramatically to the rewritten word. Here, when the conversion into the word which is connected grammatically can be done (S54: YES), the remaining part is rewritten with the word (S56). When not (S54: NO), on the other hand, a copied conversion result is put back in a conversion result storage area 22 (S58) and the process is ended.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a kana-kanji conversion device such as a Japanese word processor.

[0002]

2. Description of the Related Art Conventionally, a kana-kanji conversion apparatus of this kind has been disclosed in Japanese Patent Application Laid-Open No. 3-142658.
Performs Kana-Kanji conversion based on a basic dictionary that stores notations such as Kanji for reading words, stores the Kana-Kanji conversion results in a conversion result storage unit, and stores a pattern of a plurality of word strings and its rewriting information as a set. The rules stored as rules are used as a rule dictionary, and when a rule that matches a rule in the rule dictionary is searched, the contents of the kana-kanji conversion result are rewritten and displayed on a display device.
Such a series of actions was called rule conversion.

[0003] For example, when "tegami kakaku" is input, in the normal kana-kanji conversion, "each letter" may be output as a conversion result. If this uses rule conversion, then <U-letter: N><U-:N> in the rule dictionary
If a pattern of <D- or: letter><UP-line 5th row: N> is stored, this rule works to write the "each" part of "each letter". To obtain a correct conversion result of "writing a letter".

[0004]

However, for example, the rule item <UP-K5th-row: N> in the above rule represents all the inflected endings of the 5-row-verb verb. Although correct conversion results can be obtained in response to inflections such as "let's write" and "written", in practice, each of the inflected endings is stored internally as data. Therefore, there is a problem that it takes more time and effort to create a rule and a rule dictionary becomes larger in size than a rule based on a combination of other words alone.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems, and an object of the present invention is to provide a kana-kanji conversion apparatus which can create a rule dictionary having a smaller size with less labor and can perform kana-kanji conversion accurately. With the goal.

[0006]

In order to achieve this object, a kana-kanji conversion device according to claim 1 of the present invention comprises input means for inputting a kana reading character string and at least a notation for reading a word. Based on the stored basic dictionary, based on the basic dictionary, kana-kanji conversion means for performing kana-kanji conversion of the kana reading character string input from the input means, and conversion result storage means for storing a conversion result by the kana-kanji conversion means, A rule dictionary storing a rule having a pattern composed of a combination of a plurality of words of information such as word reading and notation stored in the basic dictionary and rewriting information for rewriting word notation in the pattern Rule search means for searching the rule dictionary for a rule having a pattern that matches the conversion result stored in the conversion result storage means; A rule rewriting means for rewriting the conversion result in accordance with rewriting information of the rule when a rule having a pattern matched by the rule retrieving means is searched. The rule rewriting means rewrites the conversion result stored in the conversion result storage means based on the reading partial match information, and reads and rewrites the conversion result. Re-conversion processing is performed so that the kana-reading character string after the character string is grammatically connected to the end of the rewritten character string.

Therefore, by describing only a part of the reading of a word in the rule dictionary and providing the partial reading matching information, rule conversion can be performed for all of the endings of the verbs, so that the time and effort for creating a rule dictionary can be reduced. , It is possible to reduce the size.

Further, in the kana-kanji conversion device according to the second aspect, the reading part matching information indicates that the stem part of the declinable word matches. Therefore, it is possible to perform rule conversion for all of the endings of the idiom, thereby reducing the time and effort for creating a rule dictionary and reducing the size.

According to a third aspect of the present invention, in the kana-kanji conversion device, the rule rewriting means performs the re-conversion processing by:
If the kana reading character string after the rewritten character string cannot be converted so as to be grammatically connected to the end of the rewritten character string, the rewriting is stopped. Therefore, the meaningless character string is less likely to be rewritten by the rule rewriting means, and more accurate Kana-Kanji conversion can be performed.

[0010]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of a kana-kanji conversion device according to the present invention will be described below with reference to the drawings.

FIG. 1 is a block diagram showing a schematic configuration of a kana-kanji conversion device.

As shown in FIG. 1, a kana-kanji conversion apparatus according to the present embodiment has an input device 10 including a keyboard for inputting a character string for kana-kanji conversion and for performing various instructions such as conversion and confirmation. And an output device 70 for displaying a character string or the like input from the input device 10 is connected to a central processing unit (CPU) 12 for controlling the entire device.

The RAM 20 is connected to the CPU 12, and stores a conversion result storage area 22 for storing a result of the Kana-Kanji conversion, a reading input buffer area 24 for storing an input Kana reading character string, and a storage for the conversion result. An output buffer area 26 for storing the contents of the area 22 as a Kana-Kanji character string, and a work area 28 for storing pointer information, flag information, and the like. The input device 10 constitutes the input means of the present invention, and the conversion result storage area 22 constitutes the conversion result storage means of the present invention.

The conversion result storage area 22 stores an input kana reading character string in a basic dictionary 62 and a connection table 6 described later.
The result of the Kana-Kanji conversion using No. 4 is stored with information attached in word units, and this content is further referred to and updated at the time of rule conversion.

The ROM 40 is connected to the CPU 12 and includes a program section 42 for storing various programs and a dictionary section 60 for storing a plurality of dictionaries. The program section 42 stores a kana-kanji conversion program 44, a rule search program 46, and a rule rewriting program 48.

The processing performed by the rule search program 46 and the rule rewriting program 48 is called rule conversion processing.

The kana-kanji conversion program 44
Constitute the kana-kanji conversion means of the present invention, and the rule search program 46 constitutes the rule search means. Also,
The rule rewriting program 48 constitutes a rule rewriting means of the present invention.

The dictionary section 60 stores a basic dictionary 62, a connection table 64, and a rule dictionary 66.

The basic dictionary 62 stores reading of each word, kanji notation of the word, part of speech information, and meaning code information indicating a category to which the word belongs.

The connection table 64 stores data for determining whether or not there is a connection relationship between words based on part of speech information. For example, information that nouns and case particles can be connected and information that verbs and case particles cannot be connected are stored as table data.

As shown in FIG. 2, the rule dictionary 66 stores a set of rule items 66a to 66c as one rule. Generally, rule items are written in the form of <search factor-word pattern: rewrite information>, and a structure is such that one rule pattern is created by combining these items.

The search factors indicate the types of methods in which the conversion result matches the rule, and include the U factor, D factor, M factor,
And the Y factor. The U factor is stored in the conversion result storage area 22.
Means a perfect match with the reading and notation of the word stored in the word, and the D factor means a reading of the word stored in the conversion result storage area 22, that is, matching the word with the same sound. I have. Further, the M factor means that the words match in the meaning code of the word stored in the conversion result storage area 22. Further, the Y factor, which is a feature of the present embodiment, means that it matches a part of the reading of the word stored in the conversion result storage area 22, and at the same time, replaces the remaining part of the reading with the Kana-Kanji character during the rewriting process. This means that the data is rewritten by conversion. This Y factor constitutes the read partial match information of the present invention.

A word pattern indicates a word whose rule is to be matched with a word in the conversion result storage area 22. Here, any one of word reading, notation, and meaning code is used.
One enters.

The rewriting information is one of a non-change marker N, a deletion marker D, a word string, and a meaning code. When the non-change marker N is stored, the conversion result storage corresponding to the item of the rule dictionary 66 is stored. This indicates that the word in the area 22 is left as it is and is not rewritten. Also, delete marker D
Indicates that the item is to be deleted. Further, when there is a word string as the rewriting information, it indicates that the word in the conversion result storage area 22 that matches the item of the rule dictionary 66 is to be rewritten to the word string. In the word stored in the word "H" means that the word has the meaning code. Note that the word string referred to here is a plurality of words (only one word may be stored) stored in the rule dictionary 66. Actually, address information or the like for indicating a word in the basic dictionary 62 is stored. It is set and used by referring to the basic dictionary 62 based on this address information. In FIG. 2, words are read or represented by notation so that the internal structure of the rule dictionary 66 can be easily understood.

Next, the Kana-Kanji conversion processing by the Kana-Kanji conversion apparatus configured as described above will be described with reference to the flowchart shown in FIG. It is assumed that the storage status of the rule dictionary 66 is as shown in FIG.

A key input from the input device 10 is received (S10), and it is determined whether or not the input is a reading character string (S12).
2: YES), the kana character code is stored in the reading input buffer area 24 in the RAM 20 (S14). For example, when the reading character string “Karihae Kakiha” has been input, the kana character code is stored in the reading input buffer area 24. If the input is not a reading character string (S
12: NO), it is determined whether the key is a conversion key for instructing conversion (S16), and if it is not a conversion key (S1).
6: NO), other processing is performed (S18).

If the input key is a conversion key (S1)
6: YES), the kana-kanji conversion is performed, and the kana-character code stored in the reading input buffer area 24 is converted into a kanji-kana mixed sentence by the kana-kanji conversion program 44 in the ROM 40 based on the basic dictionary 62 and the connection table 64. Then, each word is stored in the conversion result storage area 22 (S20).

For example, when ordinary kana-kanji conversion is performed based on the basic dictionary 62, the above-mentioned read character string may be converted into a sentence "kana kana-kane" below, which is a mixture of kanji and kana.
Then, the words “he”, “ha”, “picture”, “wo”, “below”, and “below” are stored in the conversion result storage area 22.

Next, the rule search program 4 in the ROM 40
According to 6, a search process is performed to determine whether or not a rule having a combination of word patterns matching the combination of words in the conversion result storage area 22 exists in the rule dictionary 66 (S22). It should be noted that if a rule item having partial reading matching information in a rule matches a part of the reading of a word in the conversion result storage area 22, it is determined that a word match has been established.

For example, the word “below” in the above-mentioned conversion result storage area 22 is a rule item 66 having partial reading matching information.
A match is established with <Y-?: draw> of c, that is, rule 6
6a to 66c match the combination of words in the conversion result storage area 22.

If there is no rule that matches the combination of words in the conversion result storage area 22 (S24: N
O), the rule conversion processing ends, and the contents of the conversion result storage area 22 are stored in the output buffer area 26 as they are and displayed on the output device 70 (S28).

If a matching rule exists in the rule dictionary 66 (S24: YES), the rule rewriting program 48 of the ROM 40 matches the combination of the rule word pattern in the words in the conversion result storage area 22 with the rule. A process of rewriting the combined word portion according to the rewriting information of the rule is performed (S26).

Here, the details of the rule rewriting process will be described with reference to the flowchart of FIG.

In the rule rewriting process, a copy of the conversion result in the conversion result storage area 22 is first made (S40).
Thereafter, it is sequentially searched whether or not the rewritten word item exists in the rules in the rule dictionary 66 searched by the rule search process (S42). If there is no rewritten word item up to the end of the target rule (S44: NO, S60: YES),
The process ends. If a rewrite word item exists in the target rule (S44: YES), it is further determined whether or not the item has reading partial match information (S4).
6). If the item does not have the reading partial match information (S46: NO), the conventional rewriting is performed in which the word in the conversion result storage area 22 corresponding to the word position is rewritten by the specified word. Perform processing (S
48). If the item has the reading partial matching information (S46: YES), first, the matching part is rewritten with the written word (S50), and the reading of the remaining part is changed to the rewritten word. A kana-kanji conversion process is performed so as to connect grammatically (S52). Here, if it can be converted into a word string that grammatically connects (S
54: YES), the remaining part is rewritten with the word (S56). If the word string cannot be converted into a grammatically connected word string (S54: NO), the rewriting process is canceled and the process ends. That is, the copied conversion result is returned to the conversion result storage area 22 (S58), and the process ends. The above rule rewriting process functions as the rule rewriting means of the present invention.

For example, as described above, "he", "ha", "picture", "wo", "below", and "immediately below" in the conversion result storage area 22 are stored in the rule dictionary 66 by the rule search processing.
This matches the combination of the word patterns of the rules a to 66c. Then, the rule items are sequentially confirmed by the rule rewriting process, and it is found that the rule item 66c has the reading partial matching information. Here, from the rule item 66c, first,
The word "below" is rewritten to "drawing", and the remaining reading "is" is converted to kana-kanji so that it is grammatically connected to "drawing". Then, it can be converted into a combination of the words "ki" (five-step endings), "masashi (auxiliary verb)", and "ta (particle)", so the "underneath" part is rewritten by these words. .

As a result, the words in the conversion result storage area 22 are "he", "ha", "picture", "wo", "draw", "ki" and "masashi".
An appropriate conversion result of "ta" is obtained.

As described above, in the rule pattern in the rule dictionary, only the stem portion of the declinable word is described as a rule item, and rule conversion corresponding to a wide range of inflections can be performed. A rule dictionary can be created.

Further, for example, when a reading "Karenoe Kaitei Niwa ni Koiwai" is input and converted to Kana-Kanji, it is converted to a sentence "Kanji Kana-Kana-Kana" to "Send his picture for opening celebration." There is. This is because, as in the example described above, 66a to 66c in the rule dictionary 66 by the rule search process.
Matches the word pattern combination of the rule. Therefore, the rewriting is performed by the rule rewriting process. According to the rule item 66c having the reading partial matching information, the “opening store” is rewritten to “drawing”, and the remaining reading character string “teiwanai ni kuru” is written. Kana-Kanji conversion is performed so that it is grammatically connected to "Draw". However, after all, it is impossible to convert Kana-Kanji characters so that the rest of the reading character string "Issue Ito Nikkoru" is grammatically connected to "Draw".
The rule rewriting process is canceled.

As described above, when the conversion result during grammatical connection cannot be obtained by the reconversion during the rule rewriting process, the rule rewriting process is canceled, so that the meaningless character string rewriting due to the rule conversion does not easily occur. Become.

By the above processing, the rule rewriting processing (S2
6) is completed, the process returns to S28 in FIG. 3, and the contents of the conversion result storage area 22 are stored in the output buffer area 26 and displayed on the output device 70 (S28).

Thereafter, an instruction by a key input from the user is received (S30), and if the input key is an instruction for confirmation (S32: YES), confirmation processing is performed (S3).
4) The kana-kanji conversion process ends. If the input key is not an instruction to confirm (S32: NO), other processing such as next candidate conversion is performed (S36).

The present invention is not limited to the embodiment described in detail above, and various changes can be made without departing from the gist of the present invention.

For example, in the above-described embodiment, an example has been described in which the stem portion of a declinable word is stored as the reading part matching information. However, a part of a noun such as a family name may be stored. In this case, for example, with respect to the first and last names, titles such as "kun" and "san" are grammatically connected words.

[0044]

As is apparent from the above description,
A kana-kanji conversion device according to claim 1 of the present invention, comprising: an input unit for inputting a kana reading character string; a basic dictionary storing at least a notation for reading a word; and the input unit based on the basic dictionary. A kana-kanji conversion means for performing kana-kanji conversion of the input kana-reading character string, a conversion result storage means for storing a conversion result by the kana-kanji conversion means, and information of information such as word reading and notation stored in the basic dictionary. A rule dictionary storing a rule having a pattern composed of a combination of a plurality of words and rewriting information for rewriting the notation of a word in the pattern, and matching with the conversion result stored in the conversion result storage means Rule searching means for searching a rule having a pattern to be searched from the rule dictionary, and a rule having a pattern matched by the rule searching means. Rule rewriting means for rewriting the conversion result in accordance with the rewriting information of the rule, the rule dictionary reads the partial reading matching information indicating that a part of the reading of the word matches. The rule rewriting means rewrites the conversion result stored by the conversion result storage means based on the read partial match information, and converts the kana reading character string after the rewritten character string into the rewritten character string. Performs re-conversion processing so that it is grammatically connected to the end of the string.

Therefore, by describing only a part of the word reading in the rule dictionary and providing the reading part matching information, the rule conversion can be performed for all the endings of the lexical words. , It is possible to reduce the size.

Further, in the kana-kanji conversion device according to the second aspect, the reading part matching information indicates that the stem portion of the declinable word matches. Therefore, it is possible to perform rule conversion for all of the endings of the idiom, thereby reducing the time and effort for creating a rule dictionary and reducing the size.

According to a third aspect of the present invention, in the kana-kanji conversion apparatus, the rule rewriting means performs the re-conversion processing by:
If the kana reading character string after the rewritten character string cannot be converted so as to be grammatically connected to the end of the rewritten character string, the rewriting is stopped. Therefore, the meaningless character string is less likely to be rewritten by the rule rewriting means, and more accurate Kana-Kanji conversion can be performed.

[Brief description of the drawings]

FIG. 1 is a block diagram illustrating a schematic configuration of a kana-kanji conversion device according to an embodiment.

FIG. 2 is a schematic diagram showing stored contents of a rule dictionary.

FIG. 3 is a flowchart showing an operation of the kana-kanji conversion device of the embodiment.

FIG. 4 is a flowchart illustrating a rule rewriting process according to the embodiment.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 Input device 12 CPU 20 RAM 22 Conversion result storage area 24 Reading input buffer area 26 Output buffer area 28 Work area 40 ROM 42 Program part 44 Kana-Kanji conversion program 46 Rule search program 48 Rule rewriting program 60 Dictionary part 62 Basic dictionary 64 Connection table 66 rule dictionary 70 output device

Claims (3)

[Claims] An input unit for inputting a kana reading character string; a basic dictionary storing at least a notation for reading a word; and a kana reading character string input from the input unit based on the basic dictionary. Kana-Kanji conversion means for performing Kana-Kanji conversion, conversion result storage means for storing the conversion result of the Kana-Kanji conversion means, and a pattern comprising a combination of a plurality of words of information such as word reading and notation stored in the basic dictionary When,
A rule dictionary storing rules having rewriting information for rewriting the word notation in the pattern, and a rule having a pattern matching the conversion result stored in the conversion result storage means, A kana-kanji conversion device comprising: a rule search means to be searched; and a rule rewriting means for rewriting the conversion result according to rewriting information of the rule when the rule having the matched pattern is searched by the rule search means. The rule dictionary stores reading partial match information indicating that a part of the word reading matches, and the rule rewriting means stores the conversion result stored by the conversion result storage means based on the reading partial match information. Perform rewriting, and grammatically correctly connect the kana reading character string after the rewritten character string to the end of the rewritten character string. Kana-kanji conversion apparatus characterized by performing a re-conversion process. 2. The kana-kanji conversion device according to claim 1, wherein the reading partial matching information indicates that the stem portion of the declinable word matches. 3. The rule rewriting means cannot perform conversion by the re-conversion processing so that a kana reading character string subsequent to the rewritten character string is grammatically connected to the end of the rewritten character string. The kana-kanji conversion device according to claim 1, wherein the rewriting is stopped when the kana-kanji conversion is performed.