JP2584734B2 - Character processor - Google Patents

Description

Description: TECHNICAL FIELD The present invention relates to a character processing device such as a word processor, and more particularly to an improvement in kana-kanji conversion that inputs a kanji reading and converts it into kanji.

[Prior art] Conventionally, in such a device, when the capacity of a built-in dictionary is small or not enough, for example, when a kanji character “corporation” corresponding to the reading “kabushikigaisha” is not in the dictionary, For example, as shown in FIG. 3A, even if the user inputs "Kabushikigaisha", conversion to Kanji is not performed. Then, move the cursor to the position 3b in (A) of FIG. 3 and search the dictionary with "kabushiki". This time, the kanji "stock" is entered in the dictionary. "Stock" and kana kanji are converted. Next, even when a dictionary is searched with "gaisha", kana-kanji conversion may not be performed. This is because the word "company" is stored in the dictionary only as "kaisha".

Such a phenomenon can occur in any of the so-called rendaku that is not included in the dictionary, such as “Kabushigaigasha” as described above.

In such a case, it is necessary to delete the voice sound "ga" and re-enter the clean sound "ka" one by one, or in some cases, delete the entire character string to be converted and then input the clean sound character again. Therefore, the operation was very complicated.

Further, in some devices, “gaisha” is entered in the dictionary as a reading of “company” to increase the capacity of the dictionary. However, rendaku in all cases is not enough to be stored in the dictionary, and if it is, the capacity of the dictionary is greatly increased, causing a problem such as an increase in cost.

[Purpose] Therefore, in view of the above, an object of the present invention is to convert a kana character string representing a second or subsequent word in a kana character string representing a plurality of consecutive word readings into a kana character string to be converted. If the first character of this kana character string to be converted is a voice sound or a semi-voiced sound, the specified kana character string is converted to a kana character string in which the first character of this kana character string is converted to a kiyane kana character. An object of the present invention is to provide a character processing device configured to execute conversion as an object.

In order to achieve the above object, a character processing device according to the present invention comprises: input means for inputting a kana character string; storage means for storing a kana character string input from the input means; Dictionary means for storing notations in association with each other;
A kana-kanji conversion means for searching the dictionary means and converting a kana character string representing a reading of a word into a corresponding kanji notation; and a continuous kana-kanji conversion means stored in the storage means as an object of conversion by the kana-kanji conversion means. Specifying means for specifying a kana character string representing the reading of the second and subsequent kanji characters in the kana character string representing the reading of a plurality of idioms, and whether the first character of the specified kana character string by the specifying means is a voiced sound or a semi-voiced sound Determining means, a kana character conversion means for converting a voiced or semi-voiced kana character to a corresponding clear sound kana character, and the determination means,
When it is determined that the first character of the designated kana character string is a voiced sound or a semi-voiced sound, the designated kana character string and only the first character of the designated kana character string are converted to the clear tone kana character by the kana character conversion means. And control means for controlling the kana-kanji conversion means so as to execute conversion with the converted kana character string as a conversion target.

EXAMPLES The present invention will be described below in detail with reference to the drawings.

 FIG. 1 shows a block diagram of an embodiment of the present invention.

Reference numeral 1a denotes a CPU (Central Processing Unit), which controls the entire system according to a program described later stored in the storage device 1b in advance. The storage device 1b includes a storage area SA for characters input from the input device 1c, a dictionary SC, and a homophone buffer SB.
And an area SD for storing a program as shown in FIGS. 5 and 6, for example. In this embodiment, the input device 1c is a keyboard 2 as described later. 1d is CR
A display device such as a T display, which displays information stored in the storage device 1b and other information.

FIG. 2 is a diagram of a keytop of the keyboard 2 used as the input device 1c of the present invention.

In the figure, 2a is a character key for inputting readings such as kanji, 2b
Is a conversion key, 2c is a next candidate key, and 2d is a kanji start / end key. As described below, a character string inserted between the kanji start / end keys 2d is pressed as a converted character string. I do.

 Next, FIG. 3 shows a display example of the display device 1d.

FIG. 3A shows that, following the pressing of the kanji start / end key 2d, the character keys "ka", "bu", "shi", "ki",
This is a display example displayed on the display device 1d when "ga", "i", "shi", and "@" are depressed, and subsequently the kanji start / end key 2d is depressed. In the figure, the upper line 3c,
Characters sandwiched by the underline 3d are converted characters.

In the present embodiment, when the next candidate key 2c is pressed, the pressing is used as a trigger to read from the first character of the converted character string to the character at the cursor 3a, access the dictionary in the storage device 1b, and The kanji corresponding to the reading is stored in the homophone buffer SB in the storage device 1b. And the next candidate key 2c
Each time is pressed, the same phoneme is displayed in the same phoneme buffer SB order in the order described above. Then, when the conversion key 2b is pressed in the state shown in FIG. 3B, the state shown in FIG. 3C is established, and the kanji "stock" is fixed.

By the way, the character string to be converted is assumed to be "Gaisha" as shown in FIG. 3 (C). Here, when the next candidate key 2c is pressed, as shown in FIG.
Then, as described later, the syllabary “ga” is regarded as the “ka” of the Kiyone, and the dictionary is accessed by the “kaisha” of the reading, so the corresponding kanji “company” is stored in the homophone buffer.
Stored in SB. In addition, eos indicated by 4a in FIG. 4 is a code meaning that the stored content of the homophone buffer SB ends.

Next, in the state of FIG. 3C, when the next candidate key 2c is pressed, the homophone buffer SB shown in FIG. 4 is configured as described later, and its display is shown in FIG. And “external car” is displayed as the first candidate. When the next candidate key 2c is pressed again, the display changes to (E) in FIG. 3, and the second candidate "company" is displayed. Here, the operator
When 2b is pressed, the reading of "gaisha" is converted to kanji "company" and kana-kanji, and the display is changed to (F) in FIG. 3 and "company" is fixed.

Next, the above control process will be described with reference to the flowcharts of FIGS.

First, in step S1, it is determined whether or not the input from the keyboard 2 is the next candidate key 2c. When the next candidate key 2c is input, the process proceeds to step S2, and when it is not input, the process proceeds to step S3 to perform a predetermined process, for example, a predetermined process when another key is input.

On the other hand, in step S2, it is determined whether the character on the cursor when the next candidate key 2c is pressed is an unconverted character. If the character on the cursor is a character that has already been converted or does not require conversion, the next candidate key
Since it is useless even if 2c is pressed, the process proceeds to step S4 to perform a predetermined process.

On the other hand, if the character on the cursor is an unconverted character in step S2, the process proceeds to step S5. In step S5, the dictionary in the storage device 1b is accessed based on the reading from the first character of the converted character string to the position of the character indicated by the cursor, and the result of the access is stored in the homophone buffer SB. In the example of Fig. 3, "Gaisha" is as shown in (C).
Is searched for and the content is stored in the homophone buffer SB.

Then, the process proceeds to step S6, where the first character of the converted character string is, for example, “ga”, “gi”, “gu”, “ge”, “go”.
It is determined whether the sound is muddy or not. This can be achieved by providing a voiced word table as shown in FIG. 7 and determining whether or not the corresponding character exists in this table.

As shown in FIG. 7, the voiced sound word table includes two characters for one voiced sound character. That is, one is a voiced character as shown in the left column of the drawing, and the other is a clear character corresponding to the voiced character as shown in the right column of the drawing. Therefore, in step S6, it is sufficient to search for a voiced character on the voiced sound word table and determine whether or not the character is a voiced sound.

If it is determined in step S6 that the sound is not muddy, the process proceeds to step S8 shown in FIG. On the other hand, in the case of a voice sound in step S6, the dictionary is accessed using the first character of the converted character string as a clear tone, and the access result is stored in the homophone buffer SB. At that time, to change the muddy sound into a clear sound,
As shown in FIG. 7, the voiced sound word table has voiced sound characters and corresponding clear sound characters, so that it can be easily realized.

In the next step S8, the register SBI is set to SBI = 1.
Here, the register SB is provided in the storage device 1b as a homophone index. That is, it is assumed that the characters of the homophone buffer SB indicated by the register SBI are displayed on the display device 1d.
Next, in step S9, it is determined whether or not the content of the homophone buffer SB indicated by the register SBI is "eos", that is, whether or not the content is the last. If “eos”, go to step S10,
Perform predetermined processing. On the other hand, if it is not "eos", the process proceeds to step S11, and the character in the homophone buffer SB indicated by the register SBI is displayed on the display device 1d. In the case of FIG. 4, SBI = 1 and “outside car”, SBI = 2 and “company” are SBI
= 3 and “eos” is stored in the homophone buffer SB.

Next, in step S12, it is determined whether or not the next candidate key 2c has been pressed. When the next candidate key 2c is pressed, the process proceeds to step S13, the register SBI is incremented by 1, and the process returns to steps S9 and S11 to display the next character in the homophone buffer SB. On the other hand, when the next candidate key 2c is not pressed in step S12, the process proceeds to step S14, and it is determined whether the conversion key 2b is pressed.

If it is determined in step S14 that the conversion key 2b has not been pressed, the flow advances to step S15 to perform a predetermined process. On the other hand, if the conversion key 2b has been pressed, step S16
To fix the unconverted kanji displayed on the display device 1d. That is, for example, when the conversion key 2b is pressed in the state of (E) in FIG. 3, since SBI = 2, the character "company" which is the content of the homophone buffer SB indicated by SBI = 2 is fixed. Is done.

As described above, according to the present embodiment, at the time of a dictionary search for a character string to be converted that starts with a voice sound, the process of converting the first voice character to a clear character can be automatically performed. The operation of deleting the character and replacing it with a new character is omitted, thereby greatly improving operability.

As described above, in this embodiment, the character string sandwiched between the kanji start / end keys 2d is set as the converted character string. Instead, the unconverted character input as in the sequential conversion method is set as the converted character string. It may be a converted character string.

Furthermore, in the present embodiment, the case where the present invention is mainly applied to the voiced sound has been described, but the same processing can be easily realized also for the voiced sound. For example, if a semi-voiced sound table as shown in FIG. 8 is added to the voiced sound table shown in FIG. 7, the voiced sound can also be realized by the above-described control means.

Furthermore, in the present embodiment, the description has been made assuming that the next candidate kanji is sequentially displayed on the display device, but instead of this, a case where many candidate kanji are displayed at once on the display device is the same as in the present invention. The effect can be demonstrated.

In addition, in the present embodiment, the order in which the kanji candidates are displayed is the order in which the kanji candidates are stored in the homophone buffer SB. However, the effects of the present invention are not impaired. However, at this time, whether or not to see the frequency information including the clear tone may be selected in each system.

[Effects] As described above, according to the present invention, a kana character string representing the second and subsequent kanji readings in a kana character string representing a plurality of consecutive idiom readings is designated as a conversion target kana character string. If the first character of the kana character string to be converted is a voice sound or a semi-voiced sound, the specified kana character string and the kana character string obtained by converting the first character of this kana character string to a kiyana kana character are converted. So that the conversion is executed as
Even in the case of a kana character string in which the first character has been changed to a voiced sound or a semi-voiced sound due to rendaku, an effect that a correct kanji notation can be obtained without requiring operations such as character correction and re-input.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of one embodiment of the present invention, FIG. 2 is a diagram showing an example of a key top of a keyboard applied to the present invention, and FIG. 3 is a display example of the present invention. FIG. 4 is an explanatory diagram showing an example of a homophone buffer of the present invention. FIGS. 5 and 6 are flowcharts each showing an example of a control process of the present invention. FIG. 7 is an embodiment of the present invention. FIG. 8 is an explanatory diagram showing an example of a semi-voiced sound table according to another embodiment of the present invention. 1a CPU, 1b storage device, 1c input device, 1d display device, 2 keyboard.

Claims (1)

(57) [Claims] An input means for inputting a kana character string; a storage means for storing a kana character string input from the input means; a dictionary means for storing word reading and kanji notation in association with each other; A kana-kanji conversion means for searching a dictionary means and converting a kana character string representing a word reading into a corresponding kanji notation; and a plurality of consecutive kana-kanji characters stored in the storage means as conversion targets by the kana-kanji conversion means. Means for designating a kana character string representing the second and subsequent phrases in the kana character string representing the pronunciation of the idiom, and whether the first character of the designated kana character string by the designation means is a voiced sound or a semi-voiced sound Discriminating means for discriminating; kana character converting means for converting a voiced or semi-voiced kana character into a corresponding clear-tone kana character; determining that the first character of the designated kana character string is a voiced or semi-voiced character In such a case, the specified kana character string and the kana character string obtained by converting only the first character of the specified kana character string to the kana character kana character by the kana character conversion means are to be converted and executed. Control means for controlling the kana-kanji conversion means.