JP3664383B2 - Japanese input system, Japanese input method, and recording medium - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a Japanese language input system, a Japanese language input method, and a recording medium, and in particular, a Japanese language input system, a Japanese language input method, and a recording system that include a vowel complement mechanism that can input Japanese characters with few key operations. It relates to the medium.
[0002]
[Prior art]
In recent years, personal computers are rapidly spreading, and along with this, opportunities to create documents on computers are increasing. Furthermore, there are increasing opportunities to input Japanese using a small device (small keyboard) such as a portable terminal. However, since the input terminal is small, a system that can input Japanese with fewer key operations is desired.
[0003]
In order to respond to such user needs, for example, a system capable of inputting Japanese with a small number of key operations has been proposed, as in the technique described in Japanese Patent Laid-Open No. 2000-089901. This prior art reduces the number of keystrokes during Japanese input by inputting only consonants while omitting vowels when inputting kana in Udan. In addition, this technology has its own key assignment (assigning a key that is not used for consonant input) for the input of the prompt sound “tsu” and the roar “yayu”, and the sound repellent “n” and “kua”. The number of keystrokes when inputting Japanese is reduced by setting a unique keystroke input method.
[0004]
As a specific example, the prompt sound “tsu” is assigned to x, and the roar “yayu” is assigned to l, v, q, j, and f. Also, the input of the sound repellent “n” is n + promotion sound key x, and the input of “ku” is each consonant + each sound key (in this case, k + 1).
[0005]
[Problems to be solved by the invention]
The first problem of the above-described conventional technique is that the number of key inputs is not reduced so much.
[0006]
The reason is that it is not necessary to input vowels only in the case of Udan, but Udan is only 15 characters (20%) in the total number of characters (75 characters) excluding the A line, and depending on the text to be input This is because there are cases where almost no corrugations will come out.
[0007]
The second problem is that it is difficult to master key operations.
[0008]
The reason is that vowels are not input at all except for line A, and vowels are not input only in the case of the U stage, which is very difficult for a user who knows Roman character input. Furthermore, although the conventional method assigns prompting sounds and stuttering to keys that are not used for consonant input, it is necessary to accurately remember the assignment because there is no relation between the original words and the assigned keys. In the specific example described above, “l, v, q, j, f” cannot be associated with “nya, yu, ye, yo”.
[0009]
An object of the present invention is to solve the above problems and to realize a Japanese input system, a Japanese input method, and a recording medium that can input Japanese with a smaller number of key inputs.
[0010]
[Means for solving the problems]]
[0015]
The sixth Japanese input system of the present invention is the first, second, third, fourth, or fifth Japanese input system, and when a conversion key for vowel completion is input, It has the said vowel complement part which outputs a conversion candidate by the said vowel complement part.
[0019]
  The present inventions DayThis language input systemA first buffer for storing a character string to be converted; a second buffer for storing a character string supplemented with vowels;When the conversion key for vowel interpolation is input, the first character is acquired from the first buffer in which the character string to be converted is stored. If the acquired character is not a character indicating empty, The acquired first character is deleted from the first buffer, and if the acquired character is a character indicating a vowel, N, or T, the character as the vowel as it is, the sound repellent “n”, respectively. If “nn” or “xtu” indicating a prompt sound “tsu” is converted and complemented, and the acquired character is neither a vowel character nor N or T, that is, a consonant character, Further, the first character in the first buffer is taken out. If the character is Y, ya, yu, and yo are additionally complemented to the consonant character, and the first character is read from the first buffer. Delete the letter Y and the letter is Y If there was no, vowel letters a, i, u, e, and add complement the o, conversion completion, and add complementary characterSaidCharacters stored in the second bufferColumns andCreate all combinations with the second bufferAs a string groupA vowel complementing unit that re-stores and deletes a character string that does not match the database completely or forwardly from the character string group of the second buffer, and a character that indicates that the character acquired from the first buffer is empty The character string group stored in the second buffer is sorted in order of priority with reference to the database, stored in the first buffer as a conversion candidate, and the second buffer When the conversion candidate ranking unit for initializing the character to empty, the control unit for displaying the conversion candidates in the first buffer on the output unit, and the kana-kanji conversion key are input, the conversion in the first buffer is performed. Romaji kana conversion is performed on the conversion candidate selected by the operator from among the candidates, and the kana candidate is output, and the kana candidate is converted from kana to kanji.TemporaryAnd a name-kanji conversion unit.
[0026]
The seventh Japanese input method of the present invention is the first, second, third, fourth, fifth, or sixth Japanese input method when a kana-kanji conversion key is input. , Including a kana-kanji conversion procedure for performing kana / kana conversion on a conversion candidate selected by an operator from the conversion candidates output from the vowel complementing procedure or the conversion candidate ranking procedure and outputting a kana candidate. .
[0027]
The eighth Japanese input method of the present invention is the seventh Japanese input method, and includes the kana-kanji conversion procedure for converting kana to kanji into kana candidates output by romaji kana conversion. Features.
[0029]
  The present inventions DayThe language input method isWhen the vowel completion conversion key is input, the vowel completion part acquires the first character from the first buffer in which the character string to be converted is stored, and the acquired character is not an empty character If the acquired first character is deleted from the first buffer, and if the acquired character is a character indicating a vowel, N, or T, the character as a vowel as it is, The conversion is complemented by “nn” indicating “n” or “xtu” indicating the prompt sound “tsu”. If the acquired character is neither a vowel character nor N or T, that is, a consonant character. If the character is Y, if the character is Y, ya, yu, and yo are additionally complemented to the consonant character, and the first Delete the first character Y from the buffer 1 If the character is not Y, the vowel characters a, i, u, e, and o are additionally complemented, the conversion complement, the additionally complemented character, and the character to be converted stored in the second buffer Create all combinations with columns, re-store them as character strings in the second buffer, and delete character strings that do not match the database exactly or forwardly from the character strings in the second buffer And the steps to
When the conversion candidate ranking section is a character indicating that the character acquired from the first buffer is empty, the character string group stored in the second buffer is referred to the database and given priority. A procedure for sorting in order, storing as conversion candidates in the first buffer, and initializing the second buffer to be empty;
A control unit displaying a conversion candidate in the first buffer on an output unit;
When the kana-kanji conversion unit receives the kana-kanji conversion key, the kana-kanji conversion key performs a roman-character kana conversion on the conversion candidate selected by the operator from among the conversion candidates in the first buffer, and outputs the kana candidate. To convert kana to kanjiIt is characterized by including.
[0031]
  The present inventionNotationRecording media isWhen a conversion key for vowel interpolation is input to the vowel completion unit, the first character is acquired from the first buffer in which the character string to be converted is stored, and the acquired character is not an empty character If the acquired first character is deleted from the first buffer, and if the acquired character is a character indicating a vowel, N, or T, the character as a vowel as it is, The conversion is complemented by “nn” indicating “n” or “xtu” indicating the prompt sound “tsu”. If the acquired character is neither a vowel character nor N or T, that is, a consonant character. If the character is Y, if the character is Y, ya, yu, and yo are additionally complemented to the consonant character, and the first Delete the first character Y from the buffer 1 If the character is not Y, the vowel characters a, i, u, e, and o are additionally complemented, the conversion complement, the additionally complemented character, and the character to be converted stored in the second buffer Create all combinations with columns, re-store them as character strings in the second buffer, and delete character strings that do not match the database exactly or forwardly from the character strings in the second buffer To perform the steps to
In the conversion candidate ranking section, if the character acquired from the first buffer is an empty character, the character string group stored in the second buffer is prioritized with reference to the database. Sort in order, store as conversion candidates in the first buffer, and execute the procedure of initializing the second buffer to be empty,
Causing the control unit to execute a procedure for displaying the conversion candidates in the first buffer on the output unit;
When a kana-kanji conversion key is input to the kana-kanji conversion unit, the kana / kanji conversion is performed on the conversion candidate selected by the operator among the conversion candidates in the first buffer, and the kana candidate is output. The procedure for converting kana to kanjiIt is characterized by recording a program.
[0032]
DETAILED DESCRIPTION OF THE INVENTION
Next, a first embodiment of the present invention will be described in detail with reference to the drawings.
[0033]
FIG. 1 is a block diagram showing an embodiment of the present invention.
Referring to FIG. 1, the first embodiment of the present invention includes an input unit 101, a control unit 102, an output unit 103, a vowel complementing unit 111, a conversion candidate ranking unit 112, and conversion candidates / appearances. The frequency database unit 113, the kana / kanji conversion unit 121, the kana / kanji conversion dictionary 122, the buffer 131, and the buffer 132 are configured. The input unit 101 is an input device such as a keyboard, and transmits information such as character input, conversion, and confirmation to the control unit 102. Although not shown, for example, in the case of a keyboard of a personal computer, a command is input by “function keys F1 to F12”. Also, one non-character key is assigned as a conversion key for vowel interpolation (for example, “ALT key”). Furthermore, for example, “conversion key” is assigned as a kana-kanji conversion key. In addition, an “ENTER key” is assigned as a confirmation key.
The control unit 102 transmits a vowel complement result, a kana-kanji conversion result, and the like to the output unit 103. The output unit 103 is a display device such as a monitor.
[0034]
In addition, when the conversion key for vowel complement is input, the control unit 102 first passes the input character string to the vowel complement unit 111, and the vowel complement unit 111 transmits each vowel a, Further, i, u, e, o are combined, and the conversion candidate / appearance frequency database unit 113 is referred to, and only conversion candidates that match, that is, candidates that have no problem with Japanese are passed to the conversion candidate ranking unit 112. In the conversion candidate / appearance frequency database unit 113 referred to at this time, words and sentences existing in Japanese are registered in advance, and further, words and sentences that are not registered in the conversion candidate / appearance frequency database unit 113. However, when it is input by normal romaji kana conversion, the word and sentence are additionally registered.
[0035]
Next, the conversion candidate ranking unit 112 ranks the passed conversion candidates with reference to the conversion candidate / appearance frequency database unit 113, and causes the output unit 103 to display the ranking through the control unit 102. Further, when the confirmation key is input, the control unit 102 transmits the kana information to the kana-kanji conversion unit 121, and the kana-kanji conversion unit 121 performs kana-kanji conversion using the kana-kanji conversion dictionary 122, and kanji candidates (kana) Are displayed from the output unit 103 through the control unit 102. Further, the control unit 102 transmits the conversion candidate (character string) before conversion to the conversion candidate / appearance frequency database unit 113 at the time when the confirmation key is input, that is, when the kana is confirmed, and the appearance frequency of the character string Raise.
[0036]
The first embodiment of the present invention also has a general romaji kana conversion means, and when the control unit 102 inputs a kana-kanji conversion key in response to a general romaji input, the input is performed. The information is transmitted to the vowel complementing unit 111, and the vowel complementing unit 111 performs general Romaji kana conversion. Thereafter, the converted kana is returned to the control unit 102, and then the kana / kanji conversion unit 121 performs kana / kanji conversion to display kanji candidates (including kana) from the output unit 103 through the control unit 102. At the same time, the control unit 102 also transmits the conversion candidate (character string) before conversion to the conversion candidate / appearance frequency database unit 113. If the character string exists, the control unit 102 increases the appearance frequency, and if there is no matching character string, The character string is registered in the conversion candidate / appearance frequency database unit 113.
[0037]
Character strings are stored in the buffer 131 and the buffer 132, and are initially initialized to empty by the control unit 102.
[0038]
Finally, kanji or kana is determined from the input unit 101, and the process ends.
[0039]
Next, the operation of the first exemplary embodiment will be described with reference to the drawings.
FIG. 2 is a flowchart showing the operation of the first embodiment.
FIG. 6 is an explanatory diagram showing a screen display of the input character string.
FIG. 7 is an explanatory diagram illustrating a conversion candidate display screen.
[0040]
Referring to FIG. 2, first, the control unit 102 analyzes input information input from the input unit 101 and determines whether the input is a character input or a command input (step S202 in FIG. 2). If the input information is a character (step S202 / Yes in FIG. 2), the control unit 102 adds the character to the buffer 131 (step S203 in FIG. 2), and causes the output unit 103 to display the screen as shown in FIG. (Step S204 in FIG. 2), the process returns to the input waiting state (step S201 in FIG. 2). Referring to FIG. 6, a character string “kYuik” is input and displayed.
[0041]
If the input information is not a character (step S202 / No in FIG. 2), the control unit 102 determines whether the input is a conversion key for vowel interpolation (step S205 in FIG. 2). In the case (step S205 / Yes in FIG. 2), the character string “kYuik” stored in the buffer 131 is passed to the vowel complementing unit 111. Next, vowel complementing section 111 and conversion candidate ranking section 112 perform vowel interpolation and conversion candidate processing on the character string “kYuik” (step S206 in FIG. 2), and return conversion candidates to control section 102.
[0042]
Next, the control unit 102 displays the conversion candidates on the screen of the output unit 103 as shown in FIG. 7 (step S207 in FIG. 2). Referring to FIG. 7, the conversion candidates are “kyuuika”, “kyuuiki”, “kyouika”, “kyouuki”, “kyouiku”, “kyouiku”, “kyouiku”, and the like. Further, the conversion candidates are stored again in the buffer 131, and the process returns to the input waiting state (step S201 in FIG. 2).
[0043]
If the input information is not a vowel complement conversion key (step S205 / No in FIG. 2), the control unit 102 determines whether the input information is a kana-kanji conversion key (step S208 in FIG. 2). If it is a kana-kanji conversion key (step S208 / Yes in FIG. 2), first, general roman character kana conversion is sequentially performed on all character strings stored in the buffer 131 (step S209 in FIG. 2). The character string before the conversion is fed back to the conversion candidate / appearance frequency database unit 113, and the character string is registered. If the character string is already registered, the appearance frequency is improved (step S210 in FIG. 2).
For example, the pseudonyms are “Kyuika”, “Kyoika”, “Kyoiki”, “Kyoiku”, “Kyoike”, “Kyoiko”, and the like. Next, the kana-kanji conversion unit 121 performs kana-kanji conversion (step S211 in FIG. 2), displays kanji candidates (including kana itself) on the screen of the output unit 103 (step S212 in FIG. 2), and waits for input ( Returning to step S201 in FIG.
[0044]
Kanji candidates that have been converted to Kana-Kanji are “Kyuwei”, “Ninth place”, “Today”, “Today”, “Wonder”, “Chest”, “Threat”, “Border”, “ “Education”, “Go today”, “Go today”, “Go today”, etc.
[0045]
Next, when the input information is not a kana-kanji conversion key (step S208 / No in FIG. 2), the control unit 102 determines whether the input information is a confirmation key (step S213 in FIG. 2). If it is (step S213 / Yes in FIG. 2), it is determined whether the confirmed candidate is confirmed from the conversion candidate or the kanji candidate (step S214 in FIG. 2). If the conversion candidate is confirmed (step S214 / Yes in FIG. 2), general romaji kana conversion is performed (step S209 in FIG. 2), and the conversion candidate (character string) before conversion to kana is converted into a conversion candidate. Feedback to the appearance frequency database unit 113 to improve the appearance frequency of the conversion candidate (character string) (step S210 in FIG. 2). Thereafter, the kana-kanji conversion unit 121 performs kana-kanji conversion using the kana-kanji conversion dictionary 122 (step S211 in FIG. 2), and displays kanji candidates (including kana itself) on the screen of the output unit 103 (FIG. 2). 2 step S212), and returns to the input waiting state (step S201 in FIG. 2).
[0046]
If the kanji candidate is confirmed (step S214 / No in FIG. 2), the confirmed kanji (including kana) is displayed on the screen of the output unit 103 (step S215 in FIG. 2), and the buffer 131 is initialized. (Step S216 in FIG. 2), the process returns to the input waiting state (step S201 in FIG. 2).
[0047]
For example, the user inputs the characters “k”, “Y”, “u”, “i”, and “k” from the input unit 101, and then inputs a conversion for vowel interpolation using a conversion key for vowel interpolation. To do. As a result, the conversion candidates “kyuuika”, “kyuuiki”, “kyouika”, “kyouuki”, “kyouiku”, “kyouiku”, “kyouiku”, and the like are displayed on the output unit 103. Next, the user inputs kana-kanji conversion from the input unit 101 using the kana-kanji conversion key. As a result, the kanji candidates "Kyuwei", "Ninth place", "Today", "Today", "Wonder", "Chest", "Threat", "Border", "Education", " “Go today”, “Go today”, “Go today”, etc. are displayed on the output unit 103. Next, for example, the user selects “threat?” From the input unit 101 and inputs confirmation with the confirmation key. As a result, only “whether it is a threat” or not is displayed on the output unit 103 in a fixed expression.
[0048]
Next, the vowel complement of the vowel complement unit 111 and the conversion candidate process will be described in detail.
First, a character input rule when performing vowel complement will be described.
[0049]
FIG. 3 is an explanatory diagram showing character input rules for generating conversion candidates by complementing vowels. Referring to FIG. 3, “a, i, u, e, o” is input as usual in row A, and only consonants are input in the other rows. For example, if you want to enter “good morning”, enter “ohyu”. However, as an exception, the capital letters T, N, and Y are input for the prompt sound “tsu”, the repelling sound “n”, and the roaring sound “nya, yo, yo”. The reason for this is that two consonants need to be overlapped for the input of the sound, repelling and stuttering (“te” is “tte”, “n” is “nn”, “nya” is “nya”, etc. Etc.) and more frequently used. As an input example, “hTkk” is input as “scratch”, “kYuik” is input as “Kikuiku”, and “sNbN” is input as “shinbu”.
[0050]
The vowel complement and the conversion candidate process to which the above input rules are applied will be described in detail. FIG. 4 is a flowchart showing operations of vowel complementation and conversion candidate processing according to the present invention.
[0051]
Referring to FIG. 4, first, the vowel complementing unit 111 obtains the first character from the buffer 131 in which the character string to be converted is stored (step S401 in FIG. 4), which is a character or empty (EOF). Is confirmed (step S402 in FIG. 4). If it is a character (step S402 / Yes in FIG. 4), the acquired first character is deleted from the buffer 131 (step S403 in FIG. 4), and the character is a vowel character or N, T. Check whether there is (FIG. 4, step S404), and if so (step S404 / FIG. 4, Yes), respectively, a line (characters a, i, u, e, o corresponding to the vowel), It is converted into “nn” indicating the sound repellent “n” or “xtu” indicating the prompt sound “tsu” (step S405 in FIG. 4).
[0052]
Next, the vowel complementing unit 111 creates all combinations of the generated characters and the character string group stored in the buffer 132 and stores them again in the buffer 132 (step S406 in FIG. 4). In addition, referring to the conversion candidate / appearance frequency database unit 113, a character string that does not match the conversion candidate / appearance frequency database unit 113 from the character string group in the buffer 132, that is, a character string that does not make sense as Japanese. All are deleted (step S407 in FIG. 4). Note that, as a matching method at this time, perfect match or forward match is applied. For example, “kyau” is deleted because it does not match. When this series of processing is completed, the next character is acquired from the buffer 131 (step S401 in FIG. 4).
[0053]
If the acquired character is neither a vowel nor N or T (ie, a consonant other than N or T) (step S404 / No in FIG. 4), whether or not the first character of the buffer 131 is “Y”, That is, it is confirmed whether or not the next character of the target character is “Y” (step S409 in FIG. 4), and if it is Y (step S409 / Yes in FIG. 4), the vowels a, u, and o are complemented and stuttering A character string including “ya, yu, cho” (for example, “kya, kyu, kyo” corresponding to “kya, kyu, ki”, etc.) is set (step S410 in FIG. 4). Further, since the first character Y of the buffer 131 is used, the first character Y of the buffer 131 is deleted (step S411 in FIG. 4). The subsequent processing is the same as S406 and S407 described above.
[0054]
Next, when the next character of the target character is not Y (step S409 / No in FIG. 4), vowels a, i, u, e, o are complemented to the consonant of the simply acquired character (step in FIG. 4). S412). The subsequent processing is also the same as S406 and S407 described above.
[0055]
If the buffer 131 eventually becomes empty (EOF) (step S402 / No in FIG. 4), the conversion candidate ranking unit 112 converts the conversion candidate group stored in the buffer 132 into the conversion candidate / appearance frequency database unit 113. With reference, the data is sorted in the order of priority and stored in the buffer 131. Further, the buffer 132 is initialized to be empty (step S413 in FIG. 4), and the process ends. For example, if “kyuuki” has a higher frequency of appearance than “kyuuki”, it is sorted in the order of “kyuuki” and “kyuuka”.
[0056]
Next, vowel complementation and conversion candidate processing when the character string “kYuik” is stored in the buffer 131 will be described in detail.
FIG. 5 is an explanatory diagram showing the contents of the buffer 131 and the buffer 132 for each step.
Referring to FIG. 5, in cycle 1, “k” is first obtained and stored in an arbitrary variable (cycle 1 / step 1 in FIG. 5), but the next character is “Y” representing stuttering. Further, “Y” is also stored in the variable (cycle 1 / step 2 in FIG. 5). Thereafter, the vowels a, u, o are complemented, and “kya, kyu, kyo” corresponding to “kya, kyu, kyo” is stored in the buffer 132 (cycle 1 / step 3 in FIG. 5). Since the matching with the conversion candidate / appearance frequency database unit 113 includes a forward match, the first character is naturally not deleted.
[0057]
Similarly, in cycle 2, a vowel “u” is added and stored in the buffer 132 (cycle 2 / step 2 in FIG. 5). Here, “kyau” corresponding to “kyau” is a conversion candidate / appearance. Since it does not match the frequency database unit 113, it is deleted (FIG. 5, cycle 2 / step 3).
[0058]
Similarly, processing is performed in cycles 3 and 4, and it is determined in cycle 5 that there are no more characters in the buffer 131 (FIG. 5, cycle 3 / step 1), and the conversion candidate groups in the buffer 132 are sorted in order of priority. (Cycle 3 / step 2 in FIG. 5).
[0059]
Next, a second embodiment of the present invention will be described in detail with reference to the drawings.
In the second embodiment of the present invention, when a conversion key for vowel interpolation is input, the first character is acquired from the buffer 131 in which the character string to be converted is stored (step S401 in FIG. 4). If the acquired character is not a character indicating empty (step S402 / Yes in FIG. 4), the acquired first character is deleted from the buffer 131 (step S403 in FIG. 4), and the acquired character indicates a vowel. If it is a letter, N, or T (step S404 / Yes in FIG. 4), the character in line A (the letters a, i, u, e, o corresponding to the vowels as they are), respectively, the sound repellent “n”. "Nn" to indicate, or "xtu" to indicate the prompt sound "tsu" is complemented (step S405 in FIG. 4),
When the acquired character is neither a vowel character nor N or T (step S404 / No in FIG. 4), that is, a consonant character, the first character in the buffer 131 is further extracted, If the character is Y (step S409 / Yes in FIG. 4), ya, yu, and yo are additionally supplemented to the consonant character (step S410 in FIG. 4), and the first character Y is read from the buffer 131. Delete (step S411 in FIG. 4),
If the character is not Y (step S409 / N in FIG. 4), the vowel characters a, i, u, e, and o are additionally supplemented (step S412 in FIG. 4).
All combinations are created from the converted and added characters and the character string group stored in the buffer 132 and stored again in the buffer 132 (step S406 in FIG. 4). Delete a character string that does not match the conversion candidate / appearance frequency database unit 113 completely or forwardly (step S407 in FIG. 4);
When the character acquired from the buffer 131 is a character indicating the sky (step S402 / No in FIG. 4), the character string group stored in the buffer 132 is referred to the conversion candidate / appearance frequency database unit 113. , Sorted in order of priority, stored in the buffer 131 as conversion candidates, and initializes the buffer 132 to be empty (step S413 in FIG. 4).
A control procedure for displaying conversion candidates in the buffer 131 in the output procedure (step S207 in FIG. 2);
When the kana-kanji conversion key is input, the kana-kana conversion is performed on the conversion candidate selected by the operator among the conversion candidates in the buffer 131, and the kana candidate is output (step S209 in FIG. 2). To kanji (step S211 in FIG. 2) including the kana-kanji conversion procedure.
[0060]
Next, a third embodiment of the present invention will be described in detail with reference to the drawings.
FIG. 8 is a block diagram showing a third embodiment of the present invention.
Referring to FIG. 8, in the third embodiment of the present invention, a program for causing a computer 80 (for example, a personal computer including the control unit 102) to execute each procedure of the second embodiment of the present invention is recorded. Recording medium 82 to be recorded. This program is loaded from the recording medium 82 to the computer 80 and executed.
[0061]
Specifically, in the third embodiment of the present invention, when a conversion key for vowel interpolation is input, the first character is acquired from the buffer 131 that stores the character string to be converted (FIG. 4). If the acquired character is not an empty character (step S402 / Yes in FIG. 4), the acquired first character is deleted from the buffer 131 (step S403 in FIG. 4), and the acquired character is further deleted. Is a character indicating a vowel, N, or T (step S404 / Yes in FIG. 4), the characters in the a-line (characters a, i, u, e, and o corresponding to the vowel) are respectively repelled. “N” indicating “n” or “xtu” indicating the sound “tsu” is complemented by conversion (step S405 in FIG. 4),
When the acquired character is neither a vowel character nor N or T (step S404 / No in FIG. 4), that is, a consonant character, the first character in the buffer 131 is further extracted, If the character is Y (step S409 / Yes in FIG. 4), ya, yu, and yo are additionally supplemented to the consonant character (step S410 in FIG. 4), and the first character Y is read from the buffer 131. Delete (step S411 in FIG. 4),
If the character is not Y (step S409 / N in FIG. 4), the vowel characters a, i, u, e, and o are additionally supplemented (step S412 in FIG. 4).
All combinations are created from the converted and added characters and the character string group stored in the buffer 132 and stored again in the buffer 132 (step S406 in FIG. 4). Delete a character string that does not match the conversion candidate / appearance frequency database unit 113 completely or forwardly (step S407 in FIG. 4);
When the character acquired from the buffer 131 is a character indicating the sky (step S402 / No in FIG. 4), the character string group stored in the buffer 132 is referred to the conversion candidate / appearance frequency database unit 113. , Sorted in order of priority, stored in the buffer 131 as conversion candidates, and initializes the buffer 132 to be empty (step S413 in FIG. 4).
A control procedure for displaying conversion candidates in the buffer 131 in the output procedure (step S207 in FIG. 2);
When the kana-kanji conversion key is input, the kana-kana conversion is performed on the conversion candidate selected by the operator among the conversion candidates in the buffer 131, and the kana candidate is output (step S209 in FIG. 2). Is a recording medium 82 for recording a program for causing the computer 80 to execute the kana-kanji conversion procedure for converting from kanji to kanji (step S211 in FIG. 2).
[0062]
【The invention's effect】
The first effect is that the number of key inputs when inputting Japanese can be reduced to almost half of the normal number.
[0063]
The reason for this is that the Japanese input method is configured to complement vowels if only consonants are input except for line A.
[0064]
The second effect is that the Japanese input method of the present invention is easy to master.
[0065]
The reason for this is that it is a simple input method except that the vowels are deleted from the normal input method except for the line A, and there are almost no special key settings, prompt sound “tsu”, sound repellent “n”, roar sound “nya, yu” This is because only “,” is assigned to a relatively easy-to-relate key such as “capital letters T, N, Y”.
[Brief description of the drawings]
FIG. 1 is a block diagram showing an embodiment of the present invention.
FIG. 2 is a flowchart showing the operation of the first exemplary embodiment.
FIG. 3 is an explanatory diagram illustrating character input rules for generating conversion candidates by complementing vowels.
FIG. 4 is a flowchart showing operations of vowel complementation and conversion candidate processing.
FIG. 5 is an explanatory diagram showing details of operations of vowel complement and conversion candidate processing.
FIG. 6 is an explanatory diagram showing a screen display of an input character string.
FIG. 7 is an explanatory diagram illustrating a conversion candidate display screen.
FIG. 8 is a block diagram showing a third embodiment of the present invention.
[Explanation of symbols]
80 computers
82 recording media
101 Input section
102 Control unit
103 Output section
111 Vowel Completion
112 Conversion candidate ranking section
113 Conversion candidate / appearance frequency database section
121 Kana-Kanji conversion part
122 Kana-Kanji Conversion Dictionary
131 buffers
132 buffers

Claims (3)

A first buffer for storing a character string to be converted; a second buffer for storing a character string supplemented with vowels;
When the conversion key for vowel interpolation is input, the first character is acquired from the first buffer, and if the acquired character is not a character indicating the sky, the acquired first character is If the acquired character is a character indicating a vowel, N, or T, and deleted from the buffer, the character is a vowel as it is, “nn” indicating a repelling sound “n”, or a prompt sound “ When the acquired character is neither a vowel character nor N or T, that is, a consonant character, the character is further stored in the first buffer. When the first character is extracted and the character is Y, ya, yu, and yo are additionally supplemented to the consonant character, and the first character Y is deleted from the first buffer, and the character is deleted. If is not Y, vowel sentence a, i, u, e, and o are additionally complemented, all the combinations are created by the conversion complementation, the additionally complemented characters, and the character string stored in the second buffer, and the second buffer A vowel completion unit that re-stores as a character string group and deletes a character string group that does not match the database with a complete match or a forward match from the character string of the second buffer;
If the character obtained from the first buffer is a character indicating empty, the character string group stored in the second buffer is sorted in order of priority with reference to the database as a conversion candidate. A conversion candidate ranking unit that stores in the first buffer and initializes the second buffer to empty;
A control unit for displaying conversion candidates in the first buffer on an output unit;
When the kana-kanji conversion key is input, the kana-kana conversion is performed on the conversion candidate selected by the operator from among the conversion candidates in the first buffer, and the kana candidate is output. A Japanese input system having a kana-kanji conversion unit for conversion . When the vowel completion conversion key is input, the vowel completion part acquires the first character from the first buffer in which the character string to be converted is stored, and the acquired character is not an empty character If the acquired first character is deleted from the first buffer, and if the acquired character is a character indicating a vowel, N, or T, the character as a vowel as it is, The conversion is complemented by “nn” indicating “n” or “xtu” indicating the prompt sound “tsu”. If the acquired character is neither a vowel character nor N or T, that is, a consonant character. If the character is Y, if the character is Y, ya, yu, and yo are additionally complemented to the consonant character, and the first Delete the first character Y from the buffer 1 If the character is not Y, the vowel characters a, i, u, e, and o are additionally complemented, the conversion complement, the additionally complemented character, and the character to be converted stored in the second buffer Create all combinations with columns, re-store them as character strings in the second buffer, and delete character strings that do not match the database exactly or forwardly from the character strings in the second buffer And the steps to
When the conversion candidate ranking section is a character indicating that the character acquired from the first buffer is empty, the character string group stored in the second buffer is referred to the database and given priority. A procedure for sorting in order, storing as conversion candidates in the first buffer, and initializing the second buffer to be empty;
A control unit displaying a conversion candidate in the first buffer on an output unit;
When the kana-kanji conversion unit receives the kana-kanji conversion key, the kana-kanji conversion key performs a roman-character kana conversion on the conversion candidate selected by the operator from among the conversion candidates in the first buffer, and outputs the kana candidate. Japanese character input method characterized by including the procedure for converting kana to kanji . When a conversion key for vowel interpolation is input to the vowel completion unit, the first character is acquired from the first buffer in which the character string to be converted is stored, and the acquired character is not an empty character If the acquired first character is deleted from the first buffer, and if the acquired character is a character indicating a vowel, N, or T, the character as a vowel as it is, The conversion is complemented by “nn” indicating “n” or “xtu” indicating the prompt sound “tsu”. If the acquired character is neither a vowel character nor N or T, that is, a consonant character. If the character is Y, if the character is Y, ya, yu, and yo are additionally complemented to the consonant character, and the first Delete the first character Y from the buffer 1 If the character is not Y, the vowel characters a, i, u, e, and o are additionally complemented, the conversion complement, the additionally complemented character, and the character to be converted stored in the second buffer Create all combinations with columns, re-store them as character strings in the second buffer, and delete character strings that do not match the database exactly or forwardly from the character strings in the second buffer To perform the steps to
In the conversion candidate ranking section, if the character acquired from the first buffer is an empty character, the character string group stored in the second buffer is prioritized with reference to the database. Sort in order, store as conversion candidates in the first buffer, and execute the procedure of initializing the second buffer to be empty,
Causing the control unit to execute a procedure for displaying the conversion candidates in the first buffer on the output unit;
When a kana-kanji conversion key is input to the kana-kanji conversion unit, the kana / kanji conversion is performed on the conversion candidate selected by the operator among the conversion candidates in the first buffer, and the kana candidate is output. A recording medium for recording a program for executing a procedure for converting kana to kanji .

Images