JPH064533A - Hangul character input system - Google Patents

Abstract

(57) [Summary] [Structure] When a consonant that may become a patch is input, it is checked whether the character is registered in the Hangul character file (step 312). It is checked whether or not the priority is 1 (step 313), and if 1 is the first consonant of the next character (step 310). [Effect] Since the Hangul character display screen can be changed in the same manner as human input, smooth input is possible.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for inputting Hangul characters.

[0002]

2. Description of the Related Art A conventional Hangul input method is first used when there are two possibilities of an input key, which is a patchum and a leading consonant of the next character, as in the 29th National Convention of Information Processing Society, 3J-2. , If there is a vowel character input next, expressing it as a patchum, it was common to remove the patchum of the previous character and change to the first consonant of the current character.

[0003]

However, the display of an incorrect character shape, even temporarily, causes many changes in the screen, which hinders smooth input.

An object of the present invention is to correctly determine which of two cases, a patchum and a leading consonant of the next character, is possible.

[0005]

In order to achieve the above object, the present invention inputs characters by referring to a file that stores the priority of appearance for each Hangul character.

[0006]

[Operation] Each time a patchum character is input, the priority of appearance of the Hangul character in the Hangul character file is determined,
If the priority is high, it is displayed as a patch. If the priority is low, it is displayed as the first consonant of the next character.

[0007]

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

FIG. 1 is a flowchart of the entire processing of the present invention, FIG. 2 is a flowchart of vowel character input processing, and FIG.
Is a flowchart of consonant character input processing, and FIG. 4 is a configuration diagram of a Hangul input device.

In these figures, reference numeral 1 denotes an input device, which performs a process of reading a character string. 2 is a central processing unit. An output device 3 outputs a conversion result. Four
Is a storage device that stores data necessary for translation, and includes an undetermined character string buffer, a determined character string buffer, and a Hangul character file.

FIG. 5 is an explanatory diagram of a buffer that stores a confirmed character string. One Hangul character is represented by 2 bytes. The Hangul character is composed of three parts, a first consonant, a vowel, and a patchum, each of which is assigned a 5-bit code. This gives 2 to 6
Bit consonant is the first bit, bits 7 to 11 are vowels, 12
The 16th bit from is assigned to the patch to represent the character. The patch part may be omitted.

FIG. 6 is an explanatory diagram of a buffer that stores an undetermined character string.

FIG. 7 is an explanatory diagram of a Hangul character file storing the priority of Hangul characters. Each record is
A Hangul character area 71 in which a Hangul character with a patchum is described for each head consonant, vowel, and patchum, and an area 72 in which priority is stored. When the priority value is 0, it indicates that the Hangul characters are not likely to be used, and when the priority value is 1, it indicates that the Hangul characters are likely to be used.

FIG. 8 is a display example of a Hangul input screen. The contents of the confirmed character string buffer and the contents of the unconfirmed character string buffer are sequentially displayed on the screen.

FIG. 9 is a display example of a Hangul input screen. The contents of the fixed character string buffer are displayed on the screen.

Next, the processing method of the present invention will be described with reference to the flow chart shown in FIG. First, the pressed key is read from the input device 1 (step 101), it is determined whether the pressed key is a vowel character (step 102), and if it is a vowel character, vowel character processing is performed (step 103). ). The vowel processing will be described later. If it is not a vowel character, it is determined whether the pressed key is a consonant character (104), and if it is a consonant character, consonant character processing is performed (step 105). Consonant processing will be described later. If it is not a consonant character, it is judged whether the pressed key is the return key (step 106). If it is the return key, the previous character is confirmed and the character in the unconfirmed character string buffer is changed to the confirmed character string buffer. Move (Step 10
7). If it is not the return key, it is judged whether or not the pressed key is the space key (step 108). If it is the space key, the previous character is confirmed, and a blank is added to the confirmed character string buffer (step). 109).
If it is not the space key, the input is invalidated as error processing (step 110). Next, it is determined whether the input is completed (step 111). If not completed,
The same process is repeated until the input is completed.

Next, the vowel character processing method will be described with reference to the flow chart shown in FIG. First, it is checked whether or not there is a leading consonant of a character (step 201). If there is a leading consonant, the character is directly connected to the consonant to form and display the character (step 202). If there is no leading consonant, it is checked whether the previous character has a patchum (step 203),
If there is no patch, the input is invalidated as an error process (step 204). If there is a patch, remove the patch of the previous character and confirm the previous character (step 20).
5) Change the priority value of the Hangul characters in the Hangul character file to 0 (step 206). As a result, the Hangul characters will not be displayed preferentially from the next time. Further, the removed patchum portion is set as the first consonant of the current input character (step 207), and the input vowel is followed by a character to be displayed (step 207).

Next, a consonant character processing method will be described with reference to the flowchart shown in FIG.

First, it is checked whether the leading consonant of the input character has already been input (step 301), and if it is input, it is determined whether this leading consonant can be added to the preceding character as a patch (step 302). , If not possible,
The input is invalidated as error processing (step 30).
3). If it can be added as a patchum, the first consonant is added to the previous character as a patchum, and the input consonant is set as the first consonant of the input character (step 304). Further, the priority value of the Hangul characters in the Hangul character file is changed to 1 (step 305). As a result, this Hangul character is preferentially displayed from the next time.

If the first consonant is not yet input to the input character, it is first checked whether or not the previous character is fixed (step 306). If it is confirmed, the input consonant is set as the leading consonant of the input character (step 307).
If the previous character is not fixed, it is checked whether it is immediately after the vowel character is input (step 308). If not, it is checked whether the previous character in the unfixed character string buffer has a double consonant. It is checked (step 309), and if there is a double consonant, the input is made the leading consonant (step 310). If there is no double consonant in the previous character, it is checked whether the input key can be combined with the patchum of the previous character to form a double consonant patchum (step 311). (Step 310). If the double consonant patchum is possible, the Hangul character file is referred to check whether there is a character including the double consonant patchum (step 312). If not, the input is set to the first consonant (step 310). . If there is a character including a double consonant patchum, it is checked whether the priority value in the Hangul character file is 1 (step 313), and if it is not 1, the input is regarded as the first consonant (step 310). If the priority value is 1, the input is patchy (step 314).

If the vowel character has just been input, the Hangul character file is referenced to check whether there is a character containing a patchum (step 312). If not, the input is made the first consonant (step 310). ). If there is a character including a patch, it is checked whether the priority value in the Hangul character file is 1 (step 313), and if it is not 1, the input is set to the first consonant (step 310). If the priority value is 1, the input is set to patchum (314).

As an example, "s, a, r, a, m, f,
Consider the case where the keys "w, r, space, m, a, n, n, a, d, a, return" are sequentially input.

When s and a are sequentially input, the contents of the undetermined character string buffer change in the order of 601, 602. When r is input, the value of the evaluation value for the Hangul character "s ar" in the Hangul character file is 1, so the characters including the patch are given priority, and the contents of the undetermined character string buffer change to 603. To do. Next, when you input a, you can see that the patched r is the first consonant, so the previous character is confirmed as "s a" and transferred to the confirmed character string buffer, and r is the first consonant of the next character, a Is written in the undetermined character string buffer as the next vowel. At this time, the states of the fixed character string buffer and the unconfirmed character string buffer are 51 and 6
04. Next, when m is input, the value of the evaluation value for the Hangul character "ram" in the Hangul character file is 1, so m is a patch and the state of the undetermined character string buffer is 605. Next, when f is input,
Since double consonant patchum is not possible, fix the previous character and move it to the fixed character string buffer, and let f be the first consonant,
Fill in the undetermined character string buffer. At this time, the states of the confirmed character string buffer and the unconfirmed character string buffer are 52 and 606.
Is.

Similarly, when w and r are sequentially input, the contents of the undetermined character string buffer change in the order of 607 and 608. Next, when the space key is input, the previous character is confirmed, and the space character is written in the confirmed character string buffer. The states of the confirmed character string buffer and the unconfirmed character string buffer at this time are 53 and 609. Next, m, a, n
Similarly, the value of the unconfirmed character string buffer changes in the order of 610, 611, and 612. next,
If n is input, the patch of the double consonant is impossible, so the previous character is confirmed and moved to the confirmed character string buffer, and n is set as the first consonant in the unconfirmed character string buffer. The states of the confirmed character string buffer and the unconfirmed character string buffer at this time are 54 and 613, respectively.

Next, when a is input, the contents of the undetermined character string buffer are changed to 614. Then type d
Hangul character "n a d" in Hangul character file
Since the evaluation value for is 0, d is written in the undetermined character string buffer as the first consonant of the next character. This state is 615. Next, when a is input, the previous character is confirmed, it is transferred to the confirmed character string buffer, and a is registered in the unconfirmed character string buffer as a vowel character. At this time, the states of the confirmed character string buffer and the unconfirmed character string buffer are 55 and 6, respectively.
Sixteen.

Finally, when the return key is input, all the characters in the unfixed character string buffer are fixed and moved to the fixed character string buffer. As a result, the contents of the confirmed character string buffer and the unconfirmed character string buffer become 56,617.

In this process, the content of the Hangul character file changes from the state shown in FIG. 7A to the state shown in FIG. 7B.

In this process, the Hangul display screen continuously displays the contents of the confirmed character string buffer and the unconfirmed character string buffer, and the screen changes as shown in FIG.

There is also a method of displaying only the contents of the fixed character string buffer when displaying the Hangul characters. In this case, the screen transitions as shown in FIG.

[0029]

According to the present invention, since the Hangul character display screen can be changed in the same manner as a human input, smooth input is possible.

[Brief description of drawings]

FIG. 1 is a flowchart of an input process showing an embodiment of the present invention.

FIG. 2 is a flowchart of vowel input processing.

FIG. 3 is a flowchart of consonant character input processing.

FIG. 4 is a block diagram of a Hangul input device.

FIG. 5 is an explanatory diagram of a fixed character string buffer.

FIG. 6 is an explanatory diagram of an undetermined character string buffer.

FIG. 7 is an explanatory diagram of a Hangul character file.

FIG. 8 is an explanatory diagram of a Hangul input screen.

FIG. 9 is another explanatory diagram of the Hangul input screen.

[Explanation of symbols]

1 ... Input device, 2 ... Central processing unit, 3 ... Output device, 4 ...
Storage device.

Claims (3)

[Claims] 1. A Hangul character input method, wherein in a device for inputting Hangul characters, character input is performed by referring to a file storing the priority of appearance for each Hangul character. 2. The Hangul character input method according to claim 1, further comprising means for increasing the priority of a character used recently. 3. The Hangul character input method according to claim 1, wherein the character is displayed each time a character is determined.