JPH0354661A - Kana alphabet conversion input method - Google Patents

Abstract

PURPOSE:To easily input alphabets with KANA (Japanese syllabary) keys by inputting KANA characters referring to a state transition diagram by input KANA characters, obtaining a new state from this state transition diagram and obtaining alphabets from the state transition diagram as output characters at the time of the end of input of KANA characters. CONSTITUTION:The input code inputted by a character input device K is converted by any of a character input driver B2, an input routine A2, or a conversion program D. The pronunciation of alphabets to be inputted is inputted with KANA characters, and the state transition diagram where output characters are preliminarily set with correspondence between plural states and each input KANA character is referred at each time of input of a KANA character. The obtained new state is defined as the present state to obtain another new state from the state transition diagram in accordance with the next input KANA character, and the code of alphabets is obtained from the state transition diagram at the time of the end of input of all KANA characters related to the pronunciation of alphabets and is inputted to the program side. Thus, alphabets are inputted by conversion only with KANA keys.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a kana/alphabetic conversion input method that allows input of alphabets using an input device capable of inputting kana codes.

<Prior Art> Conventionally, character input means for computer programs include inputting alphabetic characters using alphabetic keys, inputting kana and kanji through Roman character conversion using alphabetic keys, inputting kana and kanji using kana keys, and inputting numbers using numeric keys. is common, and especially when using Romaji, all alphabetic characters, kana, and kanji can be entered using only the alphabetic keys.

<Problems to be Solved by the Invention> As described above, alphabetic input has been the mainstream as a conventional means of inputting characters into computer programs, but with the rapid spread of personal computers in recent years, it has become increasingly common for humans to interact directly with computers. In response to the rapid increase in opportunities for dialogue, there is a trend for computer operations to be translated into Japanese. Therefore, it is conceivable that Japanese word processor operators will also serve as computer operators in the near future, but currently Japanese word processor operators input kana and kanji using kana keys, and input alphabetic characters using kana and shift keys. I am not used to using alphabetic keys. For this reason, it is expected that users will be confused by the alphabetic keys when operating a computer.

The present invention has been made in view of the occurrence of such problems expected in the future, and provides a kana/alphabetic conversion input method that allows alphabets to be input using a key input device that can input kana codes. This is a technical issue.

<Means for Solving the Problems> In the present invention, as a technical means for achieving the above-mentioned problems, the kana/alphabetic conversion input method is performed by the following means. That is, in the alphabet mode, the pronunciation of the alphabet to be input is input using kana characters, and each time this kana character is input, each input kana character is associated with a plurality of states, and a new state or the corresponding one is individually created. Refer to the state transition diagram in which the new state and output characters are set in advance, and use the new state obtained from the state transition diagram as the current state, and obtain a new state from the state transition diagram using the next input kana character. , when all the kana characters related to the pronunciation of the alphabet have been input, the code of the alphabet is obtained from the state transition diagram and input to the program side.

Effect> When entering kana characters in alphabet mode,
Initially, the current state is set to "O", the state transition diagram is referred to from the input kana character, a new state is obtained from this state transition diagram, the new state is set as the current state, and the state is changed from the next input kana character. When the next new state is obtained and all the kana characters related to the pronunciation of each alphabet have been input, the alpha head is obtained as an output character from the state transition diagram.

In this way, by inputting the pronunciation of Alphabet Noto in Kana characters, you can convert it into alphabetical characters.
Even a Japanese word processor operator who is accustomed to operating kana keys but is not good at operating alphabet keys can easily input alphabet letters using the kana keys.

Embodiment> Hereinafter, a preferred embodiment of the present invention will be described in detail with reference to the drawings.

First, the relationship between the application program A and the character input device K will be explained with reference to FIG. , a character input driver 82 of operating system B and an input routine A2 of application program A intervene, and in some cases, a conversion program D intervenes to convert character codes. Therefore, input code conversion can be performed using either the character input driver 82, input routine A2, or conversion program D.
The kana-alphabetic conversion according to the present invention may also exist in any of the above. Note that 81 in the figure is a portion of the operating system B other than the character input driver B2.

Next, the structure of conversion input will be explained with reference to FIG. 4. Conversion input is performed by adding kana/alphabet conversion in the alphabet mode of the present invention to the existing romaji conversion in the romaji mode and kana/kanji conversion in the kanji input mode. Let's do it. That is, conversion to kana in romaji mode using alphabet keys and alphabetic character conversion in non-roman mode, conversion to alphabet in alphabetic mode using kana keys, kana conversion in non-alphabetic mode, and kanji input mode after these conversions. Conversion processing to full-width kanji can be performed. Then, the kana/alphabetic conversion of the present invention is performed in the second
When kana characters related to the pronunciation of each amalgam alphabet shown on the left side of the figure are input, they are converted into the corresponding alphabets on the right side and sent to the application program A side.

FIG. 1 shows a flowchart of the above-mentioned kana to alphabet conversion routine, which will be described below. This conversion routine is processed every time one kana character is input. When one kana character is input, it refers to the state transition diagram and converts the current state and input kana character into an output character. Obtain the state (step Sl). The state transition diagram shows, for example (f 34 of "0" to "33" as the current state).
25 used for the input kana characters shown in Figure 2 for the state
3 showing the kana characters, voiced sounds, semi-voiced sounds, and long sounds respectively.
The output characters and new states are individually set in advance by associating these symbols with each other.

Initially, an output character and a new state are obtained from the input kana character in the state "O", but as is clear from Figure 2, there is no alphabet that can be obtained only from the kana L character, so the state transitions in step S2. It is determined that there are no output characters in the diagram, and the process jumps to step S4. Here, although there are no output characters in the state transition diagram, there is a new state, so after this new state is newly set as the current state (step S5), the same operation can be repeated. From this newly set current state and the next input kana character, refer to the state transition diagram to determine the output character and new state, and if there is an output character,
The output characters are sent to the output bath sofa and temporarily stored (step S5). If an erroneous operation is made, not only the output characters but also the new state will not exist in the state transition diagram, and if NO is determined in step S4, the current state will be changed to “
0” (step S6), “O”
If not, the current state is set to “0” (step S7).
After that, the process jumps to step S1.

The above operation will be explained using an example. When the current state is "O" and "ヰJ" is input, "6" is obtained as a new state without any output character in the state transition diagram, and this "6"
If "YU" is input after setting "7" as the current state, "7" is obtained as the new state without any output character in the state transition diagram, and furthermore, after setting "7" as the current state, ,
Next, when "U" is input, rQJ is obtained as the output character and "0" as the new state in the state transition diagram, and this rQJ is temporarily stored in the output bus sofa and the current state is changed to "0".
” and wait for the next kana character to be input.

Also, if the current state is "O" and "J" is input, there will be no output characters in the state transition diagram and the new state will be "".
1” is obtained, set this “l” to the current state, and then “
When "a" is input, there is no output character in the state transition diagram and "2" is obtained as the new state, and furthermore, when the current state is "2" and "a" is input next, In the state transition diagram, rAJ is obtained as the output character and "3" is obtained as the new state. This rAJ is temporarily stored in the output bus sofa, the current state is set to "3", and the next kana character is input. When "i" is subsequently input, rlJ is obtained as the output character and "O" is obtained as the new state in the state transition diagram. That is, when the kana characters ``工'', ``i'', ``a'', and ``i'' are input successively, they are converted into the alphabets rAJ and rlJ.

On the other hand, enter the above-mentioned “ENG” and “I” and the new state will be “
If "CH" is keyed in after "CH" is set to "2", rHJ is obtained as the output character and "0" is obtained as the new state in the state transition diagram.

In the same way, enter “ENG” and “I” to change the new state to “2”.
”, when “U” is input, rAJ is obtained as the output character and “31” is obtained as the new state,
If this "31" is set as the current state, "32" will be obtained as the new state only if a voiced sound symbol is entered subsequently, and if any other character is entered, it will be considered an erroneous operation. When the current state is set to "32", rVJ is obtained as the output character and "0" is obtained as the new state only when "i" is keyed in next time.

<Effects of the Invention> As described above, by applying the kana/alphabetic conversion input method of the present invention to an input device that can input kana characters or an input device that does not have an input means for alphabetic characters, alphabets can be converted and input using only kana keys. be able to. In particular, in the near future when computer operations are expected to be translated into Japanese, this will eliminate the problem of confusion caused by Japanese word processor operators who are not familiar with alphabetic keys when they also serve as computer operators. .

[Brief explanation of drawings]

Figure 1 is a flowchart of a conversion routine according to an embodiment of the present invention, Figure 2 is a correspondence diagram between input kana characters and output alphabets, and Figure 3 is the relationship between the application program of the applicable equipment and the character input device. Figure 4 is a configuration diagram of the conversion input.

Claims (1)

[Claims] (1) In alphabet mode, input the pronunciation of the alphabet to be input using kana characters, and each time this kana character is input, each input kana character is associated with multiple states, and a new state or corresponding state is created individually. Referring to a state transition diagram in which a new state and output characters are set in advance, the new state obtained from the state transition diagram is set as the current state, and a new state is further obtained from the state transition diagram using the next input kana character. A kana/alphabetic conversion input method in which the code of the alphabet is obtained from a state transition diagram and input to the program side when the input of all the kana characters related to the pronunciation of Beto is completed.