Typing candidate generating method for enhancing typing efficiency

• US 8,594,999 B2
• Filed: 12/10/2012
• Issued: 11/26/2013
• Est. Priority Date: 09/27/2006
• Status: Active Grant

• Current Assignee: Academia Sinica (Government of The Republic of China)
• Original Assignee: Academia Sinica (Government of The Republic of China)
• Inventors: Hsu, Wen-Lian
• Primary Examiner(s): Godbold, Douglas
• Application Number:
  US13/709,495
• Publication Number:
  US 20130185053A1
• Time in Patent Office: 351 Days
• Field of Search: 704/1, 704/9, 715/257
• US Class Current: 704/9
• CPC Class Codes: G06F 40/10 Text processing natural language analysis G06F40/20; semantic analysis G06F40/30; processing or translation of natural language G06F40/40
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation
• CPC Class Codes: G06F 40/274 Converting codes to words; Guess-ahead of partial word inputs

Abstract

For relieving typing burdens caused by incorrect spellings, typing errors, unknown spellings, and characters with diacritical marks, and for enhancing a typing efficiency of a typist with some simplified techniques, several candidate generating methods are provided for assisting the typist to pick a candidate word from a list of generated candidate words, or for selecting a candidate word from said list of generated candidate words in an automatic-selection manner. A proper-designed user interface may also be utilized for implementing the candidate generating methods.

Claims

1. A method for processing text input from a user using an interactive text entry interface, the method comprising:

maintaining a text storage representing words and word sequences previously accepted as sentence text input via the entry interface from the user;

accepting further input comprising a sequence of input lexical items accepted via the entry interface from the user, the further input representing a desired sequence of one or more words of text input, wherein the desired sequence of one or more words corresponds to a representation as a sequence of lexical items from a predetermined set of lexical item, and the sequence of input lexical items comprises a subsequence of the lexical items of the representation of the desired sequence of one or more words;

searching the text storage of previously accepted words and word sequences without requiring prior specification of candidates as possible results of the searching to locate one or more candidates in which the sequence of input lexical items of the further input forms a subsequence of less than all the lexical items of a representation of the candidate; and

determining the desired sequence of one or more words from the candidates located in the text storage.

2. The method of claim 1 wherein the predetermined set of lexical items comprises a set of letters of an alphabet.

3. The method of claim 2 wherein accepting further input comprises accepting a sequence of letters via the entry interface.

4. The method of claim 3 wherein accepting the sequence of letters via the entry interface comprises accepting said letters via a keyboard interface.

5. The method of claim 1 wherein the predetermined set of lexical items comprises a set of lexical items for representing characters of an Asian language.

6. The method of claim 5 wherein at least some characters of the Asian language are represented by a sequence of multiple lexical items of the predetermined set.

7. The method of claim 5 wherein the predetermined set of lexical items comprises items for representation of characters of an Asian language using an approach from a group consisting of Mandarin Pinyin Input, Cangjie Input, and Japanese Kanji Input.

8. The method of claim 5 wherein the desired sequence of one or more words of text input comprises a sequence of characters of an Asian language.

9. The method of claim 8 wherein for at least one characters of the sequence of characters, the sequence of input lexical items comprises a subsequence of the lexical items that represent that character.