WO2003041371A1

WO2003041371A1 - Method and apparatus for name search from personal information database

Info

Publication number: WO2003041371A1
Application number: PCT/EP2001/014206
Authority: WO
Inventors: Qingzhong Guo; Yiding Zhou
Original assignee: Alcatel
Priority date: 2001-11-08
Filing date: 2001-11-08
Publication date: 2003-05-15
Also published as: CN1486564A

Abstract

A method and apparatus for searching a name from a personal information database. At least a first letter of a family name, a predetermined character and at least a first letter of a first name are input in sequence. A search string is updated each time when a new letter is input. The letters before the predetermined character are compared with the family names in the database, and the letters after the predetermined character, with the first names in the database. With this search method, the efficiency of inputting is increased, but searching accuracy is not degraded.

Description

METHOD AND APPARATUS FOR NAME SEARCH FROM PERSONAL INFORMATION DATABASE

FIELD OF THE INVENTION This invention relates to a method and apparatus for searching a name from a personal information database, in particular, to a method and apparatus for searching a name from a directory in a mobile phone, and a radiocommunication terminal using the same.

TECHNICAL BACKGROUND

A computer or personal digital assistant (PDA) can comprise various kinds of personal information databases each of which generally consists of names and special data corresponding thereto such as telephone numbers, addresses, e-mail addresses, comments, etc. Similarly, a mobile phone also comprises at least one directory. Typically, a directory consists of entries each containing a person's name and his telephone number. A person's name consists of a family name, a first name and an optional middle name. A user may obtain one's telephone number by searching the corresponding name from a directory. Many methods have been proposed for name search. One prior search method is to input a string which stands for a person's name. By comparing the input string with the names of all the entries in a directory, a matched entry will be searched out, and then the corresponding telephone number can be displayed on a screen.

It is well known that a mobile phone comprises a keypad of numeric keys 0-9. These numeric keys can be used to input telephone numbers. Furthermore, some of the numeric keys are in relation to 26 alphabet letters and can be used to input these letters. For example, numeric key 2 stands for A, B and C; 3 for D, E and F; 4 for G, H and I, 5 for J, K and L; 6 for M, N and O; 7 for P, Q, R and S; 8 for T, U and V; and 9 for W, X, Y and Z. As mentioned above, in the prior search method, the user must input a string which includes all the letters in the whole name including the family name and the first name. As one whole name usually contains 6 alphabet letters or more and one numeric key may stand for 3-4 letters, it is troublesome for the user to input a string to be searched. More unfortunately, the user can not obtain the searched result until he has finished inputting all the characters of a name. Thus, in most cases, the user has to input more information than needed. However, as soon as inputting is finished, the mobile phone will do search automatically and display the desired telephone number on the screen. As can be seen, this prior search method has the following drawbacks in the aspect of inputting:

1 . The user has to input a long string to search a name.

2. The user has to input more information than what is needed.

3. No search result can be obtained during the period of inputting, i.e. no result can be obtained until inputting is completed.

This search method is not quick and convenient in the aspect of inputting. But, the search method has an advantage in the matching aspect. As soon as a string is completely input, an entry which has the same name as the input string is matched and displayed on the screen. The search method is quick and convenient in the matching aspect.

In a second name search method, the user only needs to press a single numeric key. Then, the mobile phone will search out all the entries in which first letters of the names are in relation to the pressed numeric key. In this method, the operation of inputting is simplified. However, in most cases, more than one entry can be searched out because of the facts that one numeric key stands for 3 or 4 letters and persons may have the same first letters in names. For instance, if the user presses numeric key "4", the names such as "Guo QingZhong", "Guo Ping", "HALL Randy", "ILAN David" may be displayed on the screen. (Here, "Guo QingZhong" and "Guo Ping" are latinized spellings for Chinese names according to their pronounces, hereinafter referred to as Chinese characters in Pinyin). In such a situation, the user has to further locate a desired name among those displayed by moving a cursor and/or scrolling the screen. Only when a particular name is located, a telephone number corresponding to the selected name can be displayed. Obviously, as the number of multiple displayed names increases, it is troublesome for the user to find the exact name to be searched. The second search method has an advantage that the user only needs to press a single key. It is quick and convenient in the aspect of inputting. However, there is a problem that many entries are matched and displayed on the screen, and the user has to further select a desired entry to obtain the telephone number. It is not quick and convenient in the matching aspect.

Other search methods are improved by trading off between the above- mentioned two extreme methods. For example, in a third search method, when a first letter is input, the names having the family names of the directory beginning with the first input letter are displayed. When a second letter is input, the names having the family names of the directory beginning the two input letters are displayed. The more the letters are input, the more exact will be the displayed first names. With this method, it is not necessary to input all of the letters of the names to be searched before the right name is found.

There is still a fourth search method called a predictive input method. In this method, each time a key is pressed, a search is done in a directory with the pressed letters. One candidate having the most possibility to be represented by the pressed keys is then proposed. If the candidate is correct, the user can validate it. If not, the user has to continue to press more keys. The more letters the user inputs, the more exact will be the candidate. With this method, it is also not necessary to input all of the letters of the names to be searched before the right name is found. For example, to search "patent", the use may press the key "7" first, then "PC" is displayed; further press "2", then "PC" is displayed; further press "8", then "SAT" is displayed; further press "3", then "save" is displayed; further press "6", then "patent" is displayed. In this case, only 5 keys are pressed to find the word of 6 letters. However, in the third and fourth methods, the letters must be input in turn. In other words, the user can not input the letters of the family name until the letters of the first name have been input. If there are several same family names in the directory, the user still has to choose or continue to press keys. The number of the pressed keys is still relatively large.

Thus, a need exists for an improved name search method, which is quick and convenient in both inputting and matching aspects.

An object of the invention is to provide a name search method, which can reduce the number of the pressed keys while keeping a high matching accuracy and efficiency.

Another object of the invention is to provide a name search apparatus for implementing the name search method of the present invention.

Still another object of the invention is to provide a radiocommunication terminal using the name search method and apparatus of the present invention.

SUMMARY OF THE INVENTION

The present invention provides a method for searching a name from a personal information database, the personal information database consisting of persons' names each at least having a family name and a first name and special data corresponding to the names. The method comprises the steps of: initiating a search string; inputting a letter; updating the search string by tailing the input letter after the present search string; comparing the search string with the names in the personal information database; selecting out the names containing all the individual letters in the updated search string and in which the letters appear in the same order as that in the updated search string; displaying the selected names; repeating the above steps as desired; locating a desired name among the displayed names to obtain its corresponding special data from the personal information database. In this method, the step of inputting comprises the step of inputting at least a first letter of a family name, a predetermined character and at least a first letter of a first name in sequence. The step of comparing comprises the steps of comparing at least one letter before the predetermined character in the search string with the family names in the personal information database, and comparing at least one letter after the predetermined character in the search string with the first names in the personal information database. The step of selecting comprises the step of selecting the names having the family names containing the letters before the predetermined characters in the updated search string and in which the letters appear in the same order as that in the updated search string and the first names containing the letters after the predetermined characters in the updated search string and in which the letters appear in the same order as that in the updated search string.

In the above method, the letters may be input by a numeric keypad in which each of some of numeric keys represents a plurality of letters. The predetermined character may be a null character. The step of inputting a predetermined character may comprises the step of pressing a space bar or the numeric key "1 ". In one aspect of the invention, the step of inputting a letter may be one of the steps of pressing a numeric key once to input a first letter represented by the pressed key, pressing a numeric key twice to input a second letter represented by the pressed key, pressing a numeric key three times to input a third letter represented by the pressed key, pressing a numeric key four times to input a fourth letter represented by the pressed key.

In another aspect of the invention, the step of inputting a letter may comprise the step of short pressing a numeric key, and the step of comparing may further comprise the step of proposing a predictive string as the search string, the predictive string being the most commonly used string among a plurality strings represented by a series of the pressed numeric keys.

In still another aspect of the invention, the step of inputting a letter may comprise the steps of long pressing a numeric key; displaying all the letters represented by the pressed key in a temporary bar on a screen; moving a cursor along the displayed letters in turn; and releasing the pressed key while the cursor is directed at a letter expected to be input.

Furthermore, the input letter may be the initials of Chinese Characters in Pinyin, or the initials of family names, first names, or middle names of Latin names. The step of displaying the selected names may comprise the step of displaying the selected names in the order of A-Z. The step of locating a name may comprise the steps of pressing a predetermined key; and moving a cursor down to the nexf displayed name. The predetermined key may be the numeric key "0".

The present invention further provides an apparatus for searching a name from a personal information database, the personal information database consisting of persons' names each at least having a family name and a first name and special data corresponding to the names. The apparatus comprises means for initiating a search string; means for inputting letters and a predetermined character; means for updating the search string by tailing an input letter after the present search string; means for matching the updated search string with the names in the personal information database by comparing the search string with the names in the personal information database and selecting out the names containing all the individual letters in the updated search string and in which the letters appear in the same order as that in the updated search string; means for displaying the selected names; means for locating a desired name among the displayed names to obtain its corresponding special data from the personal information database. In the apparatus, the inputting means is constructed for inputting at least a first letter of a family name, the predetermined character and at least a first letter of a first name in sequence. The matching means is constructed for comparing at least one letter before the predetermined character in the search string with the family names in the personal information database, comparing at least one letter after the predetermined character in the search string with the first names in the personal information database, and selecting the names having the family names containing the letters before the predetermined characters in the updated search string and in which the letters appear in the same order as that in the updated search string and the first names containing the letters after the predetermined characters in the updated search string and in which the letters appear in the same order as that in the updated search string.

In the above apparatus, the inputting means may be a numeric keypad in which each of some of numeric keys represents a plurality of letters. In one aspect of the invention, the inputting means may be further constructed for pressing a numeric key once to input a first letter represented by the pressed key, pressing a numeric key twice to input a second letter represented by the pressed key, pressing a numeric key three times to input a third letter represented by the pressed key, pressing a numeric key four times to input a fourth letter represented by the pressed key.

In another aspect of the invention, the inputting means may be constructed for short pressing a numeric key, and the comparing means is further constructed for proposing a predictive string as the search string, the predictive string being the most commonly used string among a plurality strings represented by a series of the pressed numeric keys.

In still another aspect of the invention, the inputting means may be constructed for long pressing a numeric key; displaying all the letters represented by the pressed key in a temporary bar on a screen; moving a cursor along the displayed letters in turn; and releasing the pressed key while the cursor is directed at a letter expected to be input.

Furthermore, the displaying means may be constructed for displaying the selected names in the order of A-Z.

The present invention further provides a radiocommunication terminal with any one of the above-mentioned apparatuses. As can be seen, the search method and apparatus of the present invention provides a trade between accuracy and convenience in both inputting and matching aspects. With this intelligent search method, the efficiency of inputting is increased, but searching accuracy is not degraded. BRIEF DESCRIPTION OF THE INVENTION

Fig. 1 is α schematic diagram of a mobile phone.

Fig. 2 is a flow chart of a search process according to the present invention. Fig. 3 is a block diagram of a search apparatus according to the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the present preferred embodiments of the invention, examples of which are illustrated in the accompanying drawing. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.

A typical mobile phone is shown in Fig. l . The mobile phone 10 includes a keypad 1 and a screen 2. The keypad 1 comprises numeric keys 0-9 and functional keys such as hang up key, menu key, and cancel key, etc. The screen 2 is used to display information such as telephone numbers, names to be searched, and short- messages.

In the embodiments of the present invention, a user is allowed to input more than one letter but less than all the letters of a name. Each time the user inputs a letter, the mobile phone will update a search string, match it with the entries in a directory, and display the matched names on the screen. Based on the displayed names, the user may determine to locate a desired name by scrolling a cursor or input a further letter for more accurate matching. When the user confirms the desired name, its corresponding number will be displayed on the screen.

In an embodiment of the present invention, numeric key 1 or a space bar is input to stand for a null character, indicating that the sequentially input letters are in a first name. Such predetermined character input will make the match result more accurate. More specifically, the letters input before the predetermined character are considered as those in the family names, and the letters input after the predetermined character, as those in the first names. While matching, a string standing for a series of input letters is considered. In α preferred match mode, the first letter of the string is considered as the first one of a family name, and the other letters before the predetermined character are also considered as letters in the family name. It is also considered that the letters are input in the same order as they appear in the entries. The letter right after the predetermined character is considered as the first letter of a first name. The following letters are also considered as letters in the first name and being input in the same order as they appear in the first name. Here, it is not necessary to input the letters in turn. It is only required to input the letters in the same order as they appear in the searched name. For example, both "Guo QingZhong" and "Guan QinZhou" can be considered matching with an input string of G_QZ. However, if the input string is G_QZG, only "Guo QingZhong" will be searched out. As "Guan" QinZhou" does not comprise "G" after Z, it will not be searched out.

The user may input letters with the keypad in several manners. In one embodiment, the user can press a numeric key once to input the first letter represented by the pressed key. If he ants to input a second letter of a key, he can press it twice. Similarly, he can press a key three times to input the third letter, and press four times to input the fourth letter.

In another embodiment, a predictive input method can be used. In this embodiment, letters are input by short pressing numeric keys. Each time a key is pressed, a predictive string will be proposed for the pressed keys. As mentioned above, the predictive string is the most commonly used string among all the strings represented by the series of the pressed keys. It will be used as a search string during the matching period.

In further another embodiment, a long press input method can be used in combination with a short press input method. Here, the term "short press" means to press a key and release it immediately. Here, the term " long press" means to keep pressing a key for a while and then release. More particularly, the user presses a numeric key, .for example, numeric key 4. Upon pressing, an internal timer is activated in the mobile phone. The timer measures the pressing time and compares it with a predetermined value. When the key is released and the period of pressing is less than the predetermined value, it is considered that the input letter may be G, H, or I. If the key is pressed long enough that the pressing time exceeds the predetermined value, a temporary bar will be popped up on the screen with G, H, and I displayed in sequence. While keeping pressing, a cursor scrolls in the bar and indicates from G to I. When the cursor points to a desired letter, the user may release the key. Then, the desired letter is input. Letters on other numeric keys can be input in the same way. In this method, if short press is used for inputting, matching can be executed in fussy manner. For example, if a string of 479 are input by short press, then the combinations consisting of one of G, H and I, one of R Q, R, and S, and one of W, X, Y and Z" will be used to match with the entry in the directory. That means, "Guan QinZhou", "Guo QingZhong", "Guo Ping" and "HALL Randy" may be considered to match with the string of 479. This is referred to as fussy match mode. If a string of 479 is input by long press to stands for letters G, Q and Z, then only the combination of GQZ is used to do match. In this case, "Guan QinZhou", "Guo QingZhong" may be searched out. This is referred to as an accuracy match mode. The user may use either of the match modes depending on the code repeatability of the entries in the directory.

The input method can also be designed to input the first letters represented by numeric keys by short press and input the second to fourth letters by long press. When several names are shown on the screen during the search process, the user may input a further letter for more accurate match, or just press a specific key such as "0" or "#" to scroll a cursor to locate a desired name.

Fig. 2 is a flow chart of a process for searching a name from a directory in a mobile phone, and Fig. 3 is a block diagram for a search apparatus according to the present invention. With reference to Figs 2 and 3, a search process will be now described in detail.

The process begins with Step 20. In Step S20, A search string is initiated to be empty. In Step S30, the mobile phone is waiting until a new input appears.

Step S40 judges whether the new input is " 1 ". If so, the procedure goes to Step S42. Step 42 judges whether the search string has already contained "1 ". If it has been contained, the new input "1 " is ignored and the procedure goes back to Step S30 to wait for a new input. If " 1 " is not contained, the search string is updated by combining this input with the string in Step S44 and then the procedure goes back to Step S30. If the input is not "! ", the procedure further judges whether it is one of 2-9 in Step S50.

If the input is one of 2-9, the procedure goes to Step S52. Step S52 updates the search string by combining the input with the string in either fussy manner (corresponding to short press) or accurate manner (corresponding to long press). In Step S54, the updated search string is used to match with the entries in the directory in either fussy matching mode or accurate matching mode according to the recording format of the search string. During matching, the letters input before "1 " are compared with the family names in the directory, and the letters input after " 1 " are compared with the first names in the directory. In Step S56, the matched names are displayed on the screen with a cursor pointing to the first matched names. Then, the procedure goes back to Step S30 for a new input.

If the input is not one of 2-9, the procedure further judges whether it is "0" in Step S60. When the input is "0", Step S62 judges whether the search string is empty. If it is empty, the procedure ignores the input of "0" and goes back to Step S30 to wait for a new input. If the string contains some digits, a cursor will moves down, being located at the next matched name. Then, the procedure returns to wait for a new input.

If the input is not "0", Step S70 further judges whether the input is "OK" indicating confirmation of a desired name. When the input is not "OK", the procedure ignores the input and returns to wait for a new input in Step S30. If it is "OK", a telephone number which corresponds to the located and matched name is displayed on the screen. Then the procedure is ended in Step S90.

A search apparatus 100 according to an example embodiment is shown in Fig. 3. As shown in this figure, the search apparatus 1 00 comprises an initiating means 1 02, an inputting means 104, a updating means 1 06, a matching means 1 08, a displaying means 1 1 0, and a locating means 1 1 2. When an user wants to search a name from a mobile phone directory, he may first set the mobile phone into a status for searching. The initiating means 1 02 is activated to initiate a search string to be empty. As usual, the input means 1 04 is preferably a keypad of numeric keys of the mobile phone. A conventional corresponding relationship is used between the numeric keys and 26 alphabet letters. In the present invention, the input means 1 04 can be used to input a predetermined character such as a null character by pressing a space bar or the numeric key " 1 ", indicating that the sequentially input letters shall be considered to be in a first name. The updating means 1 06 replaces the present search string by combining the input letter with itself and provides the updated string to the matching means 1 08. The matching means 1 08 compares the letters input before " 1 " in the string with those in the family names of the entries and the letters input after " 1 " in the string with those in the first names of the entries. Then, it selects out the entries in which the names contain the letters in the string and the letters appears in the same order as they appear in the updated search string. Then, the matching means 1 08 provides the matched names to the displaying means 1 1 0. The matched names are displayed in the order from A-Z. The locating means 1 1 2 can be used to locate a desired name among the displayed names to obtain its corresponding telephone number. In a preferred embodiment, The input means 1 04 can also be used to input a predetermined number such as "0" and provide the information of inputting "0" to the locating means 1 1 2. Then, the locating means 1 1 2 moves the cursor down to the next matched name on the screen.

The input means 1 04 can also be used to input a letter by long press and provide the information of long press to the displaying means 1 1 0. Then, the displaying means 1 1 0 will pop up a temporary bar on the screen with all the letters represented by the pressed key displayed therein and a cursor moving along the letters in turns.

Preferably, the apparatus comprises an initial timer for comparing the period of pressing with α predetermined value in order to determine whether inputting is executed by long press.

Example: Assuming a mobile phone directory contains several entries with respect to "Guo

Ping", "Guo QingZhong", "Han Ping", "HALL Randy", "Han LingZhong", and "ILAN David" which are listed in the order from A to Z. Also, assuming that an user intends to obtain the telephone number for "Han LingZhong".

If the user first inputs "4" by short press, then all the names are matched and displayed because their first letters are G, H, or I. A cursor is located at the first matched name "Guo Ping". At this time, if the user wants to locate the cursor at "Han LingZhong", he has to press "0" three times. However, if the user further inputs "5" by short press. The search string will be updated as "45" and the matched names will be reduced to "HALL Randy", "Han LingZhong" and "ILAN David". The cursor is located at "HALL Randy". At that time, one more input of "0" will move the cursor down to the name "Han LingZhong". Alternatively, "9" may be further input by short press. Again, the search string is updated into "459". At this time, only the name "Han LingZhong" is matched.

Alternatively, the user may first input "4" by long press and select "H" from a temporary bar. At this time, "HALL Randy" and "Han LingZhong " is matched. Then, the user may locate the cursor to the desired name by further pressing "0" or "9".

Also the user may input "41 5" by short press. At this time, as "1 " is input to indicate that the following "5" represents a letter in a first name, only the entry "Han LingZhong" is matched. As can be seen, with the search method of the present invention, the efficiency of inputting is increased without any degradation of searching accuracy.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention covers the modifications and variations provided they come within the scope of the appended claims and their equivalents.

Claims

What is claimed is:

1 . A method for searching a name from a personal information database, said personal information database consisting of persons' names each at least having a family name and a first name and special data corresponding to said names, said method comprising the steps of: a) initiating a search string; b) inputting a letter; c) updating said search string by tailing the input letter after the present search string; d) comparing the search string with the names in the personal information database; e) selecting out the names containing all the individual letters in said updated search string and in which said letters appear in the same order as that in the updated search string; f) displaying the selected names; g) repeating the steps b)-f) as desired; h) locating a desired name among the displayed names to obtain its corresponding special data from the personal information database; characterized in that, the step of inputting comprises the step of inputting at least a first letter of a family name, a predetermined character and at least a first letter of a first name in sequence; the step of comparing comprises the steps of comparing said at least one letter before the predetermined character in the search string with the family names in the personal information database, and comparing said at least one letter after the predetermined character in the search string with the first names in the personal information database; the step of selecting comprises the step of selecting the names having the family names containing the letters before the predetermined characters in the updated search string and in which said letters appear in the same order as that in the updated search string and the first names containing the letters after the predetermined characters in the updated search string and in which the letters appear in the same order as that in the updated search string.

2. A method according to claim 1 , wherein said letters are input by a numeric keypad in which each of some of numeric keys represents a plurality of letters.

3. A method according to claim 2, wherein the step of inputting a letter is one of the steps of : pressing a numeric key once to input a first letter represented by the pressed key, pressing a numeric key twice to input a second letter represented by the pressed key, pressing a numeric key three times to input a third letter represented by the pressed key, - pressing a numeric key four times to input a fourth letter represented by the pressed key.

4. A method according to claim 2, wherein the step of inputting a letter comprises the step of short pressing a numeric key, and the step of comparing further comprises the step of proposing a predictive string as said search string, said predictive string being the most possibly used string among a plurality strings represented by a series of the pressed numeric keys.

5. A method according to claim 2, wherein the step of inputting a letter comprises the steps of long pressing a numeric key; displaying all the letters represented by the pressed key in a temporary bar on a screen; moving a cursor along the displayed letters in turn; and releasing the pressed key while said cursor is directed at a letter expected to be input.

6. A method according to any one of claims 1 -5, wherein said input letter is the initials of Chinese Characters in Pinyin.

7. A method according to any one of claims 1 -5, wherein said input letter is the initials of family names, first names, or middle names of Latin names.

8. A method according to any one of claims 1 -5, wherein the step of displaying the selected names comprises the step of displaying the selected names in the order of A-Z.

9. A method according to any one of claims 1 -5, wherein the step of locating a name comprises of the steps of pressing a predetermined key; and moving a cursor down to the next displayed name.

1 0. A method according to claim 9, wherein said predetermined key is numeric key "0".

1 1 . A method according to claim 1 , wherein said predetermined character is a null character.

1 2. A method according to claims 1 1 , wherein the step of inputting a predetermined character comprises the step of pressing a space bar.

1 3. A method according to claims 1 1 , wherein the step of inputting a predetermined character comprises the step of pressing numeric key " 1 ".

1 4. An apparatus for searching a name from a personal information database, said personal information database consisting of persons' names each at least having a family name and a first name and special data corresponding to said names, said apparatus comprising: means for initiating a search string; means for inputting letters and a predetermined character; means for updating said search string by tailing an input letter after the present search string; means for matching the updated search string with the names in the personal information database by comparing the search string with the names in the personal information database and selecting out the names containing all the individual letters in said updated search string and in which said letters appear in the same order as that in the updated search string; means for displaying the selected names; means for locating a desired name among the displayed names to obtain its corresponding special data from the personal information database; characterized in that, said inputting means is constructed for inputting at least a first letter of a family name, said predetermined character and at least a first letter of a first name in sequence; said matching means is constructed for comparing said at least one letter before the predetermined character in the search string with the family names in the personal information database, comparing said at least one letter after the predetermined character in the search string with the first names in the personal information database, and selecting the names having the family names containing the letters before the predetermined characters in the updated search string and in which said letters appear in the same order as that in the updated search string and the first names containing the letters after the predetermined characters in the updated search string and in which the letters appear in the same order as that in the updated search string.

1 5. An apparatus according to claims 14, wherein said inputting means is a numeric keypad in which each of some of numeric keys represents a plurality of letters.

1 6. An apparatus according to claim 1 5, wherein said inputting means is further constructed for pressing a numeric key once to input a first letter represented by the pressed key, pressing a numeric key twice to input a second letter represented by the pressed key, pressing a numeric key three times to input a third letter represented by the pressed key, pressing a numeric key four times to input a fourth letter represented by the pressed key.

1 7. An apparatus according to claim 15, wherein said inputting means is constructed for short pressing a numeric key, and said comparing means is further constructed for proposing a predictive string as said search string, said predictive string being the most possibly used string among a plurality strings represented by a series of the pressed numeric keys.

1 8. An apparatus according to claim 1 5, wherein said inputting means is constructed for long pressing a numeric key; displaying all the letters represented by the pressed key in a temporary bar on a screen; moving a cursor along the displayed letters in turn; and releasing the pressed key while said cursor is directed at a letter expected to be input.

1 9. A radiocommunication terminal comprising an apparatus according to any one of claims 14-1 8.