Source: http://www.google.com/patents/US7188304?dq=6,757,682
Timestamp: 2014-08-28 12:40:52
Document Index: 762913357

Matched Legal Cases: ['art 3', 'art 2', 'art 3', 'art 4', 'art 3', 'art 5', 'art 3', 'Application No. 03252154']

Patent US7188304 - Conversion processing system of character information - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsA conversion processing system includes conversion processing which converts a conversion object into one or more conversion candidates, and performs the conversion processing related to time information. The conversion object is a letter or a symbol, for example. The system has a dictionary, a time...http://www.google.com/patents/US7188304?utm_source=gb-gplus-sharePatent US7188304 - Conversion processing system of character informationAdvanced Patent SearchPublication numberUS7188304 B2Publication typeGrantApplication numberUS 10/413,225Publication dateMar 6, 2007Filing dateApr 15, 2003Priority dateApr 16, 2002Fee statusPaidAlso published asCN1290031C, CN1452083A, EP1359516A2, EP1359516A3, US20030233615Publication number10413225, 413225, US 7188304 B2, US 7188304B2, US-B2-7188304, US7188304 B2, US7188304B2InventorsYouiti Morimoto, Ken Hayashida, Susumu Aoyama, Yoshinori YamamotoOriginal AssigneeFujitsu LimitedExport CitationBiBTeX, EndNote, RefManPatent Citations (15), Non-Patent Citations (2), Referenced by (8), Classifications (19), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetConversion processing system of character informationUS 7188304 B2Abstract A conversion processing system includes conversion processing which converts a conversion object into one or more conversion candidates, and performs the conversion processing related to time information. The conversion object is a letter or a symbol, for example. The system has a dictionary, a time detection part and a conversion part. The dictionary relates one or more conversion candidates corresponding to the conversion object to the time information, and stores these. The time detection part outputs the time information. When converting the conversion object into one or more conversion candidates, the conversion part refers to the time information. By this, the conversion processing can be optimized, and conversion efficiency can be improved.
There is a greeting as a phrase used frequently. For example, a phrase, such as �good morning� and �good night�, is used in accordance with time. When the conversion is performed by referring to only the inputted history, sometimes a gap occurs between a phrase and time of the conversion. Hence, if the gap between the phrase and the time is larger, the number of times of key operations increases and a conversion efficiency of a character may fall.
SUMMARY OF THE INVENTION The present invention relates to information processing which converts a conversion object including a letter into one or more conversion candidates. An object of the present invention is to optimize a conversion result by relating time information to conversion processing, and is to improve conversion efficiency.
The information processing device includes dictionaries including a history dictionary 6, a time dictionary 7, a user registration dictionary 8 and a basic dictionary 9, a time detection part (the time dictionary 7) and a conversion part 3. The dictionaries have a letter, a symbol, an element of a letter or a symbol, or a combination not less than two of these as a conversion object. The dictionaries relate one or more conversion candidates corresponding to the conversion object to time information, and store these. In the conversion object, �a letter� is language, and includes the Japanese Kant, Hiragana, Katakana and Roman letter, the Korean language, the Chinese language, the Alphabet of English and so on. �A symbol� includes a sign and so on except for a letter. �An element of a letter or a symbol� is a part of a letter and a symbol. For example, in Kanji, its element is a portion of Kant such as �hen ( )� and �tsukuri ( )� in Kant, and in �A� of the Alphabet, its element is �Λ� and so on. �A combination not less than two of these� is a combination not less than two things which are selected from a letter, a symbol and an element of a letter or a symbol, and indicates a composite of letters, symbols, a letter and a symbol, a combination of elements of a letter or a symbol, and so on. The conversion object is related to one or more conversion candidates, and is information which gives a clue for taking out one or more conversion candidates. And, �relating to the time information� indicates that a conversion candidate including a time element, such as a conversion candidate representative of a greeting like �good morning�, is associated to the time information representative of morning as an example. In addition, an item �character� used in explanation of the present invention includes a letter, a symbol, an element of a letter or a symbol, and a combination not less than two of these, and may use any language.
In the processing unit 1, the input part 2 takes in a character inputted from the input unit 11, and gives information to a display region 14 (FIG. 2) namely a input field 14 of the display unit 10. The conversion part 3 retrieves the history dictionary 6, the time dictionary 7, the user registration dictionary 8 or the basic dictionary 9 in respect to the inputted character, and converts the inputted character into other character strings as conversion candidates or conversion results. The display part 4 displays character strings and a cursor on the display region 14 (FIG. 2). The displayed character strings are representative of one or more conversion candidates and conversion results obtained by the conversion part 3. At this, a conversion candidate is representative of conversion information in the middle of the processing for getting a conversion result, and it is one state of a conversion result. If a conversion candidate is defined like this, a conversion result is to indicate one or more character strings of conversion candidates selected by the information processing or selected by a user. The registration part 5 registers a character or a character string in the history dictionary 6, the time dictionary 7 or the user registration dictionary 8. In addition, an item �character� used in explanation of the present invention includes a letter, a symbol, an element of a character or a symbol, and a combination not less than two of these, and may use any language.
This processing system is applied to a mobile telephone as an example. As shown in FIG. 2, this mobile telephone is foldaway. A display unit 10 is provided to a telephone body 12 by way of a hinge 13 so that the display unit 10 can be folded up. In the display unit 10, the input field 14 which is a display region and an input region for a character is formed. In the telephone body 12, as the input unit 11, a plurality of character keys 15 arranged in lines-by-lines array, a conversion key 16, a decision key 17 and so on are provided. In the character keys 15, for example, in the case of keys corresponding to the Japanese language, the Hiragana � (a)� through � (n)�, Arabic numerals, the alphabet are assigned to the character keys 15. In the case of keys corresponding to the Korean language, a consonant, a vowel, a batchim and so on are assigned to the character keys 15. The batchim is a portion of a character in the Korean language, is located at the lowermost portion in the character, and supports the whole of the character. In the case of keys corresponding to the English and Chinese languages, the alphabet, Arabic numerals and so on assigned to the character keys 15. In the input field 14, for example, an inputted character 18, a cursor 19, a conversion result and its candidates are displayed.
In the first embodiment, the information processing device of the present invention is constituted as the processing system having the processing unit 1, various dictionaries 6�9, the display unit 10 and the input unit 11. In this processing system, the information processing method and the information processing program of the present invention are realized. That is, the information processing method realized in this processing system, for example, (1) a step which recognizes the conversion object, (2) a step which recognizes the time information, and (3) a step of the conversion processing.
In this flow diagram, before a starting of the conversion processing, the input field (the display region) 14 is displayed at a step S1. That is, in the mobile telephone shown in FIG. 2, the input field 14 is displayed on the screen of the display unit 10, for example. After this display, at a step S2, input is performed by using the character keys 15 in order to designate the conversion object. In this case, positioning of the cursor 19 is performed by moving the cursor 19 at the input field displayed at the step S1. After this positioning, the input of a character is performed by pressing the character keys 15. As an inputted character, for example, � (a)� is inputted.
In this embodiment, after the input of the character namely the conversion object, indication of the conversion is performed. This indication of the conversion is executed at a step S3. At the step S3, whether or not the conversion key 16 is pressed is decided. This decision processing becomes the conversion indication. On condition that the character � (a)� is displayed on the input field 14, whether or not the conversion key 16 is pressed is decided. If the conversion key 16 is pressed, the system enters from the step S3 to a step S4. If the conversion key 16 is not pressed, the system returns from the step S3 to the step S2 because the indication of the conversion is not given, and an input operation of a new character can be repeated in the input field 14.
Like this, when a user presses the conversion key 16 under the state that one character is inputted in the input field 14, that is, when the �yes� branch is realized at the step S4, the following processing is performed. First, conversion candidates are fetched from the history dictionary 6. Next, conversion candidates are fetched in order, with the time information representative of a time band corresponding to the time of the input as a momentum, from the time dictionary 7. Next, conversion candidates are fetched from the user registration dictionary 8. Next, conversion candidates are fetched from the basic dictionary 9. The fetched conversion candidates are displayed in order of the history dictionary 6, the time dictionary 7, the user registration dictionary 8 and the basic dictionary 9 (ex. FIG. 6). A user selects from these conversion candidates, or a user selects from a conversion candidate which is displayed in order, and a decided conversion candidate is set to the input field 14 by pressing the decision key 17. Therefore, since optimum conversion candidates can be displayed with the time information representative of the time of the input of a character as a momentum, optimum conversion candidates corresponding to the time information is preferentially displayed, and conversion efficiency can be improved.
An example of display in the above conversion processing is shown in FIG. 4. FIG. 4 is an example of display on the screen of the display unit 10. FIG. 4( a) shows display of � � (a) which is an inputted character 18 as the conversion object. The cursor 19 displayed next of the inputted character � (a)� indicates a next input location.
When the conversion key 16 is pressed at once under the state of this display, as shown in FIG. 4( b) as an example, a character string � (amega) (the rain)� is displayed as a supreme conversion candidate 20. The letters (amega) in the character string � (amega) (the rain)� is the Japanese Roman letters (this will be used in the rest in a similar manner). In FIG. 4( b), the character string � (amega) (the rain)�, which is the supreme conversion candidate 20 of conversion candidates including the inputted character � � (a) of FIG. 4( a) at head (that is, at the step 5 in FIG. 3), is displayed.
When the conversion key 16 is pressed at twice under the state of this display, as shown in FIG. 4( c) as an example, all of conversion candidates 21 are displayed with the supreme conversion candidate 20 at head. All of the conversion candidates 21 displayed are character strings including the inputted character � (a)� of FIG. 4( a) at head (at the step S7 in FIG. 3). All of the conversion candidates are as follows.
At a step S21, for example, � (a)� as an input character of the conversion object is inputted by pressing the keys 15. In this case, the cursor 19 is moved to a desired position in the input field 14. If the input character � (a)� is inputted at a position of the cursor 19 by pressing the character keys 15, the inputted character � (a)� is displayed.
At a following step S22, when the conversion key 16 is pressed under the state that the inputted character � (a)� is displayed in the input field 14, the system enters from the step S22 to a step S23. At the step S23, whether or not one or more conversion candidates exist in the history dictionary 6 is decided. That is, when the conversion key 16 is pressed at the step S22, in the history dictionary 6, whether or not one or more registrations {or one or more character strings (Hiragana sentence, Kana-Kanji mixture sentence) with the inputted character � (a)� at head} corresponded to the inputted character � (a)� are in existence is decided. If one or more corresponding registrations exist, the system enters from the step S23 to a step S24. At the step S24, corresponding registrations are fetched in order of candidates from the history dictionary 6, and fetched registrations are stored from its head into the buffer memory BM. After that, the system enters from the step S24 to a step S25. If the corresponding registrations do not exist, the system directly enters from the step S23 to the step S25.
At the step S25, whether or not one or more conversion candidates exist in the time dictionary 7 is decided. That is, in the time dictionary 7, whether or not one or more registrations {or one or more character strings (Hiragana sentence, Kana-Kanji mixture sentence) with the inputted character � (a)� at head} corresponding to the inputted character � (a)� are in existence is decided. If the corresponding registrations exist, the system enters from the step S25 to a step S26. At the step S26, the one or more corresponding registrations are fetched in order of candidates from the time dictionary 7, and the fetched registrations are stored into the buffer memory BM. After that, the system enters from the step S26 to a step S27. If a corresponding registration does not exist in the time dictionary 7, the system directly enters from the step S25 to the step S27.
At the step S27, whether or not one or more conversion candidates exist in the user registration dictionary 8 is decided. That is, in the user registration dictionary 8, whether or not one or more registrations {or one or more character strings (Hiragana sentence, Kana-Kanji mixture sentence) with the inputted character � (a)� at head} corresponding to the inputted character � (a)� are in existence is decided. If the corresponding registrations exist, the system enters from the step S27 to step S28. At the step S28, the corresponding registrations are fetched, and the fetched registrations are stored in order of candidates into the buffer memory BM. After that, the system enters from the step S28 to a step S29. If a corresponding registration does not exist in the user registration dictionary 8, the system directly enters from the step S27 to the step S29.
At the step S29, whether or not one or more conversion candidates exist in the basic dictionary 9 is decided. That is, in the basic dictionary 9, whether or not one or more registrations {or one or more character strings (Hiragana sentence, Kana-Kanji mixture sentence) with the inputted character � (a)� at head} corresponding to the inputted character � (a)� is in existence is decided. If the corresponding registrations exist, the system enters from the step S29 to a step S30. At the step S30, the corresponding registrations are fetched in order of candidates, and the fetched registrations are stored into the buffer memory BM. After that, the system enters from the step S30 to a step S31. If a corresponding registration does not exist in the basic dictionary 9, the system directly enters from the step S29 to the step S31.
By this, when the conversion key 16 is pressed after inputting � (a)� as one character, one or more conversion candidates having � (a)� at its head are displayed in order starting from a time band corresponding to the present time of the input to the history dictionary 6 and the time dictionary 7, and in priority order of the user registration dictionary 8 and the basic dictionary 9, as shown in FIG. 6 as an example (in this case, the time of input of � (a)� is 17:00). Because of this, since a conversion candidate having a time band corresponding to the time of the present input is displayed as a supreme conversion candidate 20, an optimum conversion candidate can be obtained and conversion efficiency can be improved further.
An example of display of conversion candidates is explained by referring to FIG. 6 as an example. FIG. 6 is a drawing showing a relation between a display character string and a use dictionary. In FIG. 6, the display character string shown in a left side represents conversion candidates, and the use dictionary shown in a right side represents a dictionary used for retrieval and fetch of the display character string {the history dictionary 6, the time band (morning, noon, night and midnight) of the time dictionary 7, the user registration dictionary 8 and the basic dictionary 9}. In addition, the time dictionary 7 fetches in priority order starting from a time band corresponding to the time of the input, and displays in the direction from upward to downward as shown in FIG. 6 and the following. The time dictionary 7 rotates starting from a time band corresponding to the time of the input. The conversion candidates namely the display character string shown in the left side represent from a supreme conversion candidate to a subordinate conversion candidate in the direction from upward to downward. Here, in respect to the inputted character � (a)�, its conversion candidates are as follows.
input of � (a)� is 17:00)
In this embodiment, the history dictionary 6, for example, is constituted as shown in FIG. 7. FIG. 7 shows contents of registration in the history dictionary 6. This history dictionary 6 sets character strings (Kana-Kanji mixture sentence) as conversion results. The character strings (Kana-Kanji mixture sentence) are displayed in the input field 14 and are inputted by pressing the decision key 17 in the past. The history dictionary 6 corresponds to a character (ex. � (a)�) of its head of the conversion result and registers these, and registers the newest conversion result in head. As mentioned before, the history dictionary 6 may corresponds to the inputted character 18 shown in the drawings and registers the time information (ex. a time band) together with the conversion candidates. According to this, corresponding conversion candidates can be fetched in order stating from a time band corresponding to the time of the input of the inputted character 18 namely the conversion object. For example, if the time of the input is 8:00 AM, the corresponding conversion candidates are fetched in order of morning, noon, night and midnight.
5:00�10:59
11:00�16:59
17:00�22:59
23:00�4:59
� (keikakuwo yamemashita) (stopped a plan)� At a step S42, a part of the inputted sentence is selected and is converted. As shown in a step S422 as an example, the display of � (keikakuwo) (a plan)� is selected. If the conversion key 16 is pressed, as shown in a step S423, � (keikakuwo) (a plan)� under a state of selection is converted into � (keikakuwo) (a plan)�, and its conversion result is displayed as follows.
� (keikakuwo yamemashita) (stopped a plan)�
At a step S43, the conversion result is decided. That is, if the decision key 17 is pressed at the step S42 under the state that the part of the sentence has been converted, the system enters from the step S43 to a step S44, and the inputted sentence together with its conversion result are decided. That is, by pressing the decision key 17 at the step 43, � (keikakuwo) (a plan)� is decided.
At a step S45, � (keikakuwo) (a plan)� is registered into the history dictionary 6. That is, as shown in a step S424, � (keikakuwo) (a plan)� decided at the step S44 is corresponded to one character � (ke)� at the head of the sentence and is registered in the history dictionary 6.
At a step S46, whether or not an undecided character string is in existence is decided. If an undecided character string is in existence, the system returns from the step S46 to the step S42, and the processing of the steps S42�S45 is repeated. If an undecided character string is not in existence, the system enters from the step S46 to a step 47.
Like this, a character string (ex. � (keikakuwo) (a plan)�) decided by pressing the decision key 17 is corresponded to one character � (ke)� at a head of a character string and can be stored in the history dictionary 6. In addition, as mentioned above, in the history dictionary 6, if the time information representative of a time band corresponding to time of a press of the decision key 17 is registered, conversion candidates can be read-out from the history dictionary 6 in order starting from a time band including the time of the input and can be displayed in that order, when the conversion key 16 is pressed after inputting one character to the input field 14.
In the first embodiment, as explained by referring to FIG. 1�FIG. 11, a character is inputted by operating the character keys 15, and its inputted character 18 is displayed in the input field 14 namely the input or display region. Under the state of this, when the conversion key 16 is pressed, display character strings (ex. character strings shown in FIG. 6) are displayed in the display region 14 of the display unit 10, as shown in FIG. 12( a). If the decision key 17 is pressed after selecting one of character strings, a displayed character string to decide is selected, its character string is decided and the input to the input field 14 is enable. At this time, since a conversion candidate is displayed in order starting from a time band including the time of its input, an optimum conversion candidate for the time band can be obtained. Therefore, the conversion efficiency can be improved, and it is possible to quickly convert in the input processing.
In this embodiment, although this embodiment is explained by using the mobile telephone, the processing system shown in FIG. 1 can be applied to a PDA (Personal Digital Assistants) as shown in FIG. 12( b) as an example. In the PDA, components which are given the same reference numerals as those of the mobile telephone shown in FIG. 12( a) indicate a common part. In the input field 14 namely the display region provided at an upper portion of a PDA body 22, the display character strings shown in FIG. 6 are displayed. In a lower portion of the input field 14, the input unit 11 is provided likewise the mobile telephone. This input unit 11 includes a plurality of character input regions 24, 26 and 28 (these display a handwriting character region or software keys) as an information input part corresponding to the character keys 15 of the mobile telephone, and a conversion key 16 and a decision key 17 adjacent to the character input regions 24�28.
In the PDA, as explained previously by referring to FIG. 1-FIG. 11, a character is inputted in the character input regions 24�28, and its inputted character is displayed on the input field 14. Under the state of this, when the conversion key 16 is pressed, the inputted character is converted into a display character string (ex. character strings shown in FIG. 6), and one or more display character strings are displayed. Therefore, if the decision key 17 is pressed after selecting one of the display character strings, a selected display character string is decided on the inputted field 14, and the input of the display character string is enabled. In this case, since conversion candidates are displayed in order starting from a time band including the time of its input, the conversion efficiency from the conversion object to conversion candidates or conversion results can be improved, and the quick conversion processing and the quick input processing can be realized.
As described in detail, the conversion part 3 includes the order changing part which changes order of the conversion candidates by using the time information at the time of the conversion of the conversion object. By this, in a change of the order of conversion candidates, it is possible to give priority order to a conversion candidate based on the time information. That is, a daily greeting is different at a time band. If a time band is morning, � (ohayou) (good morning)� is used. If a time band is evening, � (otsukare) (good work today)� is used. If a time band is night, � (oyasumi) (good night)� is used. Therefore, as one example, the conversion object is set to � (o)� and its conversion candidate is set to � (otsukare) (good work today)�, � (ohayou) (good morning)� and � (oyasumi) (good night)�. By these conversion candidates being related to the time information, � (ohayou) (good morning)� is set to the first priority candidate when the time information represents morning, � (otsukare) (good work today)� is set to the first priority candidate when the time information represents evening, and � (oyasumi) (good night)� is set to the first priority candidate when the time information represents night. By this, it is possible to change a conversion candidate based on the time information. According to this conversion processing, as compared with a predictive conversion which refers to only an input history, the gap between the time of the conversion and a character string namely a greeting does not occur. Therefore, a conversion result can be optimized, and the conversion efficiency can be improved. In other words, it is possible to change the order of conversion candidates and conversion results in accordance with the time information of the time of the conversion. Because of this, the conversion processing to a conversion candidate or a conversion result can be easily and quickly performed, and an optimum conversion result which a user expects can be obtained. The above conversion processing can be performed irrespective of a kind of language.
According to a constitution like this, it is possible to perform quick and optimum conversion processing corresponding a time band of life of a user. That is, since a time band of life differs from individual to individual, a form of a greeting is changed in accordance with a time band of life, for example. If the conversion corresponding to a time band of life can be obtained, serviceableness will be improved. For example, �good morning� is used in the night, and �good night� is used in the morning. Therefore, in this processing system, a relation between the time information and a conversion candidate is modified in accordance to a time band of life decided from a conversion candidate selected at the time of the conversion. By this, a priority candidate corresponding to a time band of life can be taken out, and an optimum conversion result corresponding to expectance of a user can be obtained. According to this processing, the gap between the time of the conversion and a conversion candidate namely a character string of a greeting corresponding to a time band of life of a user does not occur. Therefore, a conversion candidate can be optimized, and the conversion efficiency can be improved. In addition, the quick conversion processing and the improvement of serviceableness will be obtained.
Next, FIG. 15 shows a processing system as a fourth embodiment of an information processing device, an information processing method, an information processing program and a program product containing the information processing program according to the present invention. This processing system has the basic dictionary 9, the user registration dictionary 8, and a conjecture take-head-out conversion dictionary 34 (hereinafter referred to as �conjecture conversion dictionary�) as a database storing conversion candidates or conversion results. The conjecture conversion dictionary 34 corresponds to the history dictionary 6 and the time dictionary 7 in the processing system shown in FIG. 1, and makes contents of registration develop further. The user registration dictionary 8 and the conjecture conversion dictionary 34 are a dictionary of the same form, and are a database in which a desired conversion candidate and conversion result are registered by a user. The user registration dictionary 8 stores a registered user character and character string, and a candidate of a paragraph learning. The conjecture conversion dictionary 34 stores a conjecture take-head-out character and character string, and a user-used character and character string. In conversion form, the user registration dictionary 8 is a paragraph conversion, and the conjecture conversion dictionary 34 makes a letter, a symbol and an element of a letter or a symbol as a conversion object. In addition, as the conversion object of the conjecture conversion dictionary 34, instead of a letter, a symbol and an element of a letter or a symbol, a combination not less than two of these may be used. When the number of registered characters increases, a registration area of the basic dictionary 9 may be utilized.
The item number, the reading and the number of readings in the table 1 are shown like a table 2 as an example. In this table 2, the number of readings for the conjecture take-head-out conversion signifies that, in an example of an inputted character � (a)�, an initial registered character or character string conjectured by the inputted character � (a)� and by an operation of the conversion key 16 (FIG. 2) is in existence, and that, in an example of an inputted character � (n)�, an initial registered character or character string conjectured by the inputted character � (n)� and by an operation of the conversion key 16 (FIG. 2) is not in existence.
At this, assuming that the number of initial registrations for one reading is �2� and the number of readings as an object of the conjecture take-head-out conversion is �67� from the table 2, since time bands of a day are four �4� parts, the number �n� of registrations in respect to a conjecture take-head-out conversion is as follows, as an example.
In this embodiment, if a common index (reading) for reading-out a conversion candidate or a conversion result registered in the user registration dictionary 8 and the conjecture conversion dictionary 34 is given to the conversion dictionaries 8 and 34, it is possible to read-out simultaneously from both of them. However, by having a different index (reading) each other, contents read-out from these can be distinguished. In this case, in respect to the longest index (reading), if the user registration dictionary 8 is set to some characters of about 8�15 characters as an example, and if the conjecture conversion dictionary 34 is set to one character as an example, priority of read-out of the dictionaries 8 and 34 can be set by the index (reading). In addition, in an automatic registration, for example, if the automatic registration is set at time of expansion of a paragraph or at time of reduction of a paragraph in the user registration dictionary 8, and if the automatic registration is set only at time of decision of a paragraph in the conjecture conversion dictionary 34, it is possible to select a dictionary of the automatic registration based on distinction between the time of the expansion of a paragraph or the time of the reduction of a paragraph and the time of the decision of a paragraph. At this, a term �paragraph� is the smallest part with signification in a sentence as apparent from the following description, and signifies �bunsetsu ( )� in the Japanese language. In addition, in respect to the greatest number of registered characters, if the user registration dictionary 8 is set on a small scale of about 100 characters, and if the conjecture conversion dictionary 34 is set on a large scale of 536 or more characters, a degree of freedom of the conjecture conversion can be raised.
In this conjecture take-head-out conversion, it is assumed that a user has been inputted a character string � / / (ashawa/amega/futteimashita) (the rain fell in the morning)�, and has decided after that. The above character string has three paragraph which are � (in the morning)�, � (the rain)� and � (fell)�. In this case, in respect to characters which have been used by the user, an automatic learning is performed as follows. At this, the automatic learning is to register automatically the character string in the user registration dictionary 8. In this case, as shown in a table 3 as an example, an index (reading) showing a conversion object and contents of registration (Kant) are registered in the user registration dictionary 8. A registration is performed in order of decision, that is, a character string is stored in order of a registration.
Under this state, it is assumed that the user inputs � (a)� as reading of one character by the input unit 11, and the time of this input is evening. When the conversion key 16 is pressed, as shown in FIG. 16, conversion candidates or results for the conversion object � (a)� are displayed on the display region 14 of the display unit 10. In FIG. 16, a conjecture take-head-out character string is fetched from the conjecture conversion dictionary 34, a registered user character string is fetched from the user registration dictionary 8, a conjecture take-head-out character string of other time is fetched from the conjecture conversion dictionary 34, and a basic character is fetched from the basic dictionary 9. Since the time of the input is evening, a character string having a higher frequency of time is fetched. That is, the character st rings � (ashita) (tomorrow)� and � (asobu) (play)� are included in the time band of evening, and therefor these character strings have a higher priority.
EXAMPLE 1 The example 1 is the conjecture take-head-out conversion processing (the time of the input is 8:00 AM)
In this processing, as shown in FIG. 17 as an example, input and conversion processing is performed at a step S51, and decision processing is performed at a step S52. That is, at a step S511, a character string � (asawa amega futteimashita) (the rain fell in the morning)� is inputted, and this character string is converted into � (asawa amega futteimashita) (the rain fell in the morning)� by a character conversion at a following step S512. In this case, � (asa) (morning)�, � (ame) (rain)� and � (futte) (fell)� are converted from Hiragana to Kant.
At the step S52, the decision processing is performed every one paragraph of the character string � (asawa amega futteimashita) (the rain fell in the morning)�. That is, at steps S521 and S522, a first paragraph � (asawa) (in the morning)� is automatically registered in the conjecture conversion dictionary 34 in association with � (a)� of the index (head, reading). At steps S523 and S524, a second paragraph � (amega) (the rain)� is automatically registered in the conjecture conversion dictionary 34 in association with � (a)� of the index. At steps S525 and S526, a third paragraph � (futteimashita) (fell)� is automatically registered in the conjecture conversion dictionary 34 in association with � (fu)� of the index.
After the above registration processing, when the conversion key 16 is pressed after input of one character � (a)�, candidates having a higher frequency of time are fetched by referring to the time information. After that, the newest registered user-used character strings � (amega) (the rain)� and � (ashawa) (in the morning)� are fetched as next candidates. That is, a conjecture take-head-out candidate having a higher frequency of time is fetched in preference to others, and then a registered user-used character string is fetched. After that, a conjecture take-head-out candidate of other time and a registered basic character are fetched. In this case, since the time of the input is 8:00 AM in this example, a frequency of time of morning takes priority over all. Next, a candidate which has been automatically registered is fetched. And then, other conjecture take-head-out candidates are fetched. When a automatic registration exist, a character string which has been automatically registered is fetched in preference to a registered character string having a time band except for morning.
EXAMPLE 2 An example 2 is processing under existence of a user registration.
As shown in a table 4 as an example, it is assumed that Hiragana � (ajia) (Asia)� as an index of registration (reading) has been registered, and �Asia� as contents of registration has been registered in the user registration dictionary 8.
In this case, as shown in FIG. 19 as an example, input and conversion processing is performed at a step S61, expansion processing of a paragraph is performed at a step S62, and decision processing is performed in a step S63. In the step S61, a character string � (ajia gaikoku) (Asia a foreign country)� is inputted at a step S611, and the conversion key 16 is pressed. Thereby, as shown in a step S612, the character string is converted into �Asia (Asia gaikoku) (Asia a foreign country)�. At a step S612, the paragraph �Asia� is selected from the character string �Asia (Asia gaikoku) (Asia a foreign country)�. If the paragraph �Asia� is expanded and displayed at the step S62, �Asia (Asiaga ikoku) (Asia is a strange country)� is displayed. At this, the paragraph �Asia (Asiaga) (Asia is)� is selected from the character string �Asia (Asiaga ikoku) (Asia is a strange country)� at a step S631 of the step S63, and an next candidate � (ajiaga) (Asia is)� is displayed at a step S632. And then, an character string � (ajiaga) (Asia is)� is fetched at a step S633. At this, when the decision key 17 is pressed, the character string � (ajiaga) (Asia is)� is decided at a step S634, and this character string is registered in the user registration dictionary 8. In addition, if the decision key 17 is pressed after � (ikoku) (a strange country)� is selected at a step S635, the character string � (ikoku) (a strange country)� is decided and registered in the user registration dictionary at a step S636.
After the above registration, as shown in FIG. 20, it is assumed that a character string � (ajiaga ichiban) (Asia is the first)� is inputted, and this character string is converted in the step S71. If the conversion key 16 is pressed after a selection of � (ajiaga ichiban) (Asia is the first)� at the step S711, this character string is changed into � (ajiaga ichiban) (Asia is the first)� at the step S712. In this case, in respect to the character string � (ajia) (Asia)�, character strings �Asia� and � (ajiaga) (Asia is)� have been registered as conversion candidates. A selection of � (ajiaga) (Asia is)� having a longer length namely a longer reading is preferentially performed. Then, in processing of a step S72 in which an next candidate is selected and decided, a paragraph � (ajiaga) (Asia is)� is selected from the character string � (ajiaga ichiban) (Asia is the first)� at the step S721, and an next candidate is made display. If the decision key 17 is operated after selecting �Asia (Ajiaga) (Asia is)� at a step S722, the character string �Asia (Ajiaga) (Asia is)� is automatically registered in the user registration dictionary 8 at a step S723. In addition, if the decision key 17 is pressed after selecting � (ichiban) (the first)� at a step S724, the character string � (ichiban) (the first)� is decided and is automatically registered in the user registration dictionary at a step S725.
After the above automatic registration processing, for example, it is assumed that a character string � (ajiaga saikou) (Asia is the best)� is inputted and converted as shown in FIG. 21. If the conversion key 16 is pressed after the input of � (ajiaga saikou) (Asia is the best)� in the step S731, �Asia (Ajiaga) (Asia is)� registered at the latest is preferentially fetched from � (ajiaga) (Asia is)� and �Asia (Ajiaga) (Asia is)� registered in the user registration dictionary 8. Therefore, as shown in steps S732�S734, an next candidate becomes in order of �Asia (ajiaga saikou) (Asia is the best)�, � (ajiaga saikou) (Asia is the best)� and � (ajiaga saikou) (Asia is the best)�.
EXAMPLE 3 An example 3 is processing under input of one character (the time of the input is 8:00 AM)
As shown in a table 5 as an example, it is assumed that a character � (tora) (tiger)� has been registered in association with � (ya)� of the index of registration in the user registration dictionary 8.
In this case, as shown in FIG. 22 as an example, an input and conversion processing is performed at a step S81, and decision processing is performed at a step S82. That is, the character string � (keikakuwo yamemashita) (stopped a plan)� is inputted at a step S811. Under this state, if conversion is performed by pressing the conversion key 16, this character string is converted into � (keikakuwo yamemashita) (stopped a plan)� at a step S812. In this case, � (keikaku) (a plan)� and � (ya)� are converted from Hiragana to Kant.
At the step S82, the decision processing is performed every one paragraph of the character string � (keikakuwo yamemashita) (stopped a plan)�. That is, at steps S821 and S822, in respect to � (keikakuwo yamemashita) (stopped a plan)�, a first paragraph � (keikakuwo) (a plan)� is automatically registered in the user registration dictionary 8 in association with � (ke)� of the index. At steps S823 and S824, a second paragraph � (yamemashita) (stopped)� is automatically registered in the user registration dictionary 8 in association with � (ya)� of the index.
After the above registration processing, when the conversion key 16 is pressed after input of one character � (ya)�, as shown in FIG. 23 as an example, a candidate having a higher frequency of time is fetched by referring to the time information, and after that, the newest registered character string � (yamemashita) (stopped)� and the character � (tora) (tiger)� registered by the user are fetched as next candidates. That is, a conjecture take-head-out candidate having a higher frequency of time is fetched in preference to others, and then a registered user-used character string is fetched. After that, a conjecture take-head-out candidate of other time and a registered basic character are fetched. In this case, since the time of the input is 8:00 AM in this example, a frequency of time of morning takes priority over all. Next, a candidate which has been automatically registered is fetched. And then, other conjecture take-head-out candidates are fetched. When an automatic registration exist, a character string which has been automatically registered is fetched in preference to a registered character string having a time band except for morning.
In this case, although � (ya)� is fetched as the last candidate next to � (ya)�, the user registration dictionary 8 does not perform the automatic registration, even if the conversion key 17 is pressed after selection of the character � (ya)�. This is a reason that � (ya)� has been registered already in the basic dictionary 9 in association with � (ya)� of the conversion object. Although the automatic registration is checked when this processing is performed, the order of read-out is changed by function of learning of frequency.
When one character � (ya)� is inputted and the conversion key 16 is pressed, conversion processing like FIG. 23 is performed. However, as shown in FIG. 24 as an example, the last candidate is changed from � (va)� to � (ya)�, and priority order of � (ya)� becomes higher by a frequency learning. That is, a history function as a frequency learning is performed.
By utilizing this processing system, as shown in a table 6 as an example, conversion candidates representative of a greeting corresponding to a time band can be fetched by using � (o)� in a head of a conversion candidate as a common inputted character.
As the processing system for the English language area, as shown in a table 7 as an example, conversion candidates representative of a greeting corresponding to a time band can be fetched by using �G� of the head character of a conversion candidate as a common inputted character and by referring to the time information.
In this case, as shown in a table 9 as an example, �x� in alphabet may also be used as the inputted character representative of the voiceless consonant in the character of the head. Likewise, by the reference of the time information representative of a time band, a conversion candidate which a user expects and predicts can be fetched every time band.
In addition, as shown in a table 11 as an example, pronunciation (reading) of one character in the head, namely, a combination of �x� representative of the voiceless consonant, a vowel �a� and a voiced consonant �n� may also be used as the input character. Likewise, by the reference of the time information representative of a time band, a conversion candidate which a user expects and predicts can be fetched every time band.
In addition, as shown in a table 12 as an example, pronunciation (reading) of a part of one character in the head, namely, a combination of �a� representative of the vowel and the voiced consonant �n� may also be used as the inputted character. Likewise, by the reference of the time information representative of a time band, a conversion candidate which a user expects and predicts can be fetched every time band.
In this case, as shown in a table 14 as an example, by using �j� as a common inputted character representative of pronunciation, a conversion candidate may be similarly fetched.
According to the above mobile telephone, by using the processing system according to the present invention, a voiceless consonant which is an element of a letter in a head of a conversion candidate is used as an input character namely the conversion object, and reference of the time information representative of a time band is performed. By this, as shown in a table 15 as an example, a conversion candidate representative of a greeting different at a time band can be fetched every time band by using a common inputted character �n�. That is, a conversion candidate which a user expects and predicts can be fetched.
In this case, as shown in a table 16 as an example, two characters �ni� composed of a consonant and a vowel may be used as an input character.
Although a character in a head is used as an inputted character in the above examples, a common character in an end of a character string can also be used as an inputted character. As shown in a table as an example, by using a common pronunciation �hao� in an end of a conversion candidate, a conversion candidate of a different greeting may be fetched every time band.
In the exemplified the tables 8�17, signification of a conversion candidate is described for convenience' sake. Although the signification is unnecessary in the conversion, the signification may be displayed for a user having different language.
Although a conversion candidate having a common character in a head or an end is used as shown in the tables 1�17 in the embodiments mentioned above, this is not intended to limit the scope of the invention. A conversion candidate having a common character in a head or an end has advantages in that recognition of a conversion candidate and usage to a user are easy, but these advantages relates to practice or proficiency of a user. Therefore, in the present invention, it is not always necessary that a conversion candidate has a common character in a head or an end. For example, a common character is set by using a concept of a greeting sentence, and the system is set so that a greeting sentence corresponding to a time band is preferentially fetched. By this, a conversion candidate or a conversion result in respect to a conversion object can be obtained. Therefore, a converted character string which a user expects or predicts can be fetched in response to a time band, and it makes a contribution to a quick and optimum conversion processing.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5786776 *Mar 12, 1996Jul 28, 1998Kabushiki Kaisha ToshibaCharacter input terminal device and recording apparatusUS5818437Jul 26, 1995Oct 6, 1998Tegic Communications, Inc.Reduced keyboard disambiguating computerUS6011554Jul 26, 1996Jan 4, 2000Tegic Communications, Inc.Reduced keyboard disambiguating systemUS6307549 *Oct 18, 1999Oct 23, 2001Tegic Communications, Inc.Reduced keyboard disambiguating systemUS6377965Nov 7, 1997Apr 23, 2002Microsoft CorporationAutomatic word completion system for partially entered dataUS20020019731 *May 10, 2001Feb 14, 2002Toshiyuki MasuiPortable terminal, method for inputting the information, method and apparatus for dictionary retrieval and mediumEP0732646A2Mar 13, 1996Sep 18, 1996Kabushiki Kaisha ToshibaCharacter input device and methodEP1035712A2Feb 21, 2000Sep 13, 2000Nokia Mobile Phones Ltd.A communication terminal having a predictive editor applicationJPH0271361A Title not availableJPH09114817A Title not availableJPH11338858A Title not availableJPS63768A Title not availableJPS58161028A Title not availableJPS60129875A Title not availableWO1997005541A1Jul 26, 1996Feb 13, 1997Martin T KingReduced keyboard disambiguating system* Cited by examinerNon-Patent CitationsReference1 *Nagao et al. "An Attempt to Computerized Dictionary Data Base" Published 1980 Dep't of EE Kyoto University, Tokyo Japan pp. 534-542.2Search Report for corresponding European Application No. 03252154.4 dated Nov. 2, 2005.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7487145Nov 11, 2004Feb 3, 2009Google Inc.Method and system for autocompletion using ranked resultsUS8027974Jan 26, 2009Sep 27, 2011Google Inc.Method and system for URL autocompletion using ranked resultsUS8136050 *Nov 21, 2003Mar 13, 2012Nuance Communications, Inc.Electronic device and user interface and input method thereforUS8156109Oct 29, 2010Apr 10, 2012Google Inc.Anticipated query generation and processing in a search engineUS8271471Sep 26, 2011Sep 18, 2012Google Inc.Anticipated query generation and processing in a search engineUS8271546Sep 23, 2011Sep 18, 2012Google Inc.Method and system for URL autocompletion using ranked resultsUS8312032Jul 10, 2008Nov 13, 2012Google Inc.Dictionary suggestions for partial user entriesUS8515954Aug 25, 2011Aug 20, 2013Google Inc.Displaying autocompletion of partial search query with predicted search results* Cited by examinerClassifications U.S. Classification715/259, 715/264, 715/810International ClassificationG06F3/023, G06F3/00, G06F17/22, G06F17/27, G06F15/00, G06F3/01Cooperative ClassificationG06F17/2223, G06F17/276, G06F3/0236, G06F3/0237, G06F3/018European ClassificationG06F3/023M6, G06F3/023M8, G06F17/22E2, G06F3/01M, G06F17/27PLegal EventsDateCodeEventDescriptionAug 11, 2010FPAYFee paymentYear of fee payment: 4Aug 28, 2007CCCertificate of correctionJun 26, 2007CCCertificate of correctionApr 15, 2003ASAssignmentOwner name: FUJITSU LIMITED, JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MORIMOTO, YOUITI;HAYASHIDA, KEN;AOYAMA, SUSUMU;AND OTHERS;REEL/FRAME:013976/0290Effective date: 20030303RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google