JP4302918B2 - Hangul character generation method and dictionary lookup method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
  The present invention relates to a Hangul character generation method capable of easily and reliably generating a Hangul character, and a dictionary lookup method for searching meanings in Japanese and other languages from a Hangul character input by the Hangul character generation method.
[0002]
[Prior art]
  One Hangul character is composed of a grapheme corresponding to a consonant and a grapheme corresponding to a vowel. The consonant and vowel composition patterns in one Hangul character can be classified into the following three types as shown in FIG. (A) Consonant + vowel. (B) Consonant + vowel + consonant. (C) consonant + vowel + consonant + consonant.
[0003]
  In addition, the arrangement pattern of the grapheme corresponding to the vowel can be classified into the following three types as shown in FIG. (A) It is arranged on the right side of the consonant (hereinafter referred to as a vertical vowel). (B) It is arranged below the consonant (hereinafter referred to as a horizontal vowel). (C) It is arranged on the right side and the lower side of the consonant (hereinafter referred to as vertical and horizontal vowels).
[0004]
  One Hangul character can be expressed as follows from the configuration patterns (A) to (C) and the vowel arrangement patterns (a) to (c). In (A), consonant + vertical vowel (a) or horizontal vowel (b) or vertical and horizontal vowel (c). In (B), (A) + consonant is placed on the lower side. In (C), (A) + consonant placed on the lower left side + consonant placed on the lower right side.
[0005]
  For example, in a word processor, to input a Hangul character in a Roman character type, a reading for each character element is input by an alphabet key in order according to an input rule. For a single Hangul character, character data corresponding to the input reading is extracted, and then placed in the specified position in order. Adjust to the correct size and shape.
[0006]
  The above-mentioned Roman alphabet type input of the Hangul character cannot be input unless at least how to read the Hangul character is understood. Therefore, for example, Japanese Patent Publication No. 2-2408 has proposed a composite input device for Korean characters (hereinafter referred to as a conventional device) that can be input without being able to read Korean characters.
[0007]
  The conventional apparatus is configured to input one Hangul character with the following two-digit code number. Code numbers 01 to 51 that classify consonants and vowels into 51 types of grapheme in reading units. Code numbers from 01 to 12 that classify the notation positions (notation type) of consonants and vowels into 12 types in one Hangul character.
[0008]
  An example of a procedure for inputting one Hangul character by a conventional apparatus is shown.
  For example, the consonant A is composed of the letter a and is numbered “09”.
  For example, the vowel B is made up of the letter b and numbered “41”.
  In addition, for example, it is assumed that the consonant C composed of the letter a and a apart from the consonant A is numbered “19”.
[0009]
  In the conventional apparatus, for example, one Hangul character composed of consonant C and vowel B is input as follows.
  For example, “05” is input as the number of the notation position of the consonant C, and the number “19” of the consonant C is continuously input (input “0519”).
  Subsequently, for example, “06” is input as the number of the vowel B notation position, and the number “41” of the vowel B is continuously input (input “0641”).
[0010]
[Problems to be solved by the invention]
  By the way, if you don't understand the Hangul characters, you have to type: In other words, looking at one Hangul character, the fonts are selected so as to have the same appearance. The selected grapheme is arranged at the same position on the appearance of one Hangul character.
[0011]
  The conventional apparatus can be input by a person who does not understand the Hangul character by selecting the same character element in appearance and designating the arrangement position of the selected character element. However, when the conventional apparatus inputs, for example, one Hangul character composed of the above-described consonant C and vowel B, the following problems may occur.
[0012]
  That is, the conventional apparatus classifies the consonant A “09” composed of the letter a, separately from the classification of the consonant C “19” composed of the letter a, a. Therefore, consonant A “09” may be input twice as consonant C. If input is made in this way, the conventional apparatus determines that the previous two-digit number is the display position number, and does not correctly convert the intended Hangul character. As a result, even if it is the same as a Hangul character composed of consonant A and vowel B, it may not be recognized if it is input with consonants C and C and vowel B. In addition, it is difficult to use because the user must always be aware of the placement position of the grapheme.
[0013]
  The present invention solves the above-mentioned problem, a method for generating Korean characters that can easily and reliably generate Korean characters, and further, meanings of Japanese and other languages from Korean characters input using the Korean character input system. An object of the present invention is to provide a dictionary lookup method for searching for.
[0014]
[Means for Solving the Problems]
  In order to achieve the above object, the Hangul character generation method of the present invention is as follows. First, in the present invention, a personal computer, a PDA, or a mobile phone is used. Whether the glyphs used to generate a Hangul character are consonants or vowels for each glyphInformation indicating, Single or compositeInformation indicating, Possible placement positionsIndicateGemme information consisting of informationWhenCategorize them so that they are on the same line for each similar grapheme in appearanceTheMatrix andTheIt is stored in a hard disk or server as a character storage means. In order to read out the grapheme from the grapheme storage means, this matrix is displayed on the display screen, and is specified by an appearance delimiter by an input device for specifying and inputting the grapheme in the matrix on the screen display. This is done by inputting the matrix-like grapheme.
[0015]
  After reading the character data and the element information from the element storage means for the specified input element,Based on the glyme informationDetermine whether it is a consonant or a vowel. The read grapheme isIf it is a consonant, it is determined whether there is a consonant in the previous input.Whether or not it can be combined with another grapheme, such as forming one grapheme by overlapping the minimum configuration, or combining onesTo temporarily set the position information. If the read-out grapheme is a vowel, it is analyzed whether it is a vertical vowel, horizontal vowel, or vertical / horizontal vowel, and it is determined whether or not it can be combined. Temporarily set location information. And when a vowel is input for at least one consonant,theseConsonant or vowel location informationOn the basis of the,CandidateSearch for Hangul charactersAnd display the Hangul characters extracted by the search.
[0016]
  The Hangul character generation method of the present invention thus configured can obtain the following effects. It is easy to specify the grapheme because it classifies by the similar grapheme appearance. When specifying a single grapheme that combines the minimum composition of a grapheme, even if the grapheme itself is specified or the minimum component is specified multiple times, the correct grapheme is specified. . Hangul characters can be generated simply by selecting a font so that the appearances are the same.
[0017]
  The dictionary lookup method of the present invention performs the following processing. Semantic information that associates the headings in Hangul characters with the meanings of Japanese and other languagesAs a hard disk or serverI remember it. Then, based on the Hangul character generated by the above-described Hangul character generation method of the present invention, the semantic information is retrieved from the meaning storage means by the Hangul character and read out.On the displayindicate.
[0018]
  The dictionary lookup method of the present invention thus configured can obtain the following effects. You can understand the meaning even if you don't have any knowledge about Korean characters (and Korean) you want to input.
[0019]
DETAILED DESCRIPTION OF THE INVENTION
  Definitions in the method for generating Korean characters according to the present invention are shown below. The “input device having a matrix classified for each grapheme having similar appearance” means the following. “Classified by similar elements with similar appearance” means that the user can easily separate (recognize) the appearance of character elements corresponding to consonants and vowels in one Hangul character. It means that it was classified by each.
[0020]
  The “matrix” means, for example, a code table in which character elements constituting a Hangul character are assigned to, for example, vertical 1 to 9 and horizontal 1 to 9 sections for each similar character element. “Input device” means, for example, a keyboard having the matrix described above.
[0021]
  “Processing to display a matrix classified by grapheme with similar appearance” means the following:. BookHangul character generation method of the inventionUsed inWith a mobile phone or personal computer (hereinafter referred to as a personal computer)IsThe matrix does not have the number buttons and keyboard that are included. Therefore, in the present invention, it means processing for displaying a matrix on a display screen of a mobile phone or a personal computer. That is, the present inventionThenOn a mobile phone or personal computer, a matrix is displayed on the screen, and a grapheme is specified and input in the matrix on the screen display.
[0022]
  Therefore, the Hangul character generation method of the present invention can be implemented by executing a program that is installed (installed) in a mobile phone or a personal computer. Accordingly, the “character element storage means” means, for example, a hard disk or a server that stores the character elements.
[0023]
  In the Hangul character generation method of the present invention, a character element in a matrix is designated and input, and character data and character element information are read out for the character element input from the character element storage means. Thereafter, it is determined whether the read-out grapheme is a consonant or a vowel based on the grapheme information, and it is determined whether the currently read-out grapheme can be combined with the previously read-out grapheme.
[0024]
  Here, the processing of “determining whether consonant or vowel” and “determining whether or not compounding is possible” is performed based on the following principle, for example. In other words, information on whether a “consonant” or “vowel” and information on “single” or “composite” are added for each of the grapheme stored in the grapheme storage means. Then, when reading the grapheme, it is determined based on these information.
[0025]
  In this way, the user does not need to be aware of consonants and vowels for the input grapheme. In addition, the user can correctly process a grapheme composed of a minimum configuration even if the minimum configuration is continuously input a plurality of times or a single grapheme that combines the minimum configuration is input once. it can.
[0026]
  Then, the arrangement position is analyzed for the grapheme determined as described above. Here, the process of “analyzing the arrangement position” is performed based on the following principle, for example. As described above, the position of vertical vowels, horizontal vowels, and vertical and horizontal vowels is determined for a grapheme that is a vowel in one Hangul character.
[0027]
  Therefore, the positions where the remaining consonants (1 to 3) can be arranged are narrowed down as candidates with the arrangement of the vowels as the center, and further narrowed down in relation to the number of input glyphs one after another (excluding impossible arrangements) ). Further, for example, the analysis may be performed from the relationship between the number of input graphemes and the arrangement of the vowels. The layout analysis of these fonts will be described in detail in a later embodiment.
[0028]
  As described above, when the above processing is completed for all the character elements of one Hangul character, the arrangement of the character elements is determined and displayed. By doing in this way, even if it is used by the person who does not have the knowledge of a Hangul character, the target Hangul character can be produced | generated easily and reliably with high precision.
[0029]
  The dictionary lookup method of the present invention performs the following processing based on the Hangul character generated by the above-described Hangul character generation method. Here, the semantic information is stored in a semantic storage means such as a hard disk or a server as described above. Semantic information having the Hangul character is retrieved from a semantic storage means that stores semantic information in which a headline using a Hangul character is associated with the meaning of Japanese or another language. Thereafter, the retrieved semantic information is read and displayed.
[0030]
  In this way, the Hangul characters are easily generated by the above-described Hangul character generation method, so it is easy to look up the dictionary of Korean characters (Korean) and quickly understand the meaning of Japanese and other languages. .
[0031]
【Example】
  Embodiments of the present invention will be described below with reference to the drawings.
  FIG. 1 shows a matrix of grapheme used in the present invention. FIG. 2 shows a display example on a mobile phone. FIG. 3 shows the rules for constructing Korean characters. FIG. 4 shows an example of the Hangul character generation method of the present invention. FIG. 5 shows a consonant character arrangement pattern in the method of FIG. FIG. 6 shows the dictionary lookup method of the present invention. FIG. 7 shows another example of the Hangul character generation method of the present invention. 8 and 9 show still another example of the Hangul character generation method of the present invention. FIG. 10 shows a screen display example when a program for executing the Hangul character generation method of the present invention is installed in a personal computer. FIG. 11 shows an input device having a matrix used in the present invention.
[0032]
  In the present embodiment, the Hangul character generation method and the dictionary lookup method of the present invention are applied to a mobile phone that can be connected to the Internet. That is, the Hangul character generation method and dictionary lookup method of the present invention are incorporated into a mobile phone as a program when the mobile phone is connected to a server on the Internet, and operates the mobile phone. Therefore, in the following description, the present invention will be referred to as a Korean character generation program and a dictionary lookup program.
[0033]
  In the Korean character generation program and dictionary lookup program of the present invention,informationAnd meaninginformationIs stored on the server.serverHas all Korean characters, grapheme, grapheme information, the following matrix M, and an operation program. The grapheme information has a placement code (described later) that indicates location information that may be placed, whether it is a consonant, a vowel, a single unit, or a composite for each grapheme. on the other hand,serverHas, for example, Japanese reading, Japanese semantic information, and an operation program for Hangul character headings.
[0034]
  In this embodiment, the mobile phone does not have the matrix M. ThereforeserverOutputs an operation program together with the matrix M when a mobile phone is connected. The mobile phone receives these, displays the matrix M, and incorporates an operation program. The operation program includes a program for displaying the matrix M on the screen of the mobile phone, a program for designating the fonts on the matrix M displayed by the button operation of the mobile phone, and the like.
[0035]
  on the other hand,serverThe operation program inserverA program for generating a search execution signal forserverA program for displaying semantic information output from the mobile phone on the screen of the mobile phone.
[0036]
  FIG. 1 shows the matrix M described above. Matrix M (and display on mobile phone screen)server(Assignment state of each grapheme) is classified so as to be the same line for each of the similar grapheme in appearance. For example, the matrix M is divided into two by assigning consonants to horizontal 1 to 3 and vowels to horizontal 4 to 7 columns. And the minimum composition of a grapheme is arrange | positioned in the vertical 1-9 of the horizontal 1 row | line | column of a consonant.
[0037]
  More specifically, in each row of the horizontal column 1, for example, a minimum consonant configuration is arranged, such as “F” (hereinafter, a grapheme is replaced by a notation such as katakana). In each row of the horizontal two columns, a consonant grapheme in which the appearance of each row of the horizontal one column is slightly changed (for example, in a state where one line is added) is arranged. In each row of the horizontal three columns, a single character element in which two character elements in each row of the horizontal one column are combined, such as “Huff” with respect to the above “F”, is arranged.
[0038]
  Further, the minimum configuration of vowels is arranged in each row of the horizontal four columns. In each row of the horizontal 5 columns, vowel grapheme in which the appearance of each row in the horizontal 4 column is slightly deformed (for example, in a state where one line is added) is arranged. In each row of the horizontal 6 columns, a grapheme in which the grapheme of each row in the horizontal 4 column and other vowels are combined is arranged. In each row of the horizontal 7 columns, a vowel grapheme whose appearance is deformed (for example, in a state where one line is added) is arranged with respect to the grapheme of each row of the horizontal 6 columns.
[0039]
  The arrangement of the matrix M in this embodiment is such that consonants and vowels are divided into three and four columns, respectively, the minimum configuration of each is arranged in the first column, and consonants with similar appearance in the same row or Since vowels are arranged, it is easy for the user to find a grapheme and to input it easily. In addition, since it classified according to the character element which the external appearance is similar, the division without a character element also arises.
[0040]
  In this embodiment, when the mobile phone is connected to the server, as shown in FIG. 2A, the screen is displayed with the matrix M, the input monitor display 1A, the 1-character clear display 1a, the all-clear display 1b, and the previous (return). Display 1c, next (feed) display 1d, dictionary lookup display 1e, and input confirmation display 1f are displayed. These displays can be operated by the buttons of the mobile phone with the above-described program incorporated therein. Further, the cellular phone displays the dictionary lookup result display 1g by switching the screen as shown in FIG.
[0041]
  The Hangul character generation program of the present invention incorporated in a mobile phone generates a Hangul character from the input text as follows. First, FIG. 3 shows the principle of arrangement of grapheme. The grapheme is based on the vowel arrangement cases (a), (b) and (c) in types A, B and C.(1),(3),(4)Is determined as follows.In addition, the numbers in the figure shown in the figure are indicated by numbers in parentheses in the specification.
[0042]
  Type A:(1)Consonant +(2)vowel. Type B:(1)Consonant +(2)Vowel +(3)consonant. Type C:(1)Consonant +(2)Vowel +(3)Consonant +(4)consonant. In each of the following types A, B, and C,(2)When a vowel is (a) a vertical vowel, (b) a horizontal vowel, (c) a vertical / horizontal vowel is placed, a consonant(1),(3),(4)Is the arrangement shown in the figure.
[0043]
  The Korean character generation program of the present invention processes as follows based on the above arrangement principle. FIG. 4 shows a process of generating one Hangul character by determining the arrangement based on the number of input of the grapheme without making the user aware of the consonant and vowel of the grapheme on the matrix M. In the following description, one Hangul character consisting of three consonants and one vowel is converted into a consonant (character element with a minimum composition) + consonant + consonant + vowel ( The description will be made assuming that the input is generated by inputting the consonant grapheme four times and the vowel grapheme twice in the order of (composite minimum composition).
[0044]
  In FIG. 4, when the character elements on the matrix M displayed on the screen of the mobile phone are designated and input by operating the number buttons of the mobile phone (# 1), the character data and the character information of the relevant character element TheserverRead from. Then, it is determined whether or not it is a consonant based on the read grapheme information (# 2).
[0045]
  If the character element read in # 2 is a consonant (YES in # 2), it is determined whether or not there is a consonant in the previous input (# 3). Now, since it is the first input, it is determined here that there is no consonant (NO in # 3), and the grapheme is based on the consonant arrangement pattern shown in FIG. 5 (first input of consonant), and in FIG.(1)It is analyzed that there is a possibility of entering the position of (2), a placement code is provisionally set for this possible position (# 4), and the process returns to # 1.
[0046]
  Return to # 1 and input the next grapheme. Here, as described above, it is assumed that a consonant is input as the second grapheme (YES in # 2), and then the presence / absence of a consonant is determined in # 3. In # 3, since the consonant is already input as the first grapheme as described above (YES in # 3), the process proceeds to # 5.
[0047]
  In # 5, the arrangement possibility in FIG. 3 is analyzed based on the arrangement pattern shown in FIG. 5 (second consonant input). In FIG.(1)An arrangement position to which “′” is added, such as “,” means that, for example, the following points are analyzed.
[0048]
  For example, as a result, when “Huff” is input by inputting “13” vertically and horizontally 3 in the matrix M shown in FIG. 1, “13” may be input. There is a case where “F” of vertical 1 horizontal 1 “11” is input twice. That is, the arrangement position to which “′” is added in the input of the second and subsequent consonant sounds means that the possibility of such combination is analyzed.
[0049]
  In the description here, it is assumed that the composite font is input twice. In # 5, three types of arrangement codes are provisionally set based on the second consonant arrangement pattern in FIG. 5 (# 6). By the way, in the second time, as shown in Figure 5, along with the previously input consonant(1)’,(1)When(3),(3)When(1)This indicates that there is a possibility of placement.
[0050]
  After that, a character candidate is searched from the current grapheme and consonant arrangement code (# 7). In # 7, one Hangul character corresponding to the input font and arrangement code is searched. In # 8, it is determined whether there is a corresponding Hangul character in the search result of # 7. Now, since only one glyph of a consonant has been input and no vowel has been input, there is no character in # 8 (NO in # 8), and the process returns to # 1 and the third input is performed.
[0051]
  In step # 7, the corresponding character is searched. For example, when only one or two consonants are input, there are many corresponding characters and it may take a long search time. In order to avoid this, a process of “having a vowel?” Is inserted before # 7, and if there is a vowel, the process proceeds to # 7, and if there is no vowel, the process returns to # 1. In this way, it is possible to complete the input more quickly than the above, and it is possible to reduce the load on the hardware.
[0052]
  In the third consonant input, # 1 to # 3 are the same as described above, so the description is omitted. However, in # 5 after YES in # 3, the arrangement pattern of the third input shown in FIG. 5 is used. The difference is that the placement code is temporarily set. Then, after # 5, the processes of # 6 and # 7 are performed. In # 8, it is determined whether or not there is a corresponding Hangul character (NO in # 8), and the process returns to # 1.
[0053]
  In the fourth consonant input, the description from # 1 to # 3 is the same as described above, and thus the description is omitted. However, in # 5 after YES in # 3, the arrangement pattern of the fourth input shown in FIG. 5 is used. The difference is that the placement code is temporarily set. Then, after # 5, the processes of # 6 and # 7 are performed. In # 8, it is determined whether or not there is a corresponding Hangul character (NO in # 8), and the process returns to # 1.
[0054]
  At the time when the fourth input of the consonant is finished, three character elements of consonant + consonant + consonant are input. In FIG. 5, the arrangement pattern is up to the sixth input for the following reason. One Hangul character may require up to three consonants. At this time, when all the three consonants are combined with the minimum configuration as described above, there is a possibility that one character element is input twice.
[0055]
  Then, after the fourth input is completed, the grapheme that is input after returning to # 1 is a vowel in this description (NO in # 2), so the process proceeds to # 9. In # 9, it is analyzed whether the graph element of the vowel corresponds to a vertical vowel, a horizontal vowel, or a vertical / horizontal vowel, and whether or not compounding is possible is determined. Then, after finishing the analysis of # 9, a placement code is provisionally set (# 10), and a search of # 7 is performed.
[0056]
  Here, regardless of the order of consonants and vowels, when a vowel is input for at least one consonant, the first Hangul character that is a candidate by the search of # 8 isserverAnd the candidate is displayed (YES in # 8).
[0057]
  In # 11, the user is made to select whether or not there is a target character from the Korean character candidates displayed in # 8. If there is only one candidate in # 8, the answer is unconditionally YES in # 11, the Hangul character is determined in # 12, and the process ends.
[0058]
  In this description, for example, in the matrix M shown in FIG. 1, the vowel is a combination of a character element “亠” of vertical 5 × 4 “54” and a character element “G” of vertical 4 ”14”. Enter the length of 5 and 6 in “56”. Accordingly, in the above input, only “亠” of “54” has been input, so in # 11, the target Hangul character is not displayed as a candidate (NO in # 11).
[0059]
  Therefore, the process proceeds to # 13 and the user selects whether or not to clear all the input so far, and in this explanation, since the character element “14” of “14” is input subsequently, the input so far (No in # 13) and return to # 1. Then, NO and # 9 are passed at # 1 and # 2.
[0060]
  In # 9, since it is unlikely that there are two vowels for “に 対 し て” of “54” input earlier, “56” of “14” is automatically combined and “56” ”Is temporarily set as the arrangement code of this character element (# 10), the character candidate is searched at # 7, and the character extracted by the search is displayed (# 8). YES), the user is made to select a target character from the extracted characters (YES in # 11), the target character is determined (# 12), and the Hangul character generation process is terminated.
[0061]
  In this way, the Hangul character generation program shown in FIG. 4 can determine the consonants and vowels, ignore the input order at all, and cannot determine the appearance division of the fonts. , Can correctly generate Hangul characters.
[0062]
  Furthermore, the dictionary lookup program of the present invention performs the process shown in FIG. 6 from the Hangul character generated by the process described above to look up the meaning of Japanese. In FIG. 6, using the Hangul characters displayed on the screen of the mobile phone as a key,serverIt is determined whether or not there is the same heading (# 21).
[0063]
  If there is the same heading in # 21 (YES in # 21),serverThe semantic information is read out from (# 22), and the screen of the mobile phone is switched and displayed as shown in FIG. 2 (b) (# 23). If there is no headline in # 21 (NO in # 21), the process proceeds to # 23 to display “Not applicable”. In this way, the meaning of Korean characters (Korean) can be easily understood.
[0064]
  Next, another example of the Hangul character generation program of the present invention will be described with reference to FIG. In the processing of FIG. 7, the arrangement is determined from the relationship between the consonants based on the type of the element and the number of the elements. Even if the consonant and the vowel cannot be determined, the input order is completely ignored. In addition, even if it is not possible to determine the separation of the appearance of the grapheme, the Hangul character can be generated correctly.
[0065]
  In FIG. 7, the user inputs all the font elements constituting the Hangul character by dividing the appearance (# 31). Then, it is determined whether or not all of the input grapheme can be combined sequentially as described above (# 32). If there is a composited grapheme (YES in # 32), it is combined (# 33). ).
[0066]
  When the processing proceeds from # 33 to # 34, all the grapheme input in # 31 are combined in # 33 such as “Huff: consonant” + “亠: vowel” (consonant 1). , Vowel 1), and processing after # 34 as a set of grapheme sets (consonant 2, vowel 1) that are not compounded in # 33 such as “F: consonant” + “F: consonant” + “亠: vowel” I do. However, in the grapheme set, for example, the fonts corresponding to the vowels that can be combined in # 33 such as “亠: vowel” and “G: vowel” are only combined.
[0067]
  Subsequently, consonants and vowels are separated for each grapheme set for the input grapheme (# 34), and the number of consonants and vowels is determined for each grapheme set (# 35). If it is a consonant 1 to 3 grapheme, it is determined to be compatible (YES in # 36), and the process proceeds to # 37. On the other hand, if # 36 has more vowels than 0 or 1 grapheme, or if there are more consonants than 3 grapheme in the combined grapheme set, or there is no combined grapheme set and composite If there are more consonants than the three glyphs in the non-character set (NO in # 36), the process ends as an error.
[0068]
  If the number of grapheme matches in # 36 (YES in # 36), then the vowel placement position is analyzed (# 37), and then the remaining consonant placement is analyzed (# 38). In # 38, the position of the vowel is as shown in FIG.(2)In addition, the arrangement position can be narrowed down by the remaining consonant grapheme. And the arrangement position of a consonant can be further narrowed down from the relationship with a vowel by narrowing down the arrangement position of a vowel.
[0069]
  After # 38, the candidate for the Hangul character is displayed (# 39), and the user selects the target Hangul character (YES in # 40), decides it (# 41), and ends the processing. . On the other hand, if there is no target Korean character in # 40 (NO in # 40), the user selects whether to clear and re-enter in # 42, and clear and do not re-enter (in # 42) NO) When the process is terminated and cleared and input again (YES in # 42), the process returns to # 31 and the process is repeated.
[0070]
  The Korean character generation program of the present invention may be as shown in FIGS. The processing of FIGS. 8 and 9 is the same as that of FIGS. 4 and 7 in that it is not necessary to determine the consonant and vowel, and that it is not possible to determine the separation of the appearance of the grapheme. , Consonant + vowel input order is fixed on the program side.
[0071]
  In FIG. 8, a grapheme is input (# 51), and it is determined whether the input grapheme is a consonant (# 52). If it is a consonant in # 52 (YES in # 52), since the first input grapheme is a consonant, it is shown in FIG.(1)A grapheme is once input at the position of and is displayed (# 53). If the first input grapheme in # 52 is, for example, a vowel (NO in # 52), error processing such as clearing the input is performed (#E), and the process returns to # 51.
[0072]
  When a grapheme is input in # 54, it is determined whether it is a vowel (# 54). If it is a vowel in # 54 (YES in # 54), the process proceeds to # 58. If it is not a vowel in # 57 (NO in # 57), it proceeds to # 55 as a consonant. In step # 55, it is determined whether or not the character input in step # 51 can be combined.
[0073]
  If compounding is possible in # 55 (YES in # 55), the character elements are combined (# 56), and the process returns to # 53 and again shown in FIG.(1)Enter a grapheme at the position of and display it. On the other hand, if the input is not a consonant that cannot be combined or a vowel in # 55 (NO in # 55), error processing is performed (#E), and the process returns to # 54.
[0074]
  Here, if the grapheme input at # 54 for the third time is not a vowel (NO at # 56), error processing #E is performed because it is unconditionally impossible to combine with the previous consonant at # 55. Return to # 54.
[0075]
  If there is an input of a grapheme at # 54 and it is a vowel (YES at # 57), it is determined from the input grapheme whether it is a vertical vowel (# 58) or a horizontal vowel (# 59), When it is neither (NO in # 58 and 59), the grapheme is shown in FIG.(2)Is once input and displayed as vertical and horizontal vowels at position (# 60), and then proceeds to # 61.
[0076]
  Also, when the grapheme is a vertical vowel in # 58 (YES in # 58), the grapheme is shown in FIG.(2)Is once input and displayed as a vertical vowel at the position (# 63), and then proceeds to # 61. On the other hand, when it is a horizontal vowel in # 59 (YES in # 59), the grapheme is shown in FIG.(2)Is once input and displayed as a horizontal vowel at the position (# 64), and then proceeds to # 61.
[0077]
  In # 61, if the input is completed for one consonant and one vowel that have been correctly input (YES in # 61), a Hangul character consisting of the input consonant + vowel grapheme is displayed and the process ends ( # 62). On the other hand, if not completed yet in # 61 (NO in # 61), the process proceeds to # 71 in FIG.
[0078]
  In step # 71, when a grapheme is input, it is determined whether or not it is a consonant (# 72). When it is a consonant in # 72 (YES in # 72), the process proceeds to # 73. On the other hand, when it is not a consonant in # 72 (NO in # 72), it is determined whether or not the input grapheme is a vowel (# 75). If it is a vowel in # 75 (YES in # 75), the process proceeds to # 76. On the other hand, when it is not a vowel in # 75 (NO in # 75), error processing is performed (#E), and the process returns to # 71.
[0079]
  In # 76, when the grapheme input in # 71 is a vowel, it is determined whether it can be combined with the previously determined vowel grapheme. If compounding is possible in # 76 (YES in # 76), compounding (# 77) returns to # 58 in FIG. On the other hand, if compounding is impossible at # 76 (NO at # 76), error processing is performed (#E), and the process returns to # 71.
[0080]
  If the input of # 71 is a consonant (YES in # 72) and the input is completed (YES in 73), the grapheme input in # 71 is changed to that shown in FIG.(3)Is displayed as a consonant + vowel + consonant Hangul character, and the process ends (# 74). On the other hand, if not completed in # 73 (NO in # 73), the process proceeds to # 78.
[0081]
  When a grapheme is input in # 78, it is determined whether or not it is a consonant (# 79). If the grapheme input in # 78 is a consonant (YES in # 79), the process proceeds to # 80. On the other hand, if the grapheme input at # 78 is not a consonant (NO at # 79), that is, an error process is performed (#E), and the process returns to # 73.
[0082]
  In # 80, when the grapheme input in # 78 is a consonant, it is determined whether or not it is the same as the previously determined final consonant. If it is the same as the previous consonant in # 80 (YES in # 80), it is determined whether it can be combined (# 81). If compounding is possible in # 81 (YES in # 81), compounding (# 82) returns to # 73. On the other hand, when the combination is impossible at # 81 (NO at # 81), error processing is performed (#E), and the process returns to # 73.
[0083]
  In # 79, if the grapheme input in # 78 is a consonant (YES in # 79), it is not the same as the previous consonant (NO in # 80), and if the input is completed (YES in 83) , # 78 is the same as the one shown in FIG.(4)Is displayed as a consonant + vowel + consonant + consonant Hangul character, and the process ends (# 84). On the other hand, if not completed yet in # 83 (NO in # 83), the process proceeds to # 85.
[0084]
  In step # 85, when a grapheme is input, it is determined whether it is the same as the previous consonant (# 86). When it is the same as the previous consonant in # 86 (YES in # 86), the process proceeds to # 87. On the other hand, when it is not the same as the previous consonant in # 86 (NO in # 86), that is, error processing is performed assuming that a vowel or a character element due to other erroneous input is input (#E), and the process returns to # 83. .
[0085]
  In # 87, when # 85 is the same grapheme as the previous consonant, it is determined whether it can be combined. If compounding is possible in # 87 (YES in # 87), compounding (# 88) returns to # 83. On the other hand, when the combination is impossible at # 87 (NO at # 87), error processing is performed (#E), and the process returns to # 83.
[0086]
  As described above, the processing shown in FIGS. 8 and 9 is different from FIGS. 4 and 7 in that the input order of consonant + vowel is fixed on the program side. However, since the process is not terminated, the correct Hangul character can be generated while repeating the error. The Korean character generation programs shown in FIGS. 8 and 9 are the same in that it is not necessary to determine consonants and vowels, and it is not necessary to determine the appearance division of the font elements.
[0087]
  As described above, after the processing shown in FIGS. 7, 8, and 9, the generated Hangul character is used in the processing of the dictionary lookup program shown in FIG. Since it is the same, description is abbreviate | omitted.
[0088]
  The Hangul character generation program and the dictionary lookup program of the present invention have been applied to a mobile phone in the above embodiment, but may be installed and used in a personal computer or PDA (personal information device), for example. Good. In this case, the above-described character storage means and meaning storage means may be stored in a hard disk, a CD-ROM, or the like.
[0089]
  Then, on the display screen of the personal computer, as shown in FIG. 10, each display having the same content as the screen on the mobile phone is operated by a keyboard or by a mouse click. Then, as a result of dictionary lookup, the result display 1g pops up on the display of FIG. 10A as shown in FIG. Even if it does in this way, the effect equivalent to the above can be acquired.
[0090]
  Further, as an input device having the matrix M used in the present invention, for example, the configuration shown in FIG. 11 can be considered. FIG. 11A shows an input device connected to a connection terminal of a mobile phone. The input device shown in FIG. 11A has the contents displayed on the screen of the above-described mobile phone on the surface. By directly pressing the content portion, the input device can input directly without inputting from the button of the mobile phone, that is, without inputting the two-digit number.
[0091]
  FIG. 11B shows an input device connected to a connection terminal of a personal computer. Similarly to the input device shown in FIG. 11 (a), the input device shown in FIG. 11 (b) has the contents displayed on the screen of the above-described mobile phone on the surface. The input device can input data directly from the content portion, not from a keyboard or mouse of a personal computer.
[0092]
【The invention's effect】
  The Hangul character generation method of the present invention can achieve the following effects. It is easy to specify a grapheme because it is input using a matrix classified for each grapheme with similar appearance. Since it is determined whether the character element read from the character element storage means is a consonant or a vowel, it is not necessary for the user to distinguish between the consonant and the vowel when inputting. Since it is determined whether or not the read-out grapheme can be combined, when specifying a single grapheme by combining the minimum configuration, the minimum configuration is divided into multiple times even if the grapheme itself is specified. Even if it is specified, the correct grapheme can be specified. Analyzing the placement position of the grapheme and determining and displaying the placement of the grapheme, so if you select the grapheme so that the appearance is the same, you can generate Korean characters without understanding the input rules it can.
[0093]
  Further, the dictionary lookup method of the present invention searches for semantic information based on the Korean characters generated by the above-described Korean character generation method and displays the searched semantic information. Therefore, the dictionary lookup of Korean characters (Korean) is performed. And the meaning of Japanese and other languages can be understood quickly.
[Brief description of the drawings]
FIG. 1 is a diagram showing a matrix of grapheme used in the present invention.
FIGS. 2A and 2B show examples of display on a mobile phone screen, where FIG. 2A is a graph when a grapheme is input, and FIG.
FIG. 3 is a diagram illustrating rules for arranging Korean characters.
FIG. 4 is a diagram illustrating an example of a method for generating Korean characters according to the present invention.
FIG. 5 is a diagram showing a consonant arrangement pattern in the method of FIG. 4;
FIG. 6 is a diagram showing a dictionary lookup method of the present invention.
FIG. 7 is a diagram showing another example of a method for generating Korean characters according to the present invention.
FIG. 8 is a diagram showing still another example of the method for generating Korean characters according to the present invention.
FIG. 9 is a diagram showing still another example of the method for generating Korean characters according to the present invention.
FIGS. 10A and 10B show examples of screen display when the Hangul character generation method of the present invention is installed in a personal computer, where FIG. 10A is a graph when inputting a pixel and FIG.
11A and 11B show an input device having a matrix used in the present invention, in which FIG. 11A shows an input device connected to a mobile phone, and FIG. 11B shows an input device connected to a personal computer.
[Explanation of symbols]
M matrix

Claims (4)

Information indicating whether the vowel or a consonant in each shaped element, information indicating whether a complex or a simple substance, the shaped element information consisting of information indicating a possible position to be disposed, similar in appearance a hard disk or server as Jimoto storage means for storing a matrix of classification so as to have the same line for each character element, to display the matrix display screen, specify a character element in a matrix on the screen display Using a personal computer, a PDA, or a mobile phone having an input device for input, and generating a Korean character by designating and inputting a grapheme, wherein the matrix is displayed on a display screen A step, a step of inputting the matrix-like character elements specified by appearance divisions, and character data for the input character elements Reading the grapheme information from the grapheme storage means, determining whether the read grapheme is a consonant or a vowel based on the grapheme information, and if the read grapheme is a consonant, Determining whether or not there is a consonant in the input, analyzing the possibility that the consonant is input every time the consonant is input, and temporarily setting the position information; and if the read grapheme is a vowel, the vertical vowel and the horizontal Analyzing whether it corresponds to a vowel or a vertical / horizontal vowel, determining whether it can be combined, and if it can be combined, combining the grapheme and temporarily setting the position information; and at least one consonant On the other hand, when a vowel is input, it has a step of searching for a candidate Hangul character based on the position information of these consonants or vowels and displaying the Hangul character extracted by the search. Single character generation method.   A step of retrieving semantic information from a hard disk or a server as semantic storage means storing semantic information of Korean characters based on the Korean characters generated by the method according to claim 1, and reading the retrieved semantic information and using the Korean characters A dictionary lookup method for Korean characters, comprising the step of associating a headline with a meaning of Japanese or another language and displaying it on a display. Claim 1 or 2 personal computer the steps described, PDA, or program of the order is executed on the mobile phone. A computer-readable recording medium on which the program according to claim 3 is recorded.

Images