US20090164891A1 - Automatic spelling correction apparatus - Google Patents
Automatic spelling correction apparatus Download PDFInfo
- Publication number
- US20090164891A1 US20090164891A1 US12/379,473 US37947309A US2009164891A1 US 20090164891 A1 US20090164891 A1 US 20090164891A1 US 37947309 A US37947309 A US 37947309A US 2009164891 A1 US2009164891 A1 US 2009164891A1
- Authority
- US
- United States
- Prior art keywords
- character
- character combination
- combination
- cycled
- button
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/20—Natural language analysis
- G06F40/232—Orthographic correction, e.g. spell checking or vowelisation
Definitions
- the present invention relates to input correction, and more particularly to an apparatus for automatic spelling correction.
- Handheld devices such as cellular phones, and PDAs, are designed to be small enough to meet mobility requirements.
- handheld devices provide a limited number of buttons for input, and the sum of the buttons is less the total number of characters, such as English letters or phonetic symbols corresponding with Zhu Yin Fu Hao phonetic symbol system.
- Mobile phones for example, are limited to 12 buttons for input of phonetic symbols to assemble a Chinese word while the Zhu Yin Fu Hao phonetic symbol system has 37 phonetic symbols, resulting in input difficulty.
- cycled buttons capable of inputting character combinations with one key have been introduced for use in handheld devices.
- the cycled button enables to input a series of character elements by continuous key pressing. Cycled buttons are discussed in further detail in the following.
- FIG. 1 is a schematic diagram of a conventional key pad of mobile phone. Buttons 10 to 19 are utilized to input Arabic numerals, phonetic symbols, English letters, or other characters associated with a particular input mode.
- the phonetic symbol is input by pressing button 11 , and is subsequently, replaced with and in sequence when button 11 is pressed continuously.
- cycled button input is also applicable to English entries.
- the letter “A” is input by pressing button 12 . “A” is replaced sequentially by “B” and then “C” when button 12 is pressed continuously. Further, after the letter “A” is input, the letter “W” is appended to “A” by pressing button 19 to generate the character combination “AW”.
- buttons are difficult due to small, difficult to read prompts. Additionally, when an incorrect character is input, the “clear” button must be pressed to first erase the character before the correct character can be input, resulting in additional keystrokes. For example, when the intended input is but is entered instead, the clear button must first be pressed to erase and button 18 must then be pressed to append to
- the apparatus comprises a storage device, a processing unit, and a display unit.
- the sum of cycled buttons of the apparatus is less than the sum of the characters.
- Each cycled button with a keystroke number corresponds to a unique character.
- the storage device stores a character group table and multiple character combination records.
- the character group table stores a character sequence associated with each cycled button.
- the character combination records store multiple character combinations indicating the partial or complete valid spelling.
- the processing unit After inputting an original character combination and a first character, the processing unit first determines whether a first character combination consisting of the original character combination and the first character is valid spelling according to the character combination records.
- a second character combination is automatically generated by appending a second character to the original character combination.
- the first character and the second character are associated with the same cycled button.
- a third character combination is generated by replacing the last character of the original character combination with the first character combination.
- a fourth character combination is generated by replacing the first character of the first character combination with a third character without activating a clear button.
- the apparatus is a handheld communication device and the characters are Zhu Yin Fu Hao phonetic symbols to be converted into Chinese words.
- FIG. 1 is a schematic diagram of a conventional key pad on a mobile phone
- FIG. 2 is a schematic diagram of an apparatus of automatic spelling correction according to the invention.
- FIG. 3 is a diagram of an exemplary character group table according to the invention.
- FIG. 4A is a diagram of an exemplary phonetic symbol combination record according the invention.
- FIG. 4B is a diagram of an exemplary English letter combination record according to the invention.
- FIG. 5 is a flowchart showing a method of automatic spelling correction according to the invention.
- FIG. 2 is a schematic diagram of an apparatus for automatic spelling correction according to the invention.
- the apparatus comprises a storage device 21 , a processing unit 22 , and a display unit 23 .
- the storage device 21 stores a character group table 211 and multiple character combination records 212 , and can be a ROM, RAM, flash ROM or the like.
- the apparatus in a preferred embodiment is a handheld device, any electronic device with cycled buttons provided to input characters, such as Arabic numerals, English letters, phonetic symbols corresponding with Zhu Yin Fu Hao phonetic symbol system, or others, is applicable.
- the character group table 211 stores a character sequence composed of multiple characters, associated with a cycled button and an input mode.
- FIG. 3 is a diagram of an exemplary character group table according to the invention.
- Record 32 contains three character sequences corresponding to the cycled button 12 , associated with various input modes, and each character sequence includes multiple characters.
- Arabic numeral input mode character “2” is input when the cycled button 12 is pressed.
- Zhu Yin Fu Hao input mode characters, i.e. and are sequential and cycled input.
- characters, such as “A”, “B” and “C” are sequential and cycled input in English input mode. Consistent with the scope and spirit of the invention, additional or different fields may be provided.
- the character combination records 212 store multiple character combinations representing possible spellings for words, i.e. Chinese words, English words, and the like.
- a Chinese word spelled consists of two possible character combinations and
- the character combination is not limited in Chinese and English spelling, consistent with the scope and spirit of the invention, spellings corresponding with different languages may be applied.
- FIG. 4A is a diagram of an exemplary character combination record according the invention.
- the character pair combinations such as and are stored in records 411 , 412 , 413 , 414 and 415 respectively.
- FIG. 4 b is a diagram of other exemplary character combination records according to the invention.
- the triple character combinations such as “tek”, “tel”, “tem”, or others, are stored in records 421 to 429 respectively.
- a table structure is described in the above examples, a tree structure, a linked list, or other data structures are also applicable.
- the processing unit 22 first determines whether the new and prior input signals correspond to the same cycled button as is described in more detail in the following.
- the processing unit 22 first obtains a new character by reading the first character of a character sequence from the group table 211 corresponding to the new input signal, generates a first character combination by appending the new character to the original character combination, and subsequently, determines whether the first character combination has valid spelling according to the character combination record 212 .
- Several methods, such as sequential search, binary search, quick search, or other algorithms can be applied to determine a specific valid spelling according to the character combination record 212 .
- the processing unit 22 replaces the last character of the original character combination with the new character to generate a second character combination. For example, after inputting as an original character combination and as a new input character, the second character combination appears instead of the first character combination with invalid spelling, and the correct character combination is finally generated and displayed on the display unit 23 .
- the processing unit 22 first obtains a new character by reading the next character of a character sequence from the group table 211 according to the prior input character, generates a third character combination by replacing the last character of the original character combination with the new character, for example, the third character combination substitutes for the original character combination and subsequently, determines whether the third character combination has valid spelling based on the character combination record 212 .
- the third character combination which has valid spelling is displayed on the display unit 23 , instead, is regenerated by replacing the last character of it based on the character group table 211 . Such regeneration procedure is continually executed until a valid spelling is generated.
- FIG. 5 is a flowchart showing a method of automatic spelling correction according to the invention.
- step S 50 an original character combination is input, then, in step S 51 , an input signal is received.
- step S 52 it is determined whether the new and prior input signals correspond to the same cycled button.
- step S 53 a first character combination is generated by appending a new character corresponding to the new input signal to the original character combination.
- step S 54 determines whether the first character combination has valid spelling by comparing it with the character combination record 21 . If so, the process proceeds to S 59 and displays the first character combination on the display unit 23 , otherwise, the procedure returns to S 55 to replace the last character of the first character combination with the new character corresponding to the new input signal to generate a second character combination.
- step S 55 the process the procedure proceeds S 56 to determine whether the second character combination has valid spelling, if so, the procedure proceeds to S 59 to display the second character combination on the display unit 23 , otherwise, the procedure returns to S 55 to regenerate a character combination with valid spelling.
- step S 57 obtaining a new character by reading the next character of a character sequence from the group table 211 depending on the prior input character and replaces the last character of the original character combination with the new character to generate a third character combination.
- step S 58 determines whether the third character combination has valid spelling, if so, the process proceeds to S 59 to display the third character combination on the display unit 23 , otherwise, the process returns to S 57 to continually regenerate characters until a valid spelling is achieved.
- step S 50 the processing unit 22 inputs the original character combination and subsequently receives the new input signal corresponding to the cycled button 18 as in step S 51 .
- step S 52 the prior input signal is determined to correspond to the cycled button 19 but not 18 , and the procedure proceeds to S 53 to generate a first character combination
- a second character combination is generated by replacing the last character of with as in step S 55 .
- the combination is displayed on the display unit 23 as in step S 59 .
- step S 50 the processing unit 22 inputs original character combination and subsequently receives the new input signal corresponding to the cycled button 18 as in step S 51 .
- step S 52 the new input signal is determined to be the same as the prior signal, a third character combination is then generated, as in step S 57 , by replacing the last character of with according to the character group table 211 .
- step S 58 once third character combination is determined to be an invalid spelling, the process proceeds to S 57 to continually regenerate a third character combination Once is determined to have valid spelling as in step S 58 , the combination is displayed on the display unit 23 as in step S 59 .
- the present invention automatically corrects spelling without manual operation of the clear key and skips invalid spelling, effectively reducing keystrokes.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Input From Keyboards Or The Like (AREA)
Abstract
An automatic spelling correction apparatus. The apparatus comprises a storage device and a processing unit. The storage device stores a character group table containing a character sequence of each cycled button, and multiple character combination records. A processing unit receives an original character combination and a new character, to determine whether the original character combination has a valid spelling, if not, a valid character combination matching the character combination record according to the character group table is generated.
Description
- This patent application is a continuation application (CA) of a U.S. patent application Ser. No. 10/817,804 filed Apr. 6, 2004, and now pending. The contents of the related patent application are incorporated herein for reference.
- The present invention relates to input correction, and more particularly to an apparatus for automatic spelling correction.
- Handheld devices, such as cellular phones, and PDAs, are designed to be small enough to meet mobility requirements. In order to reduce size handheld devices provide a limited number of buttons for input, and the sum of the buttons is less the total number of characters, such as English letters or phonetic symbols corresponding with Zhu Yin Fu Hao phonetic symbol system. Mobile phones, for example, are limited to 12 buttons for input of phonetic symbols to assemble a Chinese word while the Zhu Yin Fu Hao phonetic symbol system has 37 phonetic symbols, resulting in input difficulty. Hence, cycled buttons, capable of inputting character combinations with one key have been introduced for use in handheld devices. The cycled button enables to input a series of character elements by continuous key pressing. Cycled buttons are discussed in further detail in the following.
-
FIG. 1 is a schematic diagram of a conventional key pad of mobile phone.Buttons 10 to 19 are utilized to input Arabic numerals, phonetic symbols, English letters, or other characters associated with a particular input mode. In Zhu Yin Fu Hao input mode, the phonetic symbol is input bypressing button 11, and is subsequently, replaced with and in sequence whenbutton 11 is pressed continuously. In addition, is appended to to generate the phonetic symbol combination since is input whenbutton 19 is pressed. Similarly, cycled button input is also applicable to English entries. The letter “A” is input bypressing button 12. “A” is replaced sequentially by “B” and then “C” whenbutton 12 is pressed continuously. Further, after the letter “A” is input, the letter “W” is appended to “A” by pressingbutton 19 to generate the character combination “AW”. - Although character entry via cycled button is functional, requiring additional keystrokes to input a phonetic symbol or an English letter may be considered by some to be inconvenient or even difficult. For example, the phonetic symbol combination requires only 3 keystrokes, it requires a total of 6 keystrokes using the cycled buttons described above.
- It has often been argued manipulating cycled buttons is difficult due to small, difficult to read prompts. Additionally, when an incorrect character is input, the “clear” button must be pressed to first erase the character before the correct character can be input, resulting in additional keystrokes. For example, when the intended input is but is entered instead, the clear button must first be pressed to erase and
button 18 must then be pressed to append to - Moreover, a series of not only characters but character combinations are generated by continuously pressing cycled buttons. Not all character combinations, however, have valid spelling. For example, and are sequentially generated by pressing the
button 18 after is input, but is an invalid spelling. Hence, it is desirable to provide a means of automatically disregarding the invalid spelling, thereby eliminating unnecessary additional keystrokes. - In view of these limitations, a need exists for a method and an apparatus of automatic spelling correction to effectively reduce keystrokes.
- It is therefore an object of the present invention to provide an automatic spelling correction apparatus to reduce keystrokes.
- According to the invention, the apparatus comprises a storage device, a processing unit, and a display unit. The sum of cycled buttons of the apparatus is less than the sum of the characters. Each cycled button with a keystroke number corresponds to a unique character.
- The storage device stores a character group table and multiple character combination records. The character group table stores a character sequence associated with each cycled button. The character combination records store multiple character combinations indicating the partial or complete valid spelling.
- After inputting an original character combination and a first character, the processing unit first determines whether a first character combination consisting of the original character combination and the first character is valid spelling according to the character combination records.
- In one embodiment, if the first character combination is invalid spelling, a second character combination is automatically generated by appending a second character to the original character combination. The first character and the second character are associated with the same cycled button.
- In one embodiment, if the first character combination is invalid spelling, a third character combination is generated by replacing the last character of the original character combination with the first character combination.
- In one embodiment, if the first character combination is invalid spelling, a fourth character combination is generated by replacing the first character of the first character combination with a third character without activating a clear button.
- In one embodiment, the apparatus is a handheld communication device and the characters are Zhu Yin Fu Hao phonetic symbols to be converted into Chinese words.
- The present invention can be more fully understood by reading the subsequent detailed description and examples with references made to the accompanying drawings, wherein:
-
FIG. 1 is a schematic diagram of a conventional key pad on a mobile phone; -
FIG. 2 is a schematic diagram of an apparatus of automatic spelling correction according to the invention; -
FIG. 3 is a diagram of an exemplary character group table according to the invention; -
FIG. 4A is a diagram of an exemplary phonetic symbol combination record according the invention; -
FIG. 4B is a diagram of an exemplary English letter combination record according to the invention; and -
FIG. 5 is a flowchart showing a method of automatic spelling correction according to the invention. -
FIG. 2 is a schematic diagram of an apparatus for automatic spelling correction according to the invention. The apparatus comprises astorage device 21, aprocessing unit 22, and adisplay unit 23. Thestorage device 21 stores a character group table 211 and multiplecharacter combination records 212, and can be a ROM, RAM, flash ROM or the like. Although the apparatus in a preferred embodiment is a handheld device, any electronic device with cycled buttons provided to input characters, such as Arabic numerals, English letters, phonetic symbols corresponding with Zhu Yin Fu Hao phonetic symbol system, or others, is applicable. The character group table 211 stores a character sequence composed of multiple characters, associated with a cycled button and an input mode. -
FIG. 3 is a diagram of an exemplary character group table according to the invention.Record 32 contains three character sequences corresponding to thecycled button 12, associated with various input modes, and each character sequence includes multiple characters. In Arabic numeral input mode, character “2” is input when thecycled button 12 is pressed. In Zhu Yin Fu Hao input mode, characters, i.e. and are sequential and cycled input. In addition, characters, such as “A”, “B” and “C”, are sequential and cycled input in English input mode. Consistent with the scope and spirit of the invention, additional or different fields may be provided. - The character combination records 212 store multiple character combinations representing possible spellings for words, i.e. Chinese words, English words, and the like. For example, a Chinese word spelled consists of two possible character combinations and The character combination is not limited in Chinese and English spelling, consistent with the scope and spirit of the invention, spellings corresponding with different languages may be applied.
-
FIG. 4A is a diagram of an exemplary character combination record according the invention. The character pair combinations, such as and are stored inrecords FIG. 4 b is a diagram of other exemplary character combination records according to the invention. The triple character combinations, such as “tek”, “tel”, “tem”, or others, are stored inrecords 421 to 429 respectively. Although a table structure is described in the above examples, a tree structure, a linked list, or other data structures are also applicable. - Referring to
FIG. 2 , after inputting an original character combination and a new input signal, theprocessing unit 22 first determines whether the new and prior input signals correspond to the same cycled button as is described in more detail in the following. - When the new and prior input signals correspond to different cycled buttons, the
processing unit 22 first obtains a new character by reading the first character of a character sequence from the group table 211 corresponding to the new input signal, generates a first character combination by appending the new character to the original character combination, and subsequently, determines whether the first character combination has valid spelling according to thecharacter combination record 212. Several methods, such as sequential search, binary search, quick search, or other algorithms can be applied to determine a specific valid spelling according to thecharacter combination record 212. Once the first character combination has valid spelling, the combination is displayed on thedisplay unit 23, otherwise, theprocessing unit 22 replaces the last character of the original character combination with the new character to generate a second character combination. For example, after inputting as an original character combination and as a new input character, the second character combination appears instead of the first character combination with invalid spelling, and the correct character combination is finally generated and displayed on thedisplay unit 23. - When the new and prior input signals correspond to the same cycled button, the
processing unit 22 first obtains a new character by reading the next character of a character sequence from the group table 211 according to the prior input character, generates a third character combination by replacing the last character of the original character combination with the new character, for example, the third character combination substitutes for the original character combination and subsequently, determines whether the third character combination has valid spelling based on thecharacter combination record 212. The third character combination, which has valid spelling is displayed on thedisplay unit 23, instead, is regenerated by replacing the last character of it based on the character group table 211. Such regeneration procedure is continually executed until a valid spelling is generated. -
FIG. 5 is a flowchart showing a method of automatic spelling correction according to the invention. - In step S50, an original character combination is input, then, in step S51, an input signal is received. In step S52, it is determined whether the new and prior input signals correspond to the same cycled button.
- When the new and prior input signals correspond to different cycled buttons, the procedure proceeds to step S53, wherein a first character combination is generated by appending a new character corresponding to the new input signal to the original character combination. Subsequently step S54 determines whether the first character combination has valid spelling by comparing it with the
character combination record 21. If so, the process proceeds to S59 and displays the first character combination on thedisplay unit 23, otherwise, the procedure returns to S55 to replace the last character of the first character combination with the new character corresponding to the new input signal to generate a second character combination. Continuing to step S55, the process the procedure proceeds S56 to determine whether the second character combination has valid spelling, if so, the procedure proceeds to S59 to display the second character combination on thedisplay unit 23, otherwise, the procedure returns to S55 to regenerate a character combination with valid spelling. - When the new and prior input signals correspond to the same cycled button, the process proceeds to S57, obtaining a new character by reading the next character of a character sequence from the group table 211 depending on the prior input character and replaces the last character of the original character combination with the new character to generate a third character combination. Subsequently, step S58 determines whether the third character combination has valid spelling, if so, the process proceeds to S59 to display the third character combination on the
display unit 23, otherwise, the process returns to S57 to continually regenerate characters until a valid spelling is achieved. - Further, referring to
FIG. 1 andFIG. 5 , the above method can be more fully understood by reading the following two exemplary cases. - In the first case, in step S50, the
processing unit 22 inputs the original character combination and subsequently receives the new input signal corresponding to the cycledbutton 18 as in step S51. In step S52, the prior input signal is determined to correspond to the cycledbutton 19 but not 18, and the procedure proceeds to S53 to generate a first character combination Once the first character combination is determined to have invalid spelling by comparison with thecharacter combination record 212 as in step S54, a second character combination is generated by replacing the last character of with as in step S55. Once the second character combination is determined to have valid spelling as in step S56, the combination is displayed on thedisplay unit 23 as in step S59. - In the second case, in step S50, the
processing unit 22 inputs original character combination and subsequently receives the new input signal corresponding to the cycledbutton 18 as in step S51. In step S52, the new input signal is determined to be the same as the prior signal, a third character combination is then generated, as in step S57, by replacing the last character of with according to the character group table 211. In step S58, once third character combination is determined to be an invalid spelling, the process proceeds to S57 to continually regenerate a third character combination Once is determined to have valid spelling as in step S58, the combination is displayed on thedisplay unit 23 as in step S59. - The present invention automatically corrects spelling without manual operation of the clear key and skips invalid spelling, effectively reducing keystrokes.
- Although the present invention has been described in its preferred embodiments, it is not intended to limit the invention to the precise embodiments disclosed herein. Those who are skilled in this technology can still make various alterations and modifications without departing from the scope and spirit of this invention. Therefore, the scope of the present invention shall be defined and protected by the following claims and their equivalents.
Claims (19)
1. An automatic spelling correction apparatus with a plurality of cycled buttons, wherein the sum of the cycled buttons is less than the sum of a plurality of characters and each cycled button with a keystroke number corresponds to a unique one of the characters, comprising:
a storage device capable of storing a character group table and a plurality of character combination records, the character group table storing a character sequence associated with each cycled buttons, each character combination record composed of the characters representing valid spelling; and
a processing unit configured to receive an original character combination and a first character corresponding to a first one of the cycled button with a first keystroke number, generate a first character combination by appending the first character to the original character combination, determine whether the first character combination is valid spelling according to the character combination records, and execute the following steps if the first character combination is not valid spelling:
generating a second character combination by appending a second character to the original character combination without pressing the first cycled button wherein the second character immediately follows the first character along the stored character sequence associated with the first cycled button; and
outputting the second character combination if the second character combination is valid spelling according to the character combination records.
2. The apparatus as claimed in claim 1 wherein the first character combination is determined to be valid spelling when the first character combination matches one of the character combination records, and the second character combination is determined to be valid spelling when the second character combination matches one of the character combination records.
3. The apparatus as claimed in claim 1 wherein the processing unit repeats generating the second character combination by appending a following character along the stored character sequence associated with the first cycled button to the original character combination without pressing the first cycled button until the second character combination is valid spelling.
4. The apparatus as claimed in claim 1 wherein the apparatus is a handheld communication device.
5. The apparatus as claimed in claim 1 wherein the apparatus further comprises a display unit for displaying the second character combination.
6. The apparatus as claimed in claim 1 wherein the characters are Zhu Yin Fu Hao phonetic symbols to be converted into Chinese words.
7. The apparatus as claimed in claim 6 wherein a third character combination is generated and outputted by replacing the last character of the original character combination with the first character if the last character of the original character combination is associated with the first cycled button.
8. An automatic spelling correction apparatus with a plurality of cycled buttons, wherein the sum of the cycled buttons is less than the sum of a plurality of characters and each cycled button with a keystroke number corresponds to a unique one of the characters, comprising:
a storage device capable of storing a character group table and a plurality of character combination records, the character group table storing a character sequence associated with each cycled buttons, each character combination record composed of the characters representing valid spelling; and
a processing unit configured to receive an original character combination and a first character corresponding to a first one of the cycled button with a first keystroke number, generate a first character combination by appending the first character to the original character combination, determine whether the first character combination is valid spelling according to the character combination records, generate a second character combination by replacing the last character of the original character combination with the first character if the first character combination is determined to be not valid spelling, and output the second character combination.
9. The apparatus as claimed in claim 8 wherein the first character combination is determined to be valid spelling when the first character combination matches one of the character combination records.
10. The apparatus as claimed in claim 8 wherein the apparatus is a handheld communication device.
11. The apparatus as claimed in claim 8 wherein the apparatus further comprises a display unit for displaying the second character combination.
12. The apparatus as claimed in claim 8 wherein the characters are Zhu Yin Fu Hao phonetic symbols to be converted into Chinese words.
13. An automatic spelling correction apparatus, comprising:
At least one cycled button generating an original character combination, and a first cycled button among the at least one cycled button for generating a first character appending to the original character combination sequentially;
a storage device capable of storing a character group table and a plurality of character combination records, the character group table storing a character sequence associated with each cycled button, each character combination record composed of the characters representing. valid spelling; and
a processing unit determining whether a first character combination of the first character appending to the original character combination sequentially is valid based on the character combination records; the processing unit replacing the first character of the first character combination with a second character automatically to generate a second character combination when the first character combination is invalid based on the character combination records,
wherein the first character and the second character are associated with the first cycled button.
14. The apparatus as claimed in claim 13 wherein the apparatus further comprises a display unit for displaying the second character combination.
15. The apparatus as claimed in claim 13 wherein the characters are Zhu Yin Fu Hao phonetic symbols to be converted into Chinese words.
16. An automatic spelling correction apparatus, comprising:
A plurality of cycled buttons generating an original character combination, and a first cycled button among the cycled buttons for generating a first character appending to the original character combination sequentially;
a storage device capable of storing a character group table and a plurality of character combination records, the character group table storing a character sequence associated with each cycled button, each character combination record composed of the characters representing valid spelling; and
a processing unit determining whether a first character combination of the first character appending to the original character combination sequentially is valid based on the character combination records, and the processing unit replacing the first character of the first character combination with a second character automatically to generate a second character combination when the first character combination is invalid based on the character combination records.
17. The apparatus as claimed in claim 16 wherein the processing unit replacing the first character with the second character automatically without activating a clear button.
18. The apparatus as claimed in claim 16 wherein the apparatus further comprises a display unit for displaying the second character combination.
19. The apparatus as claimed in claim 16 wherein the characters are Zhu Yin Fu Hao phonetic symbols to be converted into Chinese words.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/379,473 US20090164891A1 (en) | 2003-06-11 | 2009-02-23 | Automatic spelling correction apparatus |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW092115805A TWI220727B (en) | 2003-06-11 | 2003-06-11 | Character element input correcting device and method |
TW092115805 | 2003-06-11 | ||
US10/817,804 US7496842B2 (en) | 2003-06-11 | 2004-04-06 | Apparatus and method for automatic spelling correction |
US12/379,473 US20090164891A1 (en) | 2003-06-11 | 2009-02-23 | Automatic spelling correction apparatus |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/817,804 Continuation US7496842B2 (en) | 2003-06-11 | 2004-04-06 | Apparatus and method for automatic spelling correction |
Publications (1)
Publication Number | Publication Date |
---|---|
US20090164891A1 true US20090164891A1 (en) | 2009-06-25 |
Family
ID=33509816
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/817,804 Active 2025-01-14 US7496842B2 (en) | 2003-06-11 | 2004-04-06 | Apparatus and method for automatic spelling correction |
US12/379,473 Abandoned US20090164891A1 (en) | 2003-06-11 | 2009-02-23 | Automatic spelling correction apparatus |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/817,804 Active 2025-01-14 US7496842B2 (en) | 2003-06-11 | 2004-04-06 | Apparatus and method for automatic spelling correction |
Country Status (2)
Country | Link |
---|---|
US (2) | US7496842B2 (en) |
TW (1) | TWI220727B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060294462A1 (en) * | 2005-06-28 | 2006-12-28 | Avaya Technology Corp. | Method and apparatus for the automatic completion of composite characters |
US9037967B1 (en) | 2014-02-18 | 2015-05-19 | King Fahd University Of Petroleum And Minerals | Arabic spell checking technique |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE102005018467A1 (en) * | 2005-04-21 | 2006-11-02 | Robert Bosch Gmbh | Method for target selection in a navigation system |
US8918736B2 (en) * | 2006-01-05 | 2014-12-23 | Apple Inc. | Replay recommendations in a text entry interface |
US8830182B1 (en) | 2010-02-09 | 2014-09-09 | Google Inc. | Keystroke resolution |
US8179370B1 (en) | 2010-02-09 | 2012-05-15 | Google Inc. | Proximity based keystroke resolution |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6587819B1 (en) * | 1999-04-15 | 2003-07-01 | Matsushita Electric Industrial Co., Ltd. | Chinese character conversion apparatus using syntax information |
US6646573B1 (en) * | 1998-12-04 | 2003-11-11 | America Online, Inc. | Reduced keyboard text input system for the Japanese language |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5953541A (en) * | 1997-01-24 | 1999-09-14 | Tegic Communications, Inc. | Disambiguating system for disambiguating ambiguous input sequences by displaying objects associated with the generated input sequences in the order of decreasing frequency of use |
US7712053B2 (en) * | 1998-12-04 | 2010-05-04 | Tegic Communications, Inc. | Explicit character filtering of ambiguous text entry |
US6556841B2 (en) * | 1999-05-03 | 2003-04-29 | Openwave Systems Inc. | Spelling correction for two-way mobile communication devices |
-
2003
- 2003-06-11 TW TW092115805A patent/TWI220727B/en not_active IP Right Cessation
-
2004
- 2004-04-06 US US10/817,804 patent/US7496842B2/en active Active
-
2009
- 2009-02-23 US US12/379,473 patent/US20090164891A1/en not_active Abandoned
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6646573B1 (en) * | 1998-12-04 | 2003-11-11 | America Online, Inc. | Reduced keyboard text input system for the Japanese language |
US6587819B1 (en) * | 1999-04-15 | 2003-07-01 | Matsushita Electric Industrial Co., Ltd. | Chinese character conversion apparatus using syntax information |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060294462A1 (en) * | 2005-06-28 | 2006-12-28 | Avaya Technology Corp. | Method and apparatus for the automatic completion of composite characters |
US8413069B2 (en) * | 2005-06-28 | 2013-04-02 | Avaya Inc. | Method and apparatus for the automatic completion of composite characters |
US9037967B1 (en) | 2014-02-18 | 2015-05-19 | King Fahd University Of Petroleum And Minerals | Arabic spell checking technique |
Also Published As
Publication number | Publication date |
---|---|
TW200428265A (en) | 2004-12-16 |
TWI220727B (en) | 2004-09-01 |
US7496842B2 (en) | 2009-02-24 |
US20040255248A1 (en) | 2004-12-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8547329B2 (en) | Handheld electronic device and method for performing spell checking during text entry and for integrating the output from such spell checking into the output from disambiguation | |
US8392831B2 (en) | Handheld electronic device and method for performing optimized spell checking during text entry by providing a sequentially ordered series of spell-check algorithms | |
US7996769B2 (en) | Handheld electronic device and method for performing spell checking during text entry and for providing a spell-check learning feature | |
US20090164891A1 (en) | Automatic spelling correction apparatus | |
JPH08506444A (en) | Handwriting recognition method of likely character strings based on integrated dictionary | |
US20050268231A1 (en) | Method and device for inputting Chinese phrases | |
US8386236B2 (en) | Method for prompting by suggesting stroke order of chinese character, electronic device, and computer program product | |
EP1843255A1 (en) | Handheld electronic device and method for performing spell checking during text entry and for providing a spell-check learning feature | |
KR100726255B1 (en) | Portable Terminal and Method capable of inputting writing rapidly | |
US7958461B2 (en) | Method of inputting characters on a wireless mobile terminal | |
EP1843253A1 (en) | Handheld electronic device and method for performing optimized spell checking during text entry by providing a sequentially ordered series of spell-check algorithms | |
EP1843254A1 (en) | Handheld electronic device and method for performing spell checking during text entry and for integrating the output from such spell checking into the output from disambiguation | |
JP2008293306A (en) | Key input support device, key input method and program therefor | |
JP2585048Y2 (en) | Numeric character input device | |
US20080189327A1 (en) | Handheld Electronic Device and Associated Method for Obtaining New Language Objects for Use by a Disambiguation Routine on the Device | |
JPH0330048A (en) | Character input device | |
JPS57161970A (en) | Character processor | |
JPS62212871A (en) | Sentence reading correcting device | |
JP2003076479A (en) | Information and communication processor | |
JPH08263486A (en) | Device and method for kana/kanji conversion | |
JPS58192172A (en) | Electronic dictionary | |
JPH0581255A (en) | Device for correcting japanese word input | |
JPH0351959A (en) | Electronic dictionary | |
JPS60173661A (en) | Character string processing unit | |
JP2000099244A (en) | Device and method for character string input |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: ASUSTEK COMPUTER INC.,TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CHANG, HORNG-YI;REEL/FRAME:022347/0901 Effective date: 20031013 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |