JPH11110378A - Device and method for kana/kanji conversion and recording medium recording kana/kanji converting program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enable efficient Japanese syllabary (KANA)/Chinese character (KANJI) conversion to a long sentence by providing a learning buffer for continuously storing plural KANA and correspondent KANA/KANJI CONVERTED RESULTS. SOLUTION: A 1st converting processing part 12 converts a KANA string to KANJI. A KANJI buffer 13 stores the KANA/KANJI converted result. A long sentence KANA buffer 14 can store the contents of plural character strings in the KANA buffer 11 inputted to the 1st converting processing part 12. A long sentence KANJI buffer 15 continuously stores the contents of plural outputs in a KANJI buffer 13 at the 1st converting processing part 12 just for character strings corresponding to the number of character strings in the long sentence KANA buffer 14. The learning buffer is composed of a KANA learning buffer 16 and a KANJI learning buffer 17 for coupling the character strings in the long sentence KANA buffer 14 and the long sentence KANJI buffer 15 as one pair and storing the contents of these character strings. A 2nd converting processing part 18 refers to the character strings in the KANA learning buffer 16, retrieves the KANJI learning buffer 17 corresponding to the character string in the KANA learning buffer 16 and outputs the result as a converted character string.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a kana-kanji conversion apparatus, a kana-kanji conversion method, and a recording medium on which a kana-kanji conversion program is recorded. The present invention relates to a kana-kanji conversion method and a recording medium on which a kana-kanji conversion program is recorded.

[0002]

2. Description of the Related Art When a sentence is prepared in Japanese, a kana-kanji conversion device is generally used. This conventional example will be described with reference to the drawings. FIG. 4 is a functional block diagram of a kana-kanji conversion device such as a conventional personal computer (personal computer) and word processor (word processor).

First, the kana character string input from the input device is stored in the kana buffer 11 one character string at a time. Next, the kana-kanji conversion processing unit 12 converts the character into an appropriate kanji by a conversion key input or an operation similar thereto, and the conversion result is stored in the kanji buffer 13.

The flow of this series of operations will be described with reference to FIG. 5 taking a case where a character string is input from a keyboard as an example.

First, the contents of the kana buffer 11 are cleared (step S2). Next, it is determined whether the key input is a conversion key (step S4). If the key input is not a conversion key, it is determined whether the keyed-in character string is a kana character string (step S13). ), If it is a kana character string, it is added to the kana buffer 11 (step S14) and waits for the next key input. This operation is repeated as long as the input character string is a kana character string, and waits until a conversion key is input. When the conversion key is input, the kana buffer 11
If it is determined that it is not 11 (invalid), a kana-kanji conversion process (step S6) is performed, and then learning is performed on a phrase basis (step S7), and the process returns to the beginning.

[0006]

The conversion efficiency of a sentence in the prior art described above has been considerably improved by adopting a continuous phrase conversion method. However, even when sentences having the same content occur frequently, all of the sentences to be converted are converted. There was a drawback that you had to enter the reading kana.

As a method for solving this problem, a user dictionary registration function for registering a kanji corresponding to a predetermined kana (for example, disclosed in Japanese Patent Laid-Open No. 05-2578, etc.) There is a method in which a registered character string is obtained by assigning a key to a key in advance and pressing a soft key.

However, any of these methods requires a registration operation in advance, and in order to convert a long sentence of the same content without the registration operation, it is necessary to input all the corresponding kana character strings. .

As an improved method in which the above-mentioned pre-registration work is omitted, a plurality of character strings after determination are stored in a buffer, a few character strings are inputted from the beginning of the character string, and a command key such as a soft key is input. A kana-kanji conversion method using an alias function that selects a character string that matches the input character string from the buffer by pressing is disclosed.Also, in this technology, the alias function is used while the kana-kanji conversion function is used. There was a problem that it could not be used unless it was decided.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a kana-kanji conversion apparatus and a kana-kanji conversion method which solve the above-mentioned problems of the prior art, and in particular, realize long sentence conversion by inputting kana with a small number of character strings.

[0011]

A kana-kanji conversion device according to the present invention comprises a kana buffer for storing a kana character string input from an input means, and a first kana buffer for converting the kana character string into kanji.
A kanji buffer for storing the kana kanji conversion result, a long sentence kana buffer capable of storing a plurality of contents of the character string of the kana buffer inputted to the first conversion processing unit, A long kanji buffer that continuously stores a plurality of output contents of the kanji buffer of the conversion processing unit by a character string corresponding to the number of character strings of the long sentence kana buffer;
A character buffer of the long sentence kana buffer and the character string of the long sentence kanji buffer are set as a set, and a learning buffer including a kana learning buffer and a kanji learning buffer for storing the contents of the plural sets of character strings; and a character string of the kana learning buffer. A second conversion processing unit having a function of referring to and searching for a character string in the kanji learning buffer corresponding to the character string in the kana learning buffer and outputting it as a converted character string.

In the kana-kanji conversion device of the present invention, the kana learning buffer of the learning buffer is used instead of the long kana buffer, and the number of buffers using the kanji learning buffer of the learning buffer instead of the long kanji buffer is reduced. In addition, a user dictionary can be used instead of the learning buffer.

The kana-kanji conversion method using the above-described kana-kanji conversion device includes a step of clearing the contents of a long kana buffer, a long kana-kanji buffer and a kana buffer, and a step of clearing a character string of the kana buffer from a terminator to the next terminator. The character string of the result of the kana-kanji conversion by the first conversion processing unit is sequentially added to the end of each character string in the long sentence kana buffer, while being stored in the long sentence kana buffer so as to be sequentially added to the end of each character string. And storing the character string of the long sentence kana buffer and the corresponding character string of the long sentence kanji buffer as a set corresponding to the kana learning buffer and the kanji learning buffer of the learning buffer, respectively. The second conversion processing unit refers to the contents of the character string in the kana learning buffer, and Search the contents of a character string of the kanji learning buffer corresponding to the character string of § composed of a conversion step of outputting as a kana-kanji conversion string.

As described above, the present invention has a learning buffer for storing a plurality of kana and the corresponding kana-kanji conversion results in succession, so that long sentences can be efficiently converted to kana-kanji.

[0015]

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

FIG. 1 is a functional block diagram of a kana-kanji conversion apparatus according to a first embodiment of the present invention. The kana-kanji conversion device includes a kana buffer 11 for storing a kana character string input from input means 10 such as a keyboard, a first conversion processing unit 12 for converting the kana character string into kanji, and the like, A kanji buffer 13 for storing the conversion result, a long kana buffer 14 for storing a plurality of contents of the kana buffer 11 inputted to the first conversion processing unit 12, and an output of the kanji buffer 13 from the first conversion processing unit 12. A long sentence kanji buffer 15 for continuously storing a plurality of contents by the number of character strings corresponding to the number of character strings in the long sentence kana buffer 14, and a set of the long sentence kana buffer 14 and the character string of the long sentence kanji buffer 15. A learning buffer consisting of a kana learning buffer 16 and a kanji learning buffer 17 for storing A second conversion processing section 18 having a function of outputting a kanji parts as search converts string, and an output unit 19 such as a CRT.

A kana-kanji conversion method using the kana-kanji conversion apparatus of the first embodiment of the second embodiment of the present invention will be described.

FIG. 2 is a kana-kanji conversion flowchart when the kana-kanji conversion device of FIG. 1 is used.

First, as initialization processing, clear processing is performed to empty the contents of the long sentence kana buffer 14 and the long sentence kanji buffer 15 (step S1).

Next, the kana buffer 11 is cleared (step S2). In step S3, it is determined whether or not the character string input by the key is a normal kana. If the character string is a kana in step 13, the input character string is continuously added to the kana buffer 11 (step S14). At the time when the conversion key is input in step S4 (step S5), the kana-kanji conversion processing unit 12 performs the kana-kanji conversion processing (step S6),
The contents of the kana buffer 11 are added to the long kana buffer 14 (step S8), and the contents of the kanji buffer 13 are added to the long kanji buffer 15 (step S9). This series of processing is repeated until the terminator is recognized (step S10). Terminator is punctuation,
Although it is desirable to use a tab symbol and a line feed symbol, it is not necessary to limit to these. In addition, a function that allows the user to set a terminator can be added.

Next, when the terminator is recognized (step S10), the contents of the long sentence kana buffer 14 and the long sentence kanji buffer 15 are stored in the learning buffers 16 and 17 (step S11).

By repeating this process, a character string having the contents of the long sentence kana buffer 14 and the long sentence kanji buffer 15 as a set is added to the learning buffers 16 and 17. A character string of a combination of a kana and a long kanji will be stored.

After the character strings of a plurality of combinations of long sentence kana and long sentence kanji are stored in the learning buffers 16 and 17 as described above, several character strings of kana input are stored in the kana buffer 11.

Next, the conversion key of the second conversion processing unit 18 is input (step S3), and the contents of the kana buffer 11 and a part of the contents of the kana learning buffer 16 are collated. A conversion process of outputting a sequence (step S12) is performed, and a long sentence conversion result can be obtained by inputting a character string with a small number of character strings.

Next, a description will be given of a recording medium in which a program for causing a computer to execute a kana-kanji conversion process according to a third embodiment of the present invention is recorded.

In the present recording medium, the kana-kanji conversion program described in the kana-kanji conversion method of the second embodiment of the present invention is recorded. As the recording medium, a magnetic disk, a semiconductor memory, or another recording medium is used.

[0027]

Next, a first embodiment of the kana-kanji conversion method of the present invention will be described with reference to FIG. 1 and FIG. 3, which illustrate character strings to be entered in a kana buffer, a kanji buffer, a long sentence kana buffer, a long sentence kanji buffer, and a learning buffer. This will be described in detail with reference to specific examples.

First, “Tokyo” is stored in the kana buffer 11.
Is input, and the conversion key is pressed, and the first conversion processing unit 12 that performs kana-kanji conversion performs the operation of the first conversion processing unit 12 so that “Tokyo” is stored in the kanji buffer 13.
Is stored.

Next, the kana buffer character string 20 of "Tokyo" is stored in the long sentence kana buffer 14, and the conversion result character string of "Tokyo" is stored in the long kanji buffer 15.

Next, when the kana buffer character string 22 of "Setagayaku" is input to the kana buffer 11, the conversion key is pressed, and the kanji buffer character string 23 of the conversion result "Setagaya-ku" is entered in the kanji buffer 13. Is stored. Next, the kana buffer character string 2 "Setagayaku"
2 is added after the character string of "Tokyo" in the long sentence kana buffer 14, and as a result, it becomes "Tokyo toyakuyaku". The kanji buffer character string 23 of the conversion result "Setagaya-ku" is added after the character string "Tokyo" in the long kanji buffer 15, resulting in "Setagaya-ku, Tokyo".

Next, when the kana buffer character string 24 of "Sangenpoya" is input to the kana buffer 11, the conversion key is pressed, and the kanji buffer character of the conversion result of "Sangenjaya" is stored in the kanji buffer 13. Column 25 is stored. Next, the kana buffer character string 24 of “Sangempoya” is added to the long sentence Kana buffer 14 next to the character string of “Tokyo to Sagayakuya”, and as a result, a long sentence to “Tokyo and Sayagaya Sangakuya” It becomes a kana buffer character string 26. The kanji buffer character string 25 of the conversion result "Sangenjaya" is added to the long kanji buffer 15 after the character string of "Setagaya-ku, Tokyo". As a result, a long-character kanji buffer character string 27 of "Sangenjaya, Setagaya-ku, Tokyo" is obtained. Become.

Next, when a terminator character string such as a line feed code is input, the contents of the long sentence kana buffer, that is, a long sentence kana buffer character string 26 of "Tokyo Toseta Gayakusangenya" is stored in one of the kana learning buffers 16. The long sentence kanji buffer character string 27 "Sangenjaya, Setagaya-ku, Tokyo" which is transferred to the line and is the contents of the long sentence kanji buffer
Is transferred to the first line of the kanji learning buffer 17.

By repeating the above-described operation, "Tokyo saga toyaku kinuta" is stored in the kana learning buffer, and "Kinuta, Setagaya-ku, Tokyo" is stored in the corresponding kanji learning buffer. "Tokyo Setagaya Seiji" and "Seijo, Setagaya-ku, Tokyo" are also stored.

Next, when the user wants to obtain the conversion result "Kinata, Setagaya-ku, Tokyo" again,
And press the special conversion key. The second conversion processing unit first confirms that "to" is a two-character string, refers to the kana learning buffer, and sets the kanji learning buffer corresponding to the character string whose first two character strings match "to". Search from the first digit of the first line and output as a conversion result.

In the case of the example shown in FIG. 3, "Sangenjaya, Setagaya-ku, Tokyo" is output. The user senses that it is different from the target “Kinuta, Setagaya-ku, Tokyo” and presses the next candidate key. Upon detecting that the next candidate key has been pressed, the second conversion processing unit outputs the next search result, “Kinuta, Setagaya-ku, Tokyo” on the second line. Thus, the conversion result desired by the user is obtained.

Next, a second embodiment will be described. The process up to the point where the character string is stored in the learning buffer is the same as in the first embodiment. First, when the user desires to obtain a conversion result of "Kinuta, Setagaya-ku, Tokyo", the user inputs only "Kinuta" and presses a special conversion key. The second conversion processing unit first searches whether a character string that matches “Kinuta” exists in the learning buffer kana part, not only at the beginning of the line, and if it matches, outputs the corresponding character string in the kanji learning buffer as a conversion result. I do. In this example, since a character string matching "Kinuta" exists only in the second line, a target character string "Kinuta, Setagaya-ku, Tokyo" can be obtained with a single shot.

Next, a third embodiment will be described. In the third embodiment of the present invention, the contents of the long sentence kana buffer and the long sentence kanji buffer of the present invention are added to the user dictionary, and the user dictionary is used as the learning buffer of the present invention.

By not using the kana learning buffer and the kanji learning buffer as unique buffers, but using the kana part of the user dictionary and the kanji part of the user dictionary,
It is possible to substitute the existing user dictionary conversion routine without making the second conversion processing unit independently. Since the kana-kanji conversion process of this embodiment can be performed by the same process as in the above embodiment, detailed description will be omitted.

[0039]

The effect of the present invention is that if a character string has been input before, a long sentence output result can be obtained with a small number of kana inputs without performing word registration processing. The reason is that the first kana-kanji conversion process
This is because a second conversion processing unit having a search engine function for searching the learning buffer is provided separately from the conversion processing unit.

[Brief description of the drawings]

FIG. 1 is a functional block diagram of a kana-kanji conversion device according to a first embodiment of the present invention.

FIG. 2 is a kana-kanji conversion flow chart according to the second embodiment of the present invention.

FIG. 3 is a configuration diagram specifically illustrating an embodiment of the present invention.

FIG. 4 is a functional block diagram of a conventional kana-kanji conversion device.

FIG. 5 is a kana-kanji conversion flowchart illustrating an example of a kana-kanji conversion method by a conventional kana-kanji conversion device.

[Explanation of symbols]

 Reference Signs List 10 Input means 11 Kana buffer 12 Kana-kanji conversion processing unit 13 Kanji buffer 14 Long sentence kana buffer 15 Long sentence kanji buffer 16 Kana learning buffer 17 Kanji learning buffer 18 Second conversion processing unit 19 Output unit 20, 22, 24 Kana buffer character string 21, 23, 25 Kanji buffer character string 26 Long sentence Kana buffer character string 27 Long sentence Kanji buffer character string 28 Kana learning buffer character string 29 Kanji learning buffer character string

Claims (3)

[Claims] 1. A kana buffer for storing a kana character string input from an input means, a first conversion processing unit for converting the kana character string into kanji, and a kanji buffer for storing the kana kanji conversion result. A long sentence kana buffer capable of storing a plurality of contents of the character string of the kana buffer input to the first conversion processing unit, and an output content of the kanji buffer of the first conversion processing unit, A long kanji buffer that continuously stores a plurality of character strings corresponding to the number of columns, a string of the long sentence kana buffer and the character string of the long kanji buffer, and sets the contents of the plural sets of character strings as a kana character string and a kana character string. The kana learning buffer is stored in the kana learning buffer and the kanji learning buffer as a corresponding kanji character string, and the character string in the kana learning buffer is referred to. A character string in the kanji learning buffer corresponding to the character string of
And a conversion processing unit. 2. A step of clearing the contents of a long kana buffer, a long kanji buffer and a kana buffer, and sequentially adding a character string of the kana buffer from a terminator to the next terminator to the long sentence kana buffer to the end of each character string. Storing the character string of the result of the kana-kanji conversion by the first conversion processing unit in the long kanji buffer sequentially so as to be added to the end of each character string; Storing a string and a corresponding character string in the long kanji buffer as a set in a kana learning buffer and a kanji learning buffer of a learning buffer, respectively, and storing the character string in the kana learning buffer by the second conversion processing unit. Referring to the contents of the column, the character string of the Kanji learning buffer corresponding to the character string of the Kana buffer 2. A kana-kanji conversion method using the kana-kanji conversion device according to claim 1, further comprising a conversion processing step of retrieving the contents and outputting as a kana-kanji conversion character string. 3. A recording medium on which a program for causing a computer to execute a kana-kanji conversion process in the kana-kanji conversion method according to claim 2 is recorded.