JP3938087B2 - Language input system and method - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to language input, and more particularly to a language input system and method having a prefix search processing unit.
[0002]
[Prior art]
JP-A-2001-325252 is cited as a prior art for efficiently inputting Japanese input. In this prior art, a forward match search candidate (prediction candidate search conversion) is output for an input kana character string, and the forward match search candidates are narrowed down by inputting an additional kana character string.
[0003]
Japanese Patent No. 3221477 is given as a prior art for efficiently inputting Japanese input. In this prior art, a key corresponding to a vowel of a Kana character is input, and candidates are narrowed down within a limited vocabulary of a special purpose dictionary such as a place name. Specifically, by operating the input keys of “A”, “A”, and “TA”, you can obtain “Ota (Ota)” and “Otsu (Otsu)” that have those vowels in that order, Many unspecified use dictionaries often output candidates that are far from the user's intention, and have the disadvantage of giving the user an impression that it is difficult to use.
[0004]
[Patent Document 1]
JP 2001-325252 A
[Patent Document 2]
Japanese Patent No. 3212477
[0005]
[Problems to be solved by the invention]
Thanks to remarkable advances in hardware and communication infrastructure, it has become possible to send and receive information without having to choose a location using a mobile terminal such as a mobile phone. However, a portable terminal having small and light weight as important elements can provide only the minimum necessary operation switches even for complicated character input. For example, a plurality of functions are assigned to 10 keys from “0” key to “9” key and other minority keys, and they are used properly. A conventional character input technique using the minimum necessary operation switches and its problems will be described with reference to FIGS.
[0006]
FIG. 1 is an explanatory diagram for explaining a language input system in a Japanese input system with a so-called 10-key device typified by a mobile phone.
[0007]
In the figure, the information input unit 1 includes a plurality of character input keys 2 in which a plurality of characters are assigned to the same character input key (operation key) 2 as assigned characters, and an arrow key that functions as a character feed key 3. Have. When the character input key 2 to which “4”, “GHI”, and “TA” are assigned once by the operation of the user 4 from the information input unit 1, the corresponding input signal is generated by the function of accepting the input of the kana character string. The language input system acquires the kana character “ta” by the function of acquiring the input and input kana character string. Similarly, when the character input key 2 assigned with “1”, “. @ /”, “A” is operated twice, the kana character “I” is acquired, and “6”, “MNO”, “HA” are assigned. When the character input key 2 is operated four times, the kana character “to” is acquired, and when the character input key 2 to which “0”, “waon”, “,. , Get the kana character "n". Therefore, the kana character string “Taien” can be acquired by a series of these processes. By performing kana-kanji conversion processing on the kana character string “Taien” using information stored in the Kana-Kanji conversion dictionary DB, “Taien” is converted to “very”.
[0008]
The Kana-Kanji conversion process is the process of converting the input kana character string into a kanji-mixed sentence, but it is necessary to repeat the operation until the kana character string “Taien” to be converted is confirmed, and the kana-kanji conversion process is executed. An operation for instructing is also necessary. In order to maintain portability essential for a portable terminal, such a complicated operation is inconvenient and inconvenient because it is inconvenient and can be thought of as a forward matching search process called input predictive search process .
[0009]
In the kana character string constituting “Taien”, since consecutive kana characters are not assigned to the same character input key 2, the character input key 2 to which “4”, “GHI”, and “ta” are assigned. Is operated once, and only by operating the character input key 2 to which “1”, “. @ /”, “A” is assigned, the kana character “ta” is confirmed, and “1”, “. @ /” Continues. When the character input key 2 to which “A” is assigned is operated once more, the kana character string “I” can be input.
[0010]
FIG. 2 is an explanatory diagram for explaining the forward match search process.
[0011]
In the figure, the forward match search dictionary DB 5 is a dictionary database in which words used by the forward match search processing unit 6 are stored. The language input system handles a large number of documents (in the example, Japanese). Words frequently used as sentences are stored in advance. Note that words determined by the language input system may be additionally stored within the storage capacity range. The forward match search processing unit 6 extracts a word starting from “kana character string” input from the information input unit 1 by searching the forward match search dictionary DB 5 as a forward match search candidate, and the extracted candidates Is a process of outputting. Note that the forward match search candidates extracted by the forward match search processing unit 6 are arranged in the order in which the frequency of use is the evaluation value.
[0012]
In the example, just entering the kana character “ta” and starting with the kana character “ta”, such as “very, eat, enjoy, maybe, but surely, for example, birthday, physical condition, etc.” Are frequently used as forward match search candidates, and the forward match search candidates output from the forward match search candidate processing unit 6 are displayed on the display screen (output to the information output unit 7). When the user 4 desires (or intends to input) “very”, it is only necessary to select “very” from the displayed forward matching candidates.
[0013]
When the kana character “i” is input after the kana character “ta”, the prefix matching search processing unit 6 starts with the kana character string “tai”, such as “very physical condition, typhoon, important,. The word is output as a prefix search candidate. By additionally inputting a kana character, the forward matching search candidates are automatically narrowed down. That is, when the kana character “i” following the kana character “ta” is input to the front match search processing unit 6, the kana character string “tai” other than the kana character string “tai” is selected from the front match search candidates starting with the kana character “ta”. Since the beginning matching search candidates that start are not output, the number of output candidates is automatically reduced.
[0014]
FIG. 3 is an explanatory diagram for explaining problems of the language input system shown in FIG.
[0015]
This figure shows the problem of the input method shown in FIG. 1 using a specific example in which the adverse effects of the minimum necessary operation switches cannot be hidden. In the figure, the user 4 is going to input “just” which is often used as an idiom such as “just this” or “just now”. Just entering the kana character “ta”, as shown in FIG. 2, only the forward matching candidates of “very, eat, enjoy, maybe, just, for example, birthday, physical condition,...” Are displayed. User 4 has to input an additional kana character “tsu”. Eventually, even if “only” is stored as a forward match search candidate in the forward match search dictionary DB 5, if it is not displayed on the display screen, the user 4 cannot select it, and therefore inputs a kana character string. It will be.
[0016]
However, in the input system shown in FIG. 1, since the kana character “ta” and the kana character “one” (the same applies to the lower case “tsu”) are assigned to the same character input key 2, No matter how many times the character input key 2 to which “GHI” “TA” is assigned is operated, “TA, TSU, TSU, TE, TO, DA, ぢ, ZE, TO,” are repeated in order. The language input system alone cannot acquire the kana character string “tatsu”. User 4 performs a character feed operation to move the character input position to the right by one character after inputting the kana character “ta”, and then newly assigns characters “4”, “GHI”, and “ta”. The kana character “tsu” can be acquired only by operating the input key 2 six times.
[0017]
As described above, for example, if Kana characters that are continuously input such as the kana character string “Tai” are not assigned to the same character input key, the character input key to which “ta” is assigned After the operation, just by operating another character input key assigned “I”, the language input system will automatically determine the kana character, so the character assigned to the same character input key There is a problem that the user feels that the operability is remarkably bad with respect to the “character feeding operation” which is necessary only in the case of “tatsu” that is continuously input. In other words, because multiple characters are assigned to the same character input key, the “character feed operation” that is required only when the characters assigned to the same character input key are continuously input is The problem is that it hinders the convenience of language input.
[0018]
In addition, if the kana character string assigned to the same character input key is not continuous in this way, in a language input system that allows input without a character advance operation, the character advance operation is the rhythm until then. Disturbing the user's operation rhythm, which was often input, was a hidden problem. Users who are disturbed by the rhythm of character input operations will gradually become frustrated and will be dissatisfied with the language input system. Once a user is dissatisfied with a language input system, he / she has the impression that the device / equipment itself equipped with the language input system cannot be used. Not only can it be easily wiped away, but it also becomes a serious problem for devices and equipment equipped with a language input system.
[0019]
[Means for Solving the Problems]
The essence of the present invention is that, in the forward matching search process, if the last character input from the information input unit is the latest input character, the assigned character assigned to the same character input key as the most recently input character is input from the information input unit. Is to preferentially output the forward matching search candidate following the set character string. In the conventional language input systems, when characters assigned to the same character input key are continuously input, it is necessary to perform a character feed operation for moving the character input position by one character. According to the language input system in FIG. 3, the forward match search candidates that require a character advance operation are displayed with priority over other candidates, so that the candidates output as the forward match search candidates can be displayed without performing the character advance operation. Just select and enter.
[0020]
The present invention relates to an information input means comprising a plurality of operation keys, wherein at least a plurality of characters are assigned to the same operation key as assigned characters, and an input character string input from the information input means by the operation keys. Forward match search processing means for outputting a forward match search candidate, forward match search candidate display means for displaying the forward match search candidate output from the forward match search processing means in a display area, and display in the display area An input character rule storage unit for storing the assigned character as an assigned character rule for each operation key; and the forward matching search processing unit. When the forward matching search candidate is acquired from the latest input character acquisition, the last input character from the information input means is acquired as the latest input character. Assigned character determination means for determining the assigned character assigned to the same operation key as the latest input character acquired by the latest input character acquisition means based on the assigned character stored in the assigned character rule; The forward match search output from the forward match search processing means for the forward match search candidate in which one of the assigned characters determined by the assigned character determination means is continuous with the character string input from the information input means. A forward match search candidate extracting means for extracting from the candidates, and a display rank changing means for changing the display rank of the extracted forward match search candidates when the forward match search candidate extracting means has extracted the forward match search candidates. The forward matching search candidate display means further includes the forward match search candidate display means in the display area based on the display order changed by the display order change means.致 was to display the search suggestions.
[0021]
The assigned character rule storage unit stores the assigned character rule for each input mode of the information input unit, and the assigned character determination unit stores the assigned character rule corresponding to the input mode in the assigned character rule storage. The assigned character rule acquired from the section may be used for the determination process.
[0022]
Even if the information input unit shares a character input key in a plurality of input modes, it can be used in all the input modes by selecting the corresponding assigned character rule according to the switching of the input mode.
[0023]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, specific embodiments of a language input system according to the present invention will be described in detail with reference to the drawings. The character string that the language input system accepts from the information input unit 1 is mainly described as a kana character string as a representative example, but is assigned as an assigned character to an English character string, a character string of another language, or the same operation key. It can be considered that the same applies to the symbols given.
[0024]
FIG. 4 is a hardware block diagram of a portable terminal including the language input system according to the embodiment of the present invention.
[0025]
In the figure, an information input unit 1 and an information output unit 7 are parts having an input / output function for various exchanges between the portable terminal 8 and the user 4. The input device in the information input unit 1 corresponds to, for example, various switches such as a numeric keypad, and the output device in the information output unit 7 corresponds to, for example, a display screen (display). The calculation unit 9 is a part having a calculation function for driving and processing each function by executing a program, and is generally configured by a CPU (Central Processing Unit). The memory unit 10 is a part of an execution area of a program executed by the calculation unit 9. The communication unit 11 is a part that controls communication of information with other terminals and systems via the network 12. The DB management unit 13 is a part having a function of managing various data structures and data entities.
[0026]
The processing program 14 managed by the DB management unit 13 is a program necessary for achieving the purpose of use of the mobile terminal 8, and includes an OS (operating system). The DB management unit 13 also manages the forward match search dictionary DB 5 used for the forward match search process and the kana-kanji conversion dictionary DB 15 used for the kana-kanji conversion process. Similarly, the assigned character rule information DB 16 is a database that stores assigned character rules indicating which assigned character is assigned to which character input key 2. The portable terminal 8 is often provided with a plurality of input modes such as hiragana, katakana, alphabetic characters, and numbers. When there are a plurality of input modes, different characters are assigned even with the same character input key 2. Therefore, the assigned character rule should be in each input mode. Similarly, the learning dictionary DB 17 is a database that stores input history information used as one of evaluation values by the prefix matching search dictionary DB 5 and the kana-kanji conversion dictionary DB 15.
[0027]
FIG. 5 is a functional block diagram of the language input system according to the embodiment of the present invention.
[0028]
In the figure, the language input system searches for a forward match search candidate from the forward match search dictionary DB 5 based on the function of acquiring the character string input from the information input unit 1 and the acquired kana character string. It has a forward match search processing unit 6 composed of a function of extracting a forward match search candidate as a search result and a function of outputting the extracted forward match search candidate to the next processing unit. When the forward matching search candidate is output, the last kana character (the last input from the information input unit 1) is obtained from the kana character string acquired by the function for acquiring the kana character string input from the information input unit 1. A function for acquiring only one kana character) as the latest input character, a function for reading the assigned character rule applied to the kana character acquired as the latest input character from the assigned character rule information DB 16, A function for determining an assigned character assigned to the same character input key 2 as the acquired most recently input character and a function for obtaining a kana character string input from the information input unit 1 based on the assigned assigned character rule. A function to create a kana character string to be searched by acquiring the acquired kana character string and consecutively assigning the assigned character that is the determination result to the acquired kana character string, and the created kana character string to be searched at the top of the candidate The function of extracting the included forward match search candidates from the forward match search candidates output from the forward match search processing unit 6, and when the corresponding forward match search candidates are extracted, the extracted forward match search candidates From the forward match search processing unit 6, the function for changing the display priority, the display priority changed when the display priority is changed, and the display priority as it is when the display priority is not changed. And a function of outputting a force has been prefix match search candidate to the information output section 7. Note that the language input system may have a function of updating the content stored in the forward match search dictionary DB 5 based on the output result output to the information output unit 7.
[0029]
FIG. 6 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
[0030]
In the figure, when the language input system acquires a character string input from the information input unit 1 (ST601), the language input system searches for a forward match search candidate from the forward match search dictionary DB 5 based on the acquired kana character string. Then, a forward match search candidate is extracted as a search result (ST602), the extracted forward match search candidate is output to the next processing unit (ST603), and the process ends.
[0031]
FIG. 7 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
[0032]
In the figure, the language input system, when a forward match search candidate is output from the forward match search processing unit 6 (ST701), the kana character string acquired by the function of acquiring the kana character string input from the information input unit 1 , The last acquired kana character (the last character input from the information input unit 1) is acquired as the most recently input character (ST702), and the assigned character applied to the Kana character acquired as the most recently input character A rule is read from the assigned character rule information DB 16 (ST703), and based on the read assigned character rule, an assigned character assigned to the character input key 2 that is the same as the acquired most recently input character is determined (ST704), and an information input unit Acquires the kana character string acquired by the function that acquires the kana character string input from 1, and assigns the acquired character to the acquired kana character string A kana character string to be searched is continuously generated (ST705), and a front match search candidate including the generated search target kana character string at the head of the candidate is displayed as a front match search candidate output from the front match search processing unit 6. Is determined (ST706), and when the corresponding forward match search candidate is extracted, the display priority of the extracted forward match search candidate is changed (ST707), and the display priority is changed. If the corresponding forward matching search candidate is not extracted in ST706, the forward matching search candidate output from the forward matching search processing unit 6 is used as it is. Is output (ST708), and the process ends.
[0033]
FIG. 8 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
[0034]
In this figure, when the language input system reflects the output result output to the information output unit 7 in the front match search dictionary DB 5 (ST801), the front match search dictionary is based on the output result output to the information output unit 7. The contents stored in DB5 are updated (ST802), and the process is terminated.
[0035]
FIG. 9 is an explanatory diagram illustrating a specific example of assigned character rule information according to the embodiment of this invention.
[0036]
In the figure, the assigned character assigned to the same character input key 2 differs depending on the input mode. In the example shown in the figure, there are two typical input modes, “Hiragana (Katakana)” and “English”. When the input mode is hiragana, the hiragana character “aiueoai ぅ ぉ” is assigned as the assigned character to the character input keys 2 of “1”, “. @ /”, “A”, and the input mode is alphabetic. At the time, the symbol “. @ /” Is assigned as the assigned character. Similarly, “2”, “ABC”, “ka” character input keys 2 are assigned hiragana characters of “Kakigokukoga Gigugugo” when the input mode is hiragana, and when the input mode is alphabetic characters. The alphabet “ABCabc” is assigned. Other character input keys 2 are as shown in the figure.
[0037]
FIG. 10 is a functional block diagram of the language input system according to the embodiment of the present invention.
[0038]
In the same figure, the language input system acquires as the latest input character based on the input character or the function of determining the input mode based on the acquired information from the information input unit 1 and the determined input mode. It is preferable to have a function of selectively reading from the assigned character rule information DB 16 the assigned character rule applied to the kana character. With these functions, even if the information input unit 1 shares the character input key 2 in a plurality of input modes, the assigned character rule acquired from the assigned character rule information DB 16 can be selected according to the input mode switching. Can respond.
[0039]
FIG. 11 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
[0040]
In the figure, when the input mode is determined based on the input character or based on the acquired information from the information input unit 1 (ST1101), the kana character acquired as the most recent input character based on the determined input mode. The assigned character rule to be applied is selectively read from the assigned character rule information DB 16 (ST1102), and the process ends.
[0041]
FIG. 12 is an explanatory diagram illustrating a specific example in the embodiment of the present invention.
[0042]
FIG. 13 and FIG. 13 show specific examples when the input mode is hiragana (katakana). In the same figure, the language input system, when a forward match search candidate is output from the forward match search processing unit 6, from the character string “ta” acquired by the function of acquiring the character string input from the information input unit 1, The last acquired character (the character input last from the information input unit 1) “ta” is acquired as the latest input character. When the character “ta” is acquired as the latest input character, the assigned character rule applied to the acquired latest input character “ta” is read from the assigned character rule information DB 16, and the acquired latest input character is obtained based on the read assigned character rule. The assigned character assigned to the same character input key 2 as “TA” is determined. The result of determination as the assigned character is “Tadatada tsutsudado”. Next, the character string “ta” acquired by the function for acquiring the character string input from the information input unit 1 is acquired, and the assigned character “tadatada tsudadedo” as the determination result is acquired in the acquired character string “ta”. The search target character strings “tata, tachi, tatsu, tate, tatsu, tada, tatsu, tatsu, tado tado” are created in succession.
[0043]
Prefix search processing that includes the search target character string “Tata, Tachi, Tatsu, Tateto, Tada, Tada, Tatsu, Tadato, Tado” at the top of the candidate. If it is determined whether or not the forward matching search candidate output from the unit 6 is “very, eat, enjoy, maybe, just, for example, birthday, physical condition, just ...”, the corresponding forward “Only, for example, only” is extracted as a match search candidate. From the extracted forward matching search candidates “just, for example, just”, from other forward matching search candidates that have not been extracted, “very, eat, enjoy, maybe, sure, birthday, physical condition, ...” Is also preferentially output to the information output unit 7. When the forward match search candidate output from the forward match search processing unit 6 is output with the changed display priority, the forward match search candidate is displayed in the information output unit 7 as “just, for example, just eat, enjoy, maybe , Sure, birthday, physical condition, ... "are output in this order.
[0044]
FIG. 13 is an explanatory diagram illustrating a specific example in the embodiment of the present invention.
[0045]
In the figure, the language input system, when a forward match search candidate is output from the forward match search processing unit 6, from the character string “tai” acquired by the function of acquiring the character string input from the information input unit 1, The last acquired character (the character input last from the information input unit 1) “I” is acquired as the most recently input character. When the character “I” is acquired as the most recently input character, the assigned character rule applied to the acquired most recently input character “I” is read from the assigned character rule information DB 16, and the acquired most recently input character is obtained based on the read assigned character rule. The assigned character assigned to the same character input key 2 as “I” is determined. The determination result as the assigned character is “Aiueoai ぉ ぉ”. Next, the acquired character string “Tai” is acquired by the function for acquiring the character string input from the information input unit 1, and the assigned character “Aiueo Aie ぉ” which is the determination result is acquired in the acquired character string “Tai”. The search target character string "Taia, Taai, Tao, No, Tao, Taa, Taii, Tai, Tai, Tai" is created in succession.
[0046]
The search target character string “Taia, Taai, Tao, No, Tao, Taa, Tai, Tai, Tae, Tai” is included in the head of the candidate. Whether or not it is in the forward match search candidate output from the match search processing unit 6 “very hard, physical condition, important, tournament, typhoon, correspondence, time, type, gymnastics, physical education, discharge, great, ...” When the determination is made, “correspondence, physical education, discharge” is extracted as a corresponding forward matching search candidate. Other forward match search candidates that have not been extracted from the display priority of the extracted forward match search candidate “correspondence, physical education, discharge” “very physical condition, important, tournament, typhoon, time, type, gymnastics, very much, ... Is changed so that the information is output to the information output unit 7 in preference to "." When the forward match search candidate output from the forward match search processing unit 6 is output with the changed display priority, the forward match search candidate is displayed in the information output unit 7 as “correspondence, physical education, discharge, very, physical condition, important, tournament. , Typhoon, Time, Type, Gymnastics, Much, ... ".
[0047]
FIG. 14 is an explanatory diagram illustrating a specific example in the embodiment of the present invention.
[0048]
FIG. 15 and FIG. 15 show specific examples when the input mode is alphabetic. In the figure, the language input system, when a front match search candidate is output from the front match search processing unit 6, from the character string “m” acquired by the function of acquiring the character string input from the information input unit 1, The last acquired character (the character input last from the information input unit 1) “m” is acquired as the latest input character. When the character “m” is acquired as the most recently input character, the assigned character rule applied to the acquired most recently input character “m” is read from the assigned character rule information DB 16 and the acquired most recently input character is obtained based on the read assigned character rule. The assigned character assigned to the same character input key 2 as “m” is determined. The determination result as the assigned character is “mno”. Next, the acquired character string “m” is acquired by the function of acquiring the character string input from the information input unit 1, and the assigned character “mno” as the determination result is continued to the acquired character string “m”. The search target character string “mm, mn, mo” is created.
[0049]
The forward match search candidate including the created search target character string “mm, mn, mo” at the head of the candidate is the forward match search candidate “my, make, me, move, much, When “may, more, March, Monday,...” is determined, “move, more, Monday” is extracted as a corresponding forward match search candidate. Prioritized over other forward matching search candidates “my, make, me, much, may, March,...” From which the display priority of the extracted forward matching search candidates “move, more, Monday” has not been extracted. To be output to the information output unit 7. When the forward match search candidate output from the forward match search processing unit 6 with the changed display priority is output, the forward match search candidate is displayed as “move, more, Monday, my, make, me, and much in the information output unit 7. , May, March,...
[0050]
FIG. 15 is an explanatory diagram illustrating a specific example in the embodiment of the present invention.
[0051]
In the figure, the language input system, when a forward match search candidate is output from the forward match search processing unit 6, from the character string “mo” acquired by the function of acquiring the character string input from the information input unit 1, The last acquired character (the character input last from the information input unit 1) “o” is acquired as the latest input character. When the character “o” is acquired as the most recently input character, the assigned character rule applied to the acquired most recently input character “o” is read from the assigned character rule information DB 16, and the acquired most recently input character is obtained based on the read assigned character rule. The assigned character assigned to the same character input key 2 as “o” is determined. The determination result as the assigned character is “mno”. Next, the acquired character string “mo” is acquired by the function of acquiring the character string input from the information input unit 1, and the assigned character “mno” as the determination result is continuously added to the acquired character string “mo”. The search target character string “mom, mon, moo” is created.
[0052]
The forward match search candidates including the created search target character strings “mom, mon, moo” at the head of the candidates are the forward match search candidates “move, more, money, Monday, most, When it is determined whether or not it is in “month, morning, mountain, moment,...”, “money, Monday, month, moment” is extracted as a corresponding forward match search candidate. Precedence over other forward match search candidates “move, more, most, morning, mountain,...” For which the display priority of the extracted forward match search candidates “money, Monday, month, moment” has not been extracted. To be output to the information output unit 7. When the forward match search candidates output from the forward match search processing unit 6 are output with the changed display priority, the forward match search candidates are displayed as “money, Monday, month, moment, move, more, most, in the information output unit 7. , Morning, mountain,...
[0053]
【The invention's effect】
According to the present invention described above, when the last character input from the information input unit is the most recently input character in the prefix matching search process, the assigned character assigned to the same character input key as the most recently input character is the information input. Since the forward matching search candidate following the character string input from the section is preferentially output, the language can be input by simply selecting the candidate output as the forward matching search candidate without performing a character feed operation.
[Brief description of the drawings]
FIG. 1 is an explanatory diagram illustrating a language input system in a Japanese input system with a so-called 10-key device typified by a mobile phone
FIG. 2 is an explanatory diagram for explaining a prefix matching search process
FIG. 3 is an explanatory diagram for explaining problems of the language input system shown in FIG.
FIG. 4 is a hardware block diagram of a mobile terminal including a language input system according to an embodiment of the present invention.
FIG. 5 is a functional block diagram of a language input system according to an embodiment of the present invention.
FIG. 6 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
FIG. 7 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
FIG. 8 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG.
FIG. 9 is an explanatory diagram illustrating a specific example of assigned character rule information according to the embodiment of this invention.
FIG. 10 is a functional block diagram of a language input system according to an embodiment of the present invention.
FIG. 11 is a flowchart in the calculation unit of the language input system corresponding to the functional block diagram shown in FIG. 10;
FIG. 12 is an explanatory diagram for explaining a specific example in the embodiment of the present invention.
FIG. 13 is an explanatory diagram for explaining a specific example in the embodiment of the present invention.
FIG. 14 is an explanatory diagram for explaining a specific example in the embodiment of the present invention.
FIG. 15 is an explanatory diagram for explaining a specific example in the embodiment of the present invention.
[Explanation of symbols]
1 Information input section
2 Character input keys (operation keys)
3 Character feed key
4 users
5 Dictionary database for forward matching search
6 Forward match search processing part
7 Information output section
8 Mobile devices
15 Kana-Kanji conversion dictionary DB
16 Assigned character rule information DB
17 Learning Dictionary DB

Claims (4)

Information input means comprising a plurality of operation keys, wherein at least a plurality of characters are assigned to the same operation key as assigned characters;
A forward match search processing means for outputting a forward match search candidate for the input character string input by the operation key from the information input means;
A forward match search candidate display means for displaying the forward match search candidate output from the forward match search processing means in a display area;
When a candidate displayed in the display area is selected, a language input system having input confirming means for confirming input of the selected candidate,
An assigned character rule storage unit for storing the assigned character as an assigned character rule for each operation key;
When the forward match search candidate is acquired from the forward match search processing means, the latest input character acquisition means for acquiring only one last input character from the information input means as the latest input character;
Assigned character judging means for judging the assigned character assigned to the same operation key as the most recently input character obtained by the nearest input character obtaining means based on the assigned character stored in the assigned character rule;
The forward match search output from the forward match search processing means for the forward match search candidate in which one of the assigned characters determined by the assigned character determination means is continuous with the character string input from the information input means. A forward matching search candidate extraction means for extracting from the candidates;
When the forward matching search candidate extracting means extracts the forward matching search candidate, the forward matching search candidate extracting means further includes a display order changing means for changing the display order of the extracted forward matching search candidates,
The language input system, wherein the front matching search candidate display means displays the front matching search candidate in the display area based on the display order changed by the display order changing means. The assigned character rule storage unit stores the assigned character rule for each input mode of the information input means,
The said assigned character judgment means acquires the said assigned character rule according to the said input mode from the said assigned character rule memory | storage part, and uses the acquired said assigned character rule for a determination process. Language input system. Information input means comprising a plurality of operation keys, wherein at least a plurality of characters are assigned to the same operation key as assigned characters;
A forward match search processing means for outputting a forward match search candidate for the input character string input by the operation key from the information input means;
A forward match search candidate display means for displaying the forward match search candidate output from the forward match search processing means in a display area;
When a candidate displayed in the display area is selected, a language input method using a language input system having input confirmation means for confirming input of the selected candidate,
Storing the assigned character in the assigned character rule storage unit as an assigned character rule for each operation key;
When the forward match search candidate is acquired from the forward match search processing means, the last input character acquisition means is acquired as the last input character by only one character last input from the information input means,
The assigned character determining means determines the assigned character assigned to the same operation key as the most recently input character acquired by the nearest input character acquiring means based on the assigned character stored in the assigned character rule,
The forward match search output from the forward match search processing means for the forward match search candidate in which one of the assigned characters determined by the assigned character determination means is continuous with the character string input from the information input means. The candidate is extracted from the candidates by the forward matching search candidate extraction means,
When the forward match search candidate extraction unit extracts the forward match search candidate, the display rank changing unit changes the display order of the extracted forward match search candidate,
The language input method, wherein the front matching search candidate display means displays the front matching search candidate in the display area based on the display order changed by the display order changing means. The assigned character rule storage unit stores the assigned character rule for each input mode of the information input means,
The said assigned character judgment means acquires the said assigned character rule according to the said input mode from the said assigned character rule memory | storage part, and uses the acquired said assigned character rule for a determination process. Language input method .

Images