JP3150328B2 - Kana-Kanji conversion device - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a kana-kanji conversion device for converting a kana-input character string into a kana-kanji mixed string.

(Related Art) In recent years, a kana-kanji conversion device has been widely used as a Japanese input device in various Japanese processing devices such as a Japanese word processor.

The conventional Kana-Kanji conversion device is used to convert an input Kana-kanji into a Kana-Kanji-mixed row. For example, if you enter "Today's Tenkihare.", "Today's weather is fine." Conversion can be performed.

(Problems to be Solved by the Invention) Even if Kana-Kanji conversion fails due to input of an unregistered word, the conventional Kana-Kanji conversion device regards the failed part as it is, and continues the conversion again from the character following the failed part. There was a problem.

For example, if you enter the kana sequence "Complete the connection" and convert it, if the word "native code" is an unregistered word, the traditional Kana-Kanji conversion In the apparatus, for example, the conversion is performed as “the compiler outputs the value medical unit code”. This is because, even though the conversion has failed at the position of “ぃ”, the conversion results before and after the conversion are displayed as they are. Therefore, the conventional kana-kanji conversion apparatus gives an unsightly conversion result to the user when conversion internally fails.

There is also a method of converting up to "" as a phrase by referring to the characteristics of the phrase, but with that method alone, for example, for a kana column such as "perform neitebu-ko-dosei" Says, "Do native code analysis"
Has the disadvantage of resulting in the conversion result.

An object of the present invention is to provide a kana-kanji conversion device that solves the above-mentioned conventional problems.

(Means for Solving the Problems) In order to achieve the above object, the present invention provides a dictionary in which kana data is stored as a heading and corresponding kanji data, input means for inputting kana data, and input data from the input means. Kana-kanji conversion means to search the kana data sequentially from the top of the dictionary and convert it to kana-kanji characters. If the kana-kanji character that cannot be the top of independent word reading is found at the top when searching in the dictionary, the kana Detecting means for detecting a phrase including data, output means for converting kana data of the phrase detected by the detecting means into katakana data in accordance with a predetermined rule and outputting the data, and dictionary for outputting katakana data output from the output means Means for registering the information.

(Operation) According to the present invention, in the process of sequentially searching the kana data input from the input means in a dictionary from the beginning and converting the kana to kanji by the kana-kanji conversion means, the kana character which cannot be the head of the independent word reading Is at the beginning and if kana-kanji conversion fails, the phrase containing the kana data is detected and converted to katakana data according to a predetermined rule, so that the conversion of kana data to katakana data is simple, reliable, and easy. When the kana-kana data is converted to katakana data, the kana-kana data is automatically registered in the dictionary. Is further improved.

(Examples) Hereinafter, the present invention will be described by examples with reference to the drawings.

FIG. 1 is a functional block diagram of an embodiment of a kana-kanji conversion apparatus according to the present invention. Means 2 is an input kana column storage unit for storing a kana sequence input from the input unit 1, 3 is a kana-kanji conversion control unit, 4 is referred to for performing kana-kanji conversion, and
The kana-kanji conversion dictionary 5 is capable of newly registering a word according to an instruction from the kana-kanji conversion control unit 3. The kana-kanji conversion dictionary 5 converts kana strings stored in the input kana-string storage unit 2 into kana-kanji mixed phrases while referring to the kana-kanji conversion dictionary 4. A kana-kanji conversion control section 3 for notifying the kana-kanji conversion control section 3 of an analysis failure when an analysis failure has occurred; an output phrase storage section 6 for storing a sequence of phrases output from the kana-kanji conversion control section 3; When the kana-kanji conversion fails, a failed phrase start position determination rule storing rules for determining the start position of a failed phrase, 8 refers to the failed phrase start position determination rule 7 and the output phrase storage unit 6, A failed phrase start position determination processing unit 9 for searching for a phrase in front of the position where the Kana-Kanji conversion execution unit 5 failed to analyze and determining a start position of the failed phrase, 9 A failure clause end position determination rule storing rules kanji conversion determines the end position of the failed clause upon failure, 10 the failure clause end position decision rule 9
A failed phrase end position determination processing unit that searches for a character string that follows the position at which the kana-kanji conversion execution unit 5 failed to analyze while referring to the input kana sequence storage unit 2 and determines the end position of the failed phrase. is there. Further, 11 is a failed phrase determination rule storing rules for determining the display content of a failed phrase when the kana-kanji conversion fails, and 12 is the failed phrase determination rule.
A failed phrase determination processing unit 13 for determining the display content of the failed phrase with reference to 11 and the input kana sequence storage unit 2. The failed phrase determination processing unit 13 displays the sequence of the phrases stored in the output phrase storage unit 6 as a kana-kanji mixed sentence. It is a display means to perform. The Kana-Kanji conversion control unit 3 executes the Kana-Kanji conversion execution unit 5
When the analysis is notified, the failed phrase start position determination processing unit 8, the failed phrase end position determination processing unit 10, and the failed phrase determination processing unit 12 are activated to determine the failed phrase. The kana-kanji conversion execution unit 5 then instructs the kana-kanji conversion execution unit 5 to execute kana-kanji conversion, and stores the phrase output by the kana-kanji conversion unit and the failed phrase in the output phrase storage unit 6, and generates the failed phrase determination processing unit 12. When the selected phrase is adopted by the input means 1, the word of the phrase is automatically registered in the kana-kanji conversion dictionary 4.

The present invention is functionally configured as described above, and structurally as follows.

That is, FIG. 2 is a circuit block diagram of the kana-kanji conversion device of the present embodiment, 14 is a keyboard, 15 is a CPU (central processing unit), 16 is a CRT display, 17 is a ROM (read only memory), and 18 is a RAM. (Random access memory)
It is.

The input means 1 shown in FIG.
The input kana column storage unit 2 and the output phrase storage unit 6
Kana-Kanji conversion dictionary 4, failed phrase start position determination rule 7, failed phrase end position determination rule 9, failed phrase determination rule 11 ROM1
7, Kana-Kanji conversion control unit 3, Kana-Kanji conversion execution unit 5,
The failed phrase start position determination processing unit 8, the failed phrase end position determination processing unit 10, and the failed phrase determination processing unit 12
The display means 13 is realized by the CRT display 16 by executing a program stored in the ROM 17 while exchanging data with 18.

The operation of the kana-kanji conversion device of the present embodiment configured as described above will be described with reference to the flowchart of FIG. As an example, it is assumed that “compilation” is input.

First, in step (hereinafter referred to as S) 1, a kana character string “compilation” is input by the input means 1, and the input kana character string is an input kana string. It is stored in the storage unit 2. Further, in S2, a conversion instruction is issued by the input means 1, and the process proceeds to S3, where the Kana-Kanji conversion control unit 3 determines whether or not there is a Kana character string that has not been converted. If there is an unconverted kana character string, go to S4. Otherwise, go to S10 because the conversion has been completed. Here, since the conversion has not been performed yet, the process proceeds to S4.

In S4, the kana-kanji conversion control unit 3 instructs the kana-kanji conversion execution unit 5 to convert only one kana-kanji character string that has not yet been subjected to kana-kanji conversion, and the kana-kanji conversion execution unit 5 executes the kana-kanji conversion of one phrase. I do. In the example sentence, a clause "Compiler is" is generated. Next, the process proceeds to S5, where it is determined whether the kana-kanji conversion execution unit 5 succeeds in the conversion. If the conversion is successful, the phrase that has been successfully converted is output to the output phrase storage unit 6, and the process proceeds to S9. If conversion failed
Go to S6. Since the conversion was successful, the clause "Compiler is" is output.

In S9, the output phrase "compiler" is stored in the output phrase storage unit 6, and the process returns to S3. FIG. 4 shows the contents of the output clause storage unit 6 at this time.

Next, in S3, it is determined whether there is a character string that has not been converted. Since the conversion of `` Neitebukkodo sukurikusuku '' has not been completed, the process proceeds to S4, and the `` value '' is output, the conversion is determined to be successful in S5, the process proceeds to S9, the `` value '' is stored and stored in S3 Return. At this time, the content of the output clause storage unit 6 is the fifth
Shown in the figure.

The control moves to S3 to determine whether or not there is a character string that has not been converted. Since the conversion of "Export" has not been completed, the process proceeds to S4, where "medical" is output, the conversion is determined to be successful in S5, the process proceeds to S9, the "medicine" is stored, and the process returns to S3. . At this time, the content of the output clause storage unit 6 is the sixth
It looks like the figure.

The control moves to S3 to determine whether or not there is a character string that has not been converted. Since the conversion of "Tabukodo Shusikkusuku" is not finished, proceed to S4 and output "hand" .Conversion is determined to be successful in S5 and proceed to S9 to store "hand".
Return to S3. The contents of the output clause storage unit 6 at this time are as shown in FIG.

The control moves to S3 to determine whether or not there is a character string that has not been converted. Since the conversion of “Pubkodo Sh ゅ sh り rokus」 ”has not been completed, the process proceeds to S4. Since there is no independent word starting with“ ぃ ”, the Kana-Kanji conversion execution unit 5 fails in the conversion and the failure in S5. It is determined and the process proceeds to S6.

In S6, the failed phrase start position determination processing unit 8 searches for the phrase stored in the output phrase storage unit 6 while referring to the failed phrase start position determination rule 7, and determines the failed phrase start position. When the failed phrase start position is determined, the phrases after the failed phrase start position stored in the output phrase storage unit 6 are invalidated. In the example sentence, by applying the first rule a plurality of times, the seventh character of the input is determined as the failed phrase start position, and the "value doctor" portion is invalidated. FIG. 8 shows the contents of the output clause storage unit 6 at this time. FIG. 9 shows an example of a failed phrase start position determination rule.

Next, proceeding to S7, the failed phrase end position determination processing unit 10 searches for a kana character stored in the input kana column storage unit 2 and determines a failed phrase by referring to the failed phrase end position determination rule 9. According to the first rule, "" is found in the input character string, and the position of "" is set as the failed phrase end position.

Next, proceeding to S8, the failed phrase determination processing unit 12 determines the display content of the failed phrase while referring to the failed phrase determination rule 11. Here, katakana is determined by the first rule up to immediately before "wo". The kana-kanji conversion control unit 3 outputs the failed phrase determined by the failed phrase determination processing unit 12 to the output phrase storage unit 6. Proceeding to S9, the output clause storage unit 6 stores the output failed clause. The contents of the output clause storage unit 6 at this time are as shown in FIG.

FIG. 11 shows an example of the rule for determining the end position of a failed phrase.
FIG. 12 shows an example of a failed phrase determination rule.

The control moves to S3 to determine whether or not there is a character string that has not been converted. Since the conversion of “Shipsukusuru” is not finished, proceed to S4, “Output” is output, and S5
In step S9, it is determined that the conversion is successful, and the process proceeds to step S9, where "output" is stored, and the process returns to step S3. At this time, the contents of the output clause storage unit 6 are
It looks like Figure 13.

Control proceeds to S3, where it is determined whether there is a character string that has not been converted. Since there is no character string that has not been converted, the process proceeds to S10. In S10, display means as shown in Fig. 14
Output to 13.

In S11, the user presses a key indicating whether to adopt the conversion result. If adopted, go to S12. Here, if there is a failed phrase in the conversion result, the word of this phrase is registered in the kana-kanji conversion dictionary 4. In this example, the phrase "native code" is a failure clause, so "native code"
Is registered in the kana-kanji conversion dictionary 4, and the conversion of "compilation" is completed.

Next, as an input example, a case where the above-mentioned “Perform a Neighborhood” will be described.

First, in S1, a kana character string “Perform Neighborhood” is input by the input unit 1 and stored in the input kana column storage unit 2. Further, in S2, conversion is instructed by the input means 1, and the process proceeds to S3.

At S3, the kana-kanji conversion control unit 3 determines whether there is an unconverted kana character string. S4 if there is an unconverted kana character string
If all the conversions have been completed, the process proceeds to S10. Here, the conversion is not yet complete, so the process proceeds to S4.

Now, in S4, the kana-kanji conversion control unit 3 instructs the kana-kanji conversion execution unit 5 to convert the kana-kanji character string that has not yet been subjected to kana-kanji conversion into one kana-kanji character, and the kana-kanji conversion execution unit 5 performs the one-segment kana-kanji conversion. Execute Since the “native code” is registered in the kana-kanji conversion dictionary 4 in the previous conversion, the phrase “native code” is generated in this example sentence. Next, in S5, it is determined whether the kana-kanji conversion execution unit 5 has succeeded in the conversion. If the conversion is successful, the phrase that was successfully converted is stored in the output phrase storage unit 6.
And the process proceeds to S9. If the conversion has failed, proceed to S6.
Since the conversion was successful, the clause "native code" is output.

In S9, the output phrase "native code" is stored in the output phrase storage unit 6, and the process returns to S3.

The control proceeds to S3, where it is determined whether or not there is an unconverted kana character string. Since the conversion of “perform the error” has not been completed, the flow proceeds to S4. "Generate" is output in S4, the conversion is determined to be successful in S5, the process proceeds to S9, "Generate" is stored, and S3
Return to

Control transfers to S3, where it is determined whether there is an unconverted kana character string.
Then, “execute” is output here, it is determined that the conversion was successful in S5, the operation proceeds to S9, “implement” is stored, and the operation returns to S3.

Control proceeds to S3, where it is determined whether there is a character string that has not been converted. However, since there is no character string that has not been converted, the process proceeds to S10.

Here, the converted character string is output to the display means 13 as shown in FIG.

In S11, if the user adopts the output conversion result, the process proceeds to S12. In S12, if there is a failed phrase in the conversion result, the word of that phrase is registered in the kana-kanji conversion dictionary 4.
In this example, the conversion ends because there are no failed clauses.

That is, the kana character string of "Perform the Neighborhood Education" is "Generate native code".
And the conversion ends.

(Effects of the Invention) As described above, according to the present invention, kana data input from the input means is sequentially searched in the dictionary from the beginning,
In the process of converting kana-kanji characters by kana-kanji conversion means, if a kana-kanji character that cannot be the head of the independent word reading is at the beginning and kana-kanji conversion fails, a phrase containing the kana-kanji data is detected and a predetermined Kana-kana data is converted to katakana data in accordance with the rules, so that kana-kana data can be easily, reliably and quickly converted to kana-kana data. A phrase containing kana-kanji data for which kana-kanji conversion has failed is converted to katakana data. Since it is automatically registered in the dictionary, there is an effect that the conversion efficiency of kana data to katakana data from the next time is further improved.

[Brief description of the drawings]

FIG. 1 is a functional block diagram of a kana-kanji conversion device according to an embodiment of the present invention, FIG. 2 is a circuit block diagram of the same, FIG. 3 is a processing flowchart, FIGS. 4 to 8, FIG.
FIG. 13 is a diagram showing the contents of the output phrase storage unit, FIG. 9 is a diagram showing a failed phrase start position determination rule, FIG. 11 is a diagram showing a failed phrase end position determination rule, and FIG. FIG. 14 and FIG. 15 are diagrams showing examples of display on the display means. 1 ... input means, 2 ... input kana string storage unit, 3 ... kana-kanji conversion control unit, 4 kana-kanji conversion dictionary, 5 ... kana-kanji conversion execution unit, 6 ... output phrase storage unit, 7 ... failure Clause start position determination rule, 8: failed phrase start position determination processing unit, 9: failed phrase end position determination rule, 10: failed phrase end position determination processing unit, 11: failed phrase determination rule,
12: failed phrase determination processing unit, 13: display means, 14: keyboard, 15: CPU, 16: CRT display, 17:
ROM, 18 ... RAM.

──────────────────────────────────────────────────続 き Continued on the front page (58) Field surveyed (Int.Cl. ⁷ , DB name) F06F 17/22 510-514

Claims (1)

(57) [Claims] 1. A dictionary storing kanji data corresponding to kana data as a heading, input means for inputting kana data, and searching the kana data input from the input means in the dictionary sequentially from the top, Kana-Kanji conversion means for converting Kana-Kanji characters, and detection means for detecting a phrase including the kana data when a kana character that cannot be the head of the independent word reading is found at the head when the dictionary is searched. Output means for converting the kana data of the phrase detected by the detection means into katakana data according to a predetermined rule and outputting the data, and means for registering the katakana data output from the output means in the dictionary. A kana-kanji conversion device characterized by the following.