JP2002169644A - Portable telephone - Google Patents

Abstract

PROBLEM TO BE SOLVED: To simplify a character input operation when inputting an e-mail address or a URL for viewing a Web page, using limited keys such as ten keys. SOLUTION: This portable telephone has a word dictionary storing means storing a plurality of character strings and a word dictionary searching means for searching these character strings, when inputting a character string, searches the word dictionary storing means, using a search character string inputted with a character inputting means, if a candidate character string containing the search character string is present, selects the candidate character string, thereby inputting the character string, if a candidate character string containing the search character string is not present, continues inputting with the character inputting means, and, at the time of completion of inputting the character string, stores the inputted character string in the word dictionary storing means.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an electronic mail transmitting / receiving function,
The present invention relates to a mobile phone capable of simplifying and inputting a character input operation for inputting an e-mail address or a URL when browsing a Web page using a limited key such as a numeric keypad with a b-page browsing function.

[0002]

2. Description of the Related Art In recent years, as mobile phones have become more sophisticated, e-mail transmission / reception services using mobile phones and services for browsing Web pages have become widespread. FIG. 5 is an external view of a conventional mobile phone. In a conventional mobile phone, a limited number of input keys are arranged due to restrictions on the size of the terminal itself, and characters are input using these keys.
Input keys include 10 numeric keys from 0 to 9, * key,
There are a # key, a clear key for deleting input characters, an input mode switching key for switching input modes, a conversion key for converting input kana characters to kanji and the like. The input mode includes a kanji input mode, an alphabet input mode, a numeric input mode, a symbol input mode, and the like. A plurality of characters and symbols are assigned to each input mode, and one or more of these keys are switched while switching the input mode. The desired character is called out by pressing the button twice. For example,
The “5” key is assigned a half-width numeral “5” in the numeric mode. In the Kanji mode, five kana characters on the “na” line are assigned,
It switches to "ni" → "nu" → "ne" → "no" → "na" → .... In the alphabet input mode, "J", "K", "L"
Are assigned, and six characters including these lowercase letters appear in sequence each time the key is pressed. While the same key is repeatedly pressed, the input candidate character is switched each time the key is pressed, and when another key is pressed, the input character is determined, and the state shifts to the input state of the next character.

Further, as shown in FIG. 6, some character strings (“http: //”, “www.”, “Co.j”) frequently used in e-mail transmission and Web page browsing depending on the terminal.
In some cases, these character strings can be directly called out in the same processing as the above-described character input processing.

[0004]

[Problems to be Solved by the Invention] E-mail transmission and We
In the specification of an address or a URL for browsing page b, the user needs to press a considerable number of keys together with alphanumeric characters and symbols, which is a very troublesome operation for the user. For specific character strings commonly used in email addresses and URLs, it is possible to omit key operations for input by assigning them to specific keys and calling them as shown in the prior art. However, frequently used addresses and URLs are different for each user,
In addition, since many of them have proper nouns, abbreviations, coined words, etc., it is impossible to deal with all of them by the method shown in the related art. It is necessary to press and input one character at a time.

[0005]

SUMMARY OF THE INVENTION The present invention has been made to solve these problems, and comprises a character input means comprising a plurality of keys; a word dictionary storage means for storing a plurality of character strings; It has a word dictionary search means for searching for a character string in the word dictionary storage means, and when inputting a character string, searches the word dictionary storage means using the search character string input by the character input means, As a result of the search, when a candidate character string including the search character string exists in the word dictionary storage unit, the character string is input by selecting the candidate character string, and the candidate character string including the search character string is included. If the character string does not exist, input is continued from the character input means, and the character string input at the time when the input of the character string is completed is stored in the word dictionary storage means. page Providing a character input assist method for simplifying the character input operation for performing the input of the URL at the time list. Further, the character input assisting means of the present invention calculates a first key press count required when directly inputting the character string when registering the character string in the word dictionary storage means.
Key press count calculation processing means, and a second key press count calculation processing means for calculating a minimum required second key press count when the character string is called from the word dictionary storage means,
A key press count comparing unit for comparing the first key press count and the second key press count; and as a result of the key press count comparison processing, the second key press count is determined by the first key press count. If the number of key presses is smaller than the number of times the key string is pressed, the character string is registered in the word dictionary storage means.

[0006]

Embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a schematic diagram showing a configuration of an embodiment of the present invention. The mobile phone according to the present embodiment has a character input unit 10 including a plurality of keys. Characters input by the character input unit 10 are stored in the undetermined character string buffer 11 in the order in which the characters are input. The search character string stored in the undetermined character string buffer 11 is searched by the word dictionary search means 16 in the word dictionary stored in the word dictionary storage means 15, and as a result of the search, candidate character strings including the search character string Is found, a candidate character string is displayed on the display means 17. On the other hand, if the candidate character string does not exist in the word dictionary as a result of the search, the first key press count calculating means 12 needs to enter the first character string necessary for directly inputting the character string when the input of the character string is completed. Calculate the number of key presses,
The key press count calculation means 13 calculates the minimum number of second key presses required when the character string is called from the word dictionary storage means 15. The key press count comparing unit 14 compares the two key press counts, and registers the character string in the word dictionary storage unit 15 only when calling from the word dictionary reduces the key press count.

Next, the operation of the embodiment of the present invention configured as described above will be described with reference to FIGS. First, the operation of the registration process of a character string not registered in the dictionary will be described. Here, the character string "taro @ kyoc"
era. co. jp "will be described as an example.

When the application enters a character input state and the first character "t" is input by pressing the key of the user (ST1), the corresponding character is stored at the head of the undetermined character string buffer on the RAM. (ST2). When the character "t" is input to the undetermined character string buffer, the CPU searches a character string registered in the word dictionary for a candidate character string corresponding to the character string in the buffer (ST3). Since an unregistered character string is input, the number of candidate character strings is 0, and the system waits for the next character input while the dictionary call is invalid. If the subsequent input characters are alphanumeric characters (0-9, az, AZ) (ST11), the input characters are added to the undetermined character string buffer (ST2).

If the input character is a symbol or space other than alphanumeric characters, that is, if "@" is input (ST11), it is determined that the input of the character string has been completed with the input character, and the input has been made by that time. The registration determination of the character string “taro” stored in the undetermined character string buffer is performed (ST
12). In the registration judging process, data matching the character string is searched from the data in the word dictionary. If there is no matching character string as a result of the search, registration processing is performed (ST13).

In the registration process, the number of key presses N1 required to input a character string to be registered is obtained (ST1).
5). In the case of the key assignment shown in FIG. 6, the character string "tar"
“o” means that “t” is the first of “8” keys and “a” is “2”
The first key, “r” is assigned to the third “7” key, and “o” is assigned to the third “6” key, so at least eight key presses are required for input. Become. Next, when registered in the word dictionary, the minimum number of key presses N2 required to call up the character string is obtained (ST16). In the case of the character string "taro", the number of registered characters and the search order are slightly different. However, once the first character "t" is called, once the word dictionary is called, and once confirmed, the key is pressed a minimum of three times. It is possible to call. The key press counts N1 and N2 obtained in this way are compared (ST17). If the key press count N1 for direct input is larger than the key press count N2 for calling from the word dictionary, the character string is converted to the word dictionary. (ST18). After the registration process is completed, the character string is determined, the undetermined character string buffer (ST14) is cleared, and the process proceeds to the next character input.

Hereinafter, the character string "kyocer"
Although "a" and "co" are registered in the word dictionary, as for the character string "jp", "j" is assigned to the first key of the "5" key, and "p" is assigned to the first key of the "7" key. Therefore, N1 is twice, and the number of key presses is smaller when directly inputting than when registering in the word dictionary. Therefore, registration in the word dictionary is not performed.

Next, a process of calling a character string registered in a word dictionary and inputting characters will be described. Here, "kaa", "kbb", "kyocer"
Four character strings “a” and “kzz” are registered, and the operation of character input using a word dictionary will be described by taking as an example a case where the character string “kyocera” is called. When the application enters a character input state and the first character "k" is input by the user pressing a key (ST1), the corresponding character is stored at the head of the undetermined character string buffer on the RAM (ST2). ). When the character "k" is input to the undetermined character string buffer, the CPU searches a character string registered in the word dictionary for a candidate character string starting with "k" (ST3). When there is a candidate character string, calling of the word dictionary becomes valid (ST6), and it becomes possible to call the candidate character string by pressing the dictionary call key. At this time, an icon or the like may be displayed on the screen to notify the user that the word dictionary call is valid. In this state, the user presses the dictionary call key (ST8).
Then, the CPU displays the first candidate character string "kaa" at the input position in an undetermined state (ST19), and waits for the next character input. When displaying a candidate character string, it is easier for the user to use a display such as reverse display or underline display to indicate that the character string is in an undetermined state. In the present embodiment, the display order of the candidate character strings is alphabetical. However, the display order of the character strings may be the order of the number of characters, the order of the use frequency, or the like. If the next key input is a scroll key, the next candidate character string corresponding to the direction designated by the scroll key or the previous candidate character string is displayed (ST22). In this embodiment, “kbb” is displayed in the case of scrolling in the forward direction, and “kzz” is displayed in the case of scrolling in the reverse direction. This operation is repeated until the character string “kyocera” is displayed on the screen. When the character string “kyocera” is displayed, the user presses the enter key. When the pressing of the enter key is detected (ST2
3), the CPU determines the character string “kyocera” in an undetermined state
Is determined (ST24), and the undetermined character string buffer is cleared (ST14). Also, the input position is shifted by the input character string in preparation for the next input. In this case, the number of times the key is pressed is two times for calling “k”, one time for pressing the dictionary call key, two times for scrolling, and one time for the enter key, for a total of six times. On the other hand, when direct input is performed, 17 key presses are required, which means that key operations required for input have been greatly reduced.

When the dictionary call key is pressed and a candidate character string is displayed and an alphanumeric character is entered in the next key input, the CPU adds the input character to the undetermined character string buffer ( ST25), a word dictionary is searched using the new character string added (ST26).
It is assumed that the character “y” is input in a state where “k” is stored in the undetermined character string buffer and the candidate character string “kaa” is displayed on the screen. The input character “y” is added to the undetermined character string buffer, and the stored character string is “ky”. Subsequently, a search using the character string “ky” is performed in ST, and as a result, the character string “kyocer” is obtained.
"a" is displayed as a candidate character string. On the other hand, if the candidate character string is not found as a result of the search using the new character string formed by adding the input characters, the process exits the dictionary search state and returns to the normal character input state (ST28).

[0014]

As described above, according to the present invention, a key is depressed by inputting an e-mail address when transmitting an e-mail by a mobile phone or calling a frequently used character string from a word dictionary in a URL when browsing a Web page. Since the number of times can be reduced and input errors can be reduced, a terminal which is easy for the user to use can be provided. Furthermore, by comparing the number of key presses for direct input when registering a character string in the word dictionary and the number of key presses for calling from the word dictionary, efficient dictionary registration can be performed and the memory size can be reduced.

[Brief description of the drawings]

FIG. 1 is a schematic diagram showing a configuration of an embodiment of the present invention.

FIG. 2 is a diagram illustrating a flow of a character input process according to an embodiment of the present invention.

FIG. 3 is a diagram illustrating a flow of a character string registration process according to the embodiment of the present invention.

FIG. 4 is a diagram illustrating a flow of a character string calling process in the embodiment of the present invention.

FIG. 5 is an external view of a conventional mobile phone.

FIG. 6 is a diagram illustrating key assignment in a conventional mobile phone.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 Character input means 11 Undetermined character string buffer 12 First key press count calculating means 13 Second key press count calculating means 14 Key press count comparing means 15 Word dictionary storage means 16 Word dictionary search means 17 Display means

Claims (2)

[Claims] 1. A character input means comprising a plurality of keys to each of which a plurality of characters are assigned, a word dictionary storage means for storing a plurality of character strings, and said word dictionary storage means. Has a word dictionary search means for searching for a character string within, and when inputting a character string, searches the word dictionary storage means using the search character string input by the character input means, and as a result of the search, If there is a candidate character string including the search character string in the word dictionary storage means, select the candidate character string and input the character string.If no candidate character string including the search character string exists, A portable telephone, wherein the character string input by continuing the input from the character input means and storing the character string when the input of the character string is completed is stored in the word dictionary storage means. 2. A first key press count calculation processing means for calculating a first key press count required for directly inputting a character string when registering the character string in the word dictionary storage means. A second key press count calculating means for calculating a minimum required second key press count when a character string is called from the word dictionary storage means; the first key press count and the second key press count And a key press count comparison processing means for comparing the result of the key press count comparison processing means,
2. The mobile phone according to claim 1, wherein the character string is registered in the word dictionary storage when the second key press count is smaller than the first key press count.