JPH0573539A - Kana/kanji conversion device - Google Patents

Abstract

(57) [Abstract] [Purpose] To improve the conversion efficiency of the Kana-Kanji conversion device. According to the kana-kanji conversion device of the present invention, as shown in FIG. 2, a kana-reading character string is input from an input device, and a kana-kanji conversion program for kana-kanji conversion stores a basic dictionary storing expressions for word reading, and Kanji conversion is performed by referring to the word order storage area for storing the priority order of words in the dictionary. The rule search program searches for a rule dictionary that stores patterns of a plurality of word strings in the basic dictionary and rules having rewriting information thereof, and a content of the conversion result storage means that matches a rule in the rule dictionary. The rule rewriting program rewrites the contents of the corresponding conversion result storage means when a matching rule is retrieved. The output means outputs the contents of the conversion result storage means as a kana-kanji character string. Then, the learning processing program changes the contents of the word order storage means.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a kana-kanji conversion device such as a Japanese word processor.

[0002]

2. Description of the Related Art Conventionally, in this type of kana-kanji conversion device, kana-kanji conversion is performed by referring to a basic dictionary storing notations such as kanji for reading a word, as disclosed in Japanese Patent Laid-Open No. 3-142658. The kana-kanji conversion result is stored in the conversion result storage unit, and a pattern in which a plurality of word string patterns and their rewriting information are stored as a set of rules is provided as a rule dictionary, and the rules in the rule dictionary are matched. It has been known that the contents of the Kana-Kanji conversion result are rewritten and displayed on a display device when a rule is searched. Moreover, such a series of actions was called rule conversion.

For example, when inputting "make a chopstick", when kana-kanji conversion is performed by referring to the basic dictionary, "end", "bridge", and "chopsticks" are stored in this order in the basic dictionary. In this case, the first candidate “edge” is output and the incorrect conversion “make an edge” is displayed. Then, the conversion result of "making an edge" is stored in the conversion result storage unit.

Next, when the rule conversion is performed by referring to the rule dictionary, <D-chopsticks: chopsticks><U-:N> in the rule dictionary.
If the pattern <D-Tsuku: Saku><U-Ru:N> is stored, the “D” factor indicates a match in reading, so that the “Make an edge” stored in the conversion result storage unit. The "edge" part was rewritten as "chopsticks" and the correct conversion result of "making chopsticks" was output.

However, when it is desired to convert "building a bridge" into "building a bridge", after converting the rules, "make" is made into "bridge" from "chopsticks".
Had to be reconverted to. To solve this,
In response to the reading "make a chopstick", <
U-Chopsticks: N><U-:N><D- Tsuku: Work><U-
It is also conceivable to register two types of rules: R: N> and <U-bridge: N><U-:N><D-Tsuku:Zukuri><U-ru:N>. In this case, since the rules are for the same reading, in order to distinguish the rules to be applied, the first item of both rules is "U" which means a perfect match with the reading and the notation.
There was a factor.

[0006]

However, when performing the rule conversion process, when the user wants to output the character string "make chopsticks", "end" in the basic dictionary,
If "bridge" and "chopsticks" are stored in this order, "create the edge"
<U-chopsticks: N><U-:: N in the rule dictionary
><D-Tsuku:Saku><U-ru:N> and <U-Bridge: N>
Even if there are two types of rules, <U-: N><D- Tsuku: Zukuri><U-ru:N>, neither rule is applied and the rule conversion process is not performed, which is not desired by the user. The character string "create the edge" was output as is. Therefore, in order to convert as desired, the user can re-convert the "end" part into the kanji "chopsticks" or "create".
The part of was converted to "make" again.

Furthermore, even when the same character string "make chopsticks" is to be repeatedly used, the order of the kanji in the basic dictionary does not change, so that it is converted to "create an end" and is not subjected to rule conversion processing. The same reconversion work as described above had to be repeated.

The present invention has been made in order to solve the above-mentioned problems, and after performing rule conversion using a rule dictionary, a conversion result suited to the user's preference is provided, so that the user can change the preference once. It is an object of the present invention to provide a kana-kanji conversion device that can eliminate the troublesome operation of selecting the same kanji when repeatedly converting the same character string after selecting the existing kanji.

[0009]

In order to solve this problem, a kana-kanji conversion device of the present invention, as shown in FIG. 1, has an input means for inputting a kana-reading character string and a notation for word reading. The stored basic dictionary, the word order storage means for storing the priority order of the words in the basic dictionary, the kana-kanji conversion means for kana-kanji conversion by referring to the basic dictionary and the word order storage means, and the basic dictionary A rule dictionary storing a rule having patterns of a plurality of word strings and its rewriting information, and a rule searching means for searching a content of the conversion result storing means that matches a rule in the rule dictionary,
When a matching rule is retrieved, the rule rewriting unit that rewrites the contents of the corresponding conversion result storage unit, the output unit that outputs the contents of the conversion result storage unit as a Kana-Kanji character string, and the output result Learning processing means for changing the contents of the word order storage means.

[0010]

In the kana-kanji conversion device of the present invention having the above-mentioned structure, the kana-reading character string is input from the input means, and the kana-kanji conversion means stores a basic dictionary having word reading and corresponding notation and word-order storage. The kana-kanji conversion is performed by referring to the order of words stored in the means. After that, the result of the kana-kanji conversion is stored in the conversion result storage means, and the rule retrieval means searches for a match between the rule stored in the rule dictionary and the character stored in the conversion result storage means. Next, when the matching rule is searched by the rule searching means, the corresponding contents stored in the conversion result storing means are rewritten based on the rewriting information stored in the rule dictionary, The output means outputs the kana-kanji character string of the content. Then, the content of the word order storage means is changed by the learning processing means.

[0011]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

The structure of the entire kana-kanji conversion device will be described with reference to FIG.

An input device 10 such as a keyboard for inputting a character string for Kana-Kanji conversion is connected to a central processing unit (CPU) 12 for controlling the entire device.
The RAM 20 as a storage means is connected to the CPU 12,
A conversion result storage area 22 for storing the result of kana-kanji conversion, a reading input buffer area 24 for storing the input kana reading character string, and a conversion result storage area 22.
An output buffer area 26 for storing the contents of the above as a kana-kanji character string, a work area 28 for recording pointer information, and a word order storage area 29 for storing the priority of words in the learning information are stored.

In the conversion result storage area 22, as shown in FIG. 3, the entire conversion result is stored with information added word by word, and each word stored in a basic dictionary 42 described later is identified. Word ID2 that is a unique numerical value for
2a, word reading length 22b, word notation 22c,
The same-sound word start ID 22d and the same-sound word end ID 22e are stored as data for each word.

The homophone head ID 22d is the same as the input device 1
This is the same sound as the character string (word) input from 0, and indicates the smallest numerical value of the word ID 22a stored in the basic dictionary 42. Also, the end of homophone ID22e
Indicates a character having the same sound as the character string (word) input from the input device 10 and having the largest numerical value of the word ID 22a stored in the basic dictionary 42.

ROM 30 for storing programs, dictionaries, etc.
Is connected to the CPU 12, and the program section 32 and the dictionary section 4
It consists of 0 and. The program section 32 stores a kana-kanji conversion program 34, a rule retrieval program 36, a rule rewriting program 38, and a learning processing program 39.

The dictionary unit 40 is composed of a basic dictionary 42, a connection table 44, and a rule dictionary 46. As shown in FIG. 4, the basic dictionary 42 includes a word ID 42a that is a unique identification number of the word, a reading 42b of the word, a kanji notation 42c of the word, part-of-speech information 42d, and a reading length 42e of the word. Is remembered.

The connection table 44 stores data that defines the connection relationship between words by means of part-of-speech information.

In the rule dictionary 46, rule items are generally written in the form of <retrieval factor-word pattern: rewriting information>, and one rule is created by the combination of these items. It works. The search factor indicates a type of rule conversion rewriting method, and includes a U factor, a D factor, and a Y factor. The U factor is exactly the same as the reading and notation of the word stored in the conversion result storage area 22. The D factor means reading of a word stored in the conversion result storage area 22, that is, matching with the same sound as the word. The Y factor is the conversion result storage area 22.
Means a match with a reading of a word string (may be one word) stored in. Word patterns 47a-4
7d indicates the corresponding word of each item of the rule, and the reading and notation of the word are written here according to the search factor.

The rewriting information is either the unchanged marker N, the deleted marker D, or the word string. When the unchanged marker N is stored, the rewriting information matches the item of the rule dictionary 46 in the conversion result storage area 22. Leave the word
Indicates that it will not be rewritten. When the deletion marker D is stored, it means to delete the item, and when it is a word string, the word in the conversion result storage area 22 that matches the item of the rule dictionary 46 is rewritten to the word string. It represents. The word string referred to here is a plurality of words (may be only one word) stored in the rule dictionary 46 by a word ID, and is converted by referring to the basic dictionary 42 based on this word ID. The word reading length 22b of the result storage area 22, the same-sound word start ID 22c, and the same-sound word end ID 22
It is possible to set d and the like. Note that, in FIG. 5, the word ID portion is not read as a numerical value but is read or written for easy understanding.

Next, the operation of the kana-kanji conversion device thus constructed will be described with reference to the flowchart of FIG.

For example, when a reading character string "Ishigatai" is input from the input device 10, the kana character code becomes R.
It is stored in the read input buffer area 24 of the AM 20 (S
10). Thereafter, the kana-kanji conversion program 34 of the ROM 30 refers to the basic dictionary 42, the word order storage area 29, and the connection table 44 to refer to the reading input buffer area 2
The kana character code stored in 4 is converted into a kanji / kana mixed sentence and stored in the conversion result storage area 22 as a kana character code. If the word “stone” has been used before, and the word ID of the word “stone” is stored at the beginning of the word IDs of the homonyms “will” and “doctor” in the word order storage area 29, The word “stone” is given priority, converted into a kanji-kana mixed sentence “stone is firm”, and stored in the conversion result storage area 22 (S12). Then, the rule retrieval program 36 and the rule rewriting program 38 of the ROM 30 perform the rule conversion process with reference to the content of the conversion result storage area 22 and the rule dictionary 46 (S14).

Next, a specific process of the rule conversion process will be described with reference to the flowcharts of FIGS. 7, 8 and 9.

First, the pointer P1 is set to the first word "stone" of "stone is hard" stored in the conversion result storage area 22, and the pointer information of the pointer P1 is stored in the work area 28 of the RAM 20 (S30). ).

Next, it is searched whether or not the rule matching the word pointed by the pointer P1 exists in the rule dictionary 46 (S3).
2). In the rule search subroutine shown in FIG. 9, first, the pointer P5 is set to the first rule 5-1 in the rule dictionary 46.
And the pointer information is recorded in the work area 28 (S320). Next, the pointer P6 is set to the head item 46a of the rule 5-1 which points the pointer P5, and the pointer information is stored in the work area 28 (S322). Next, the pointer P7 is set to the first word "stone" of the Kana-Kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule indicated by the pointer P6 <U-
Intention: N> and conversion result storage area 22 pointed to by pointer P7
The word "stone" inside is compared (328). In this case, the rule and the word do not match (S326 / NO), and the rule 5-1 indicated by the pointer P5 is not the last rule in the rule dictionary 46 (S328 / NO), so the pointer P5 is set to the next rule 5-.
2, the pointer information is stored in the work area 28 (S330), and the process returns to S322. Next, the pointer P6 is set to the head item 47a of the rule 5-2 which points the pointer P5, and the pointer information is stored in the work area 28 (S
322). Next, the pointer P7 is set to the first word "stone" of the Kana-Kanji conversion result in the conversion result storage area 22 pointed to by the pointer P1 (S324).

Here, the rule indicated by the pointer P6 <U-
Stone: N> is compared with the word “stone” in the conversion result storage area 22 pointed to by the pointer P7 (326). In this case, the rule matches the word (S326, YES), and the pointer P6 is not the last item (S332, NO), so the pointer P7
Is moved to the word "ga" next to "stone" stored in the conversion result storage area 22, and the pointer P6 also moves to rule 5-2 (4
7b), the next item <U- is: N> (46b), and the pointer information is stored in the work area 28 (S
334), and the procedure returns to 326.

The same procedure is repeated thereafter, and the pointer P7
To the word "ken" in the conversion result storage area 22 and the pointer P
6 is moved to the item <D-Pattern: Hard> (47c) in Rule 5-2 (S334). Item indicated by pointer P6 <D-
Way: Hard> (47c), the factor D is added, which means that the reading is in agreement. Therefore, the word "ken" supported by the pointer P7 matches (S326, YES), and the pointer P6
The item 47c indicated by is not the last item (S332.
NO), the pointer P6 is set to the next item in the rule 5-2 <U-
I: N>, move the pointer P7 to the next word "i" in the conversion result storage area 22, and move the pointer information to the work area 2
No. 8 is stored (S334).

Item <U-Y: N> indicated by pointer P6
And the word “I” indicated by the pointer P7 match (S326
・ Yes, since the pointer information P6 is the last item (S3
32. YES), the rule flag ON is stored in the work area 28 (S336), and the process returns to S32 shown in FIG.

When a matching rule is not retrieved (S
(326 / NO) moves the pointer P5 to the next rule in sequence (S330) until the rule pointed to by the pointer P5 is the last rule in the rule dictionary (S328 / NO) and searches for a matching rule (S330). S322-S330). Pointer P
When the rule indicated by 5 is the last rule in the rule dictionary (S328, YES), the rule flag OFF indicating that there is no matching rule is stored in the work area 28 (S338).

Here, in S32, the work area 2
Since the rule flag of No. 8 is ON (S34 ・ YE
S) Then, the rule rewriting process by the rule rewriting program 38 starts. First, the pointer P2 is set to the first word "stone" of the word string "stone is hard" stored in the conversion result storage area 22 pointed to by the pointer P1, and the pointer information of the pointer P2 is stored in the work area 28 (S36). .. Then, the pointer P3 is set to "i" at the end of the word string "stone is firm" stored in the conversion result storage area 22 pointed to by the pointer P7,
The information of the pointer P3 is stored in the work area 28 (S
38). Then, the pointer P4 is set to the head item of the matched rule 5-2 in the rule dictionary 46, and the pointer information of the pointer P4 is stored in the work area 28 (S4).
0). Pointer P in rule 5-2 in rule dictionary 46
Since the initial item <U-stone: N> (47a) indicated by 4 is provided with the unchanged marker N (S44, YES), it is left as it is without being rewritten, and the process proceeds to S46.

When the deletion marker D is set at the location of the rewriting information in the item 46b pointed to by the pointer P4 (S44.NO, S48.YES), the word "stone" pointed to by the pointer P2 in the conversion result storage area 22. Is deleted (S5
0), the process proceeds to S46. Item 4 pointed to by pointer P4
When there is a word string at the location of the rewriting information in 7a (S4
4 · NO, S48 · NO, S52 · YES), the word “stone” pointed to by the pointer P2 in the conversion result storage area 22 is rewritten with the word string (S54), and the process proceeds to S46.

In S46, the word pointed by the pointer P2 is compared with the word pointed by the pointer P3. That is, when the word pointed by the pointer P2 and the word pointed by the pointer P3 are equal, it means that the pointer P2 has advanced to the last word. Here, since the "stone" pointed to by the pointer P2 is not the last word of the conversion result stored in the conversion result storage area 22 (S46 / NO), the word pointer P2
To the next word "ga" and move the pointer P4 to rule 5-2.
The next item <U- in the table moves to: N> (47b) (S56) and returns to S44.

Here, the item <U-pointed by the pointer P4
：: Since there is no change marker N in N> (S44 ・ YE
S), leave it as it is without rewriting, and proceed to S46. In this way, the contents of the sequential conversion result storage area 22 are processed according to the rule rewriting instruction (S44 to S56). When the pointer P2 points to the last word "i" and the pointer P4 points to the last item <U-i: N> 47d (S56),
Since the rewriting information of the item <U-i: N> pointed by the pointer P4 is attached with the unchanged marker N (S44, YES), the rewriting information is left as it is without rewriting and the process proceeds to S46.

Here, the word "i" pointed to by the pointer P2
Becomes the last word in the conversion result storage area 22 indicated by the pointer P3 (S46.YE
S), if the pointer P1 is not at the last word of the word string stored in the conversion result storage area 22 (S58N
O), move the pointer P1 to the next word one by one (S
60) and the rule search program 36 performs the same rule search process (S32) again. In this case, the pointer P1
Is moved to the second word “ga” of the character string “stone is firm” stored in the conversion result storage area 22 (S58, NO,
S60). Then, the processing of S32 to S60 is repeated.
Finally, when the pointer P1 is the last word in the conversion result storage area 22 (YES in S58), the rule conversion process ends.

This result is stored again in the conversion result storage area 22, and the contents of the conversion result storage area 22 are stored in the output buffer area 26 and displayed on the output device 50 (S16 in FIG. 6). After that, if the confirmation key is input by the user (S18, YES), the words stored in the conversion result storage area 22 are stored in the word order storage area 29 (S22), and the processing is ended. When a key other than the enter key is input (S18, NO), the process proceeds to the candidate changing process (S20). The result is stored again in the conversion result storage area 22. The contents of the conversion result 22 are stored in the output buffer area 26 and displayed on the output device 50 (S16). After that, if the confirmation key is input by the user (S18, YES), the word stored in the conversion result storage area 22 is stored as the priority candidate in the word order storage area 29 (S22), and the process ends.

As described above, the rule 5-1 <U-intention: N><U- corresponding to the reading "Ishigai"
: N><D-type:Ken><U-type:N>, and rule 5-
2 <U stone: N><U- is: N><D- Person: Hard><U-
I: When two types of rules, N>, exist in the rule dictionary, if the user uses "stone" immediately before, "Ishi" is converted to "stone" as a normal conversion result. ,
Rule 5-2 is applied, and "stone is hard" is output as the rule conversion result. Therefore, when the user repeatedly wants to use "hard stone", the conversion result that meets the user's wish can be provided by the rule conversion process without complicated processing.

In addition, the user "has a chopstick"
When "Bashi" is used immediately before, the word order storage area 29 is referred to, and as a result of the Kana-Kanji conversion processing, "Walk on the bridge" is converted (S12). However, by performing the rule conversion process next (S14),
Rule 5-5 <D in the rule dictionary 46 at the "walking bridge" part
-Chopsticks: end><U-:N><D-Yes:step><U-
Ku: N> is applied and rewritten as "walking at the edge". Therefore, the correct conversion result of "walking on the edge of the bridge" is output (S16).

The present invention is not limited to the kana-kanji conversion device of a Japanese word processor, but can be applied to various devices that require Japanese input.

[0040]

As is apparent from the above description, the kana-kanji conversion device of the present invention considers the adaptation of a plurality of rules to the input kana character string by combining the rule conversion process with the learning process. Even when the conversion is performed, by converting the kana to the kanji used immediately before by the normal kana-kanji conversion, the conversion result desired by the user can be provided by performing the same rule conversion process as immediately before.

Further, by combining the learning process and the rule conversion process, it is possible to prevent erroneous conversion caused by simply outputting the same character repeatedly.

[Brief description of drawings]

FIG. 1 is a configuration diagram of the present invention.

FIG. 2 is a block diagram of a control unit of the kana-kanji conversion device according to the present embodiment.

FIG. 3 is a conceptual diagram of contents of a conversion result storage area of the present embodiment.

FIG. 4 is a conceptual diagram of contents of a basic dictionary of this embodiment.

FIG. 5 is a conceptual diagram of contents of a rule dictionary of this embodiment.

FIG. 6 is a flowchart of the kana-kanji conversion device of the present embodiment.

FIG. 7 is a flowchart of rule conversion according to the present exemplary embodiment.

FIG. 8 is a flowchart of rule conversion of this embodiment.

FIG. 9 is a flowchart of a rule search subroutine of this embodiment.

[Explanation of symbols]

 10 Input Device 12 Central Processing Unit 20 RAM 22 Conversion Result Storage Area 24 Reading Input Buffer Area 26 Output Buffer Area 28 Work Area 29 Word Order Storage Area 30 ROM Area 32 Program Section 34 Kana-Kanji Conversion Program 36 Rule Search Program 38 Rule Rewriting Program 39 Learning processing program 40 Dictionary part 42 Basic dictionary 44 Connection table 46 Rule dictionary 50 Output device

Claims (1)

[Claims] 1. An input unit for inputting a Kana-Yomi character string, a basic dictionary storing a notation for reading a word, a word order storage unit storing a priority order of words in the basic dictionary, and the basic unit. A kana-kanji conversion means for kana-kanji conversion based on a dictionary and word order storage means, a conversion result storage means for storing the conversion result by the kana-kanji conversion means, a pattern of a plurality of word strings in the basic dictionary, and rewriting information thereof. A rule dictionary that stores the rules that it has, a rule search unit that searches the contents of the conversion result storage unit for a rule that matches the rule in the rule dictionary, and if the rule search unit finds a matching rule, then Rule rewriting means for rewriting the contents of the conversion result storage means, and output means for outputting the contents of the conversion result storage means as a kana-kanji character string, A kana-kanji conversion device comprising: learning processing means for changing the priority order of the words in the word order storage means based on the output result of.