Method, system, and graphical user interface for text entry with partial word display
First Claim
Patent Images
1. A computer-implemented method, comprising:
- receiving an input sequence of one or more alphabet characters;
identifying one or more candidate sequences that satisfy predefined usage frequency criteria with respect to the input sequence, each candidate sequence comprising a concatenation of the input sequence and one or more additional alphabet characters, wherein;
the candidate sequences include partial words; and
the identifying one or more candidate sequences that satisfy predefined usage frequency criteria comprises;
identifying a character sequence tree data structure, each node of the character sequence tree corresponding to a distinct character sequence, the input sequence corresponding to a first node in the character sequence tree; and
selecting one or more candidate character sequences corresponding to one or more descendent nodes of the first node that have values above a predefined threshold, wherein a respective value for a respective descendent node of the first node is the usage frequency weight of the respective descendent node divided by the usage frequency weight of the first node; and
presenting a candidate sequence from the one or more identified candidate sequences that is a partial word, wherein the partial word comprises a concatenation of the input sequence and two or more additional alphabet characters and the partial word by itself is not a complete word.
2 Assignments
0 Petitions
Accused Products
Abstract
A computer-implemented method for text entry includes receiving entered text from a user, selecting a set of candidate sequences for completing or continuing the sequence, and presenting the candidate sequences to the user, wherein the candidate sequences include partial words. The candidate sequences are identified based on usage frequency weights stored in a tree data structure. A graphical user interface for text entry includes displaying a current input sequence of characters and the identified partial words.
96 Citations
15 Claims
-
1. A computer-implemented method, comprising:
-
receiving an input sequence of one or more alphabet characters; identifying one or more candidate sequences that satisfy predefined usage frequency criteria with respect to the input sequence, each candidate sequence comprising a concatenation of the input sequence and one or more additional alphabet characters, wherein; the candidate sequences include partial words; and the identifying one or more candidate sequences that satisfy predefined usage frequency criteria comprises; identifying a character sequence tree data structure, each node of the character sequence tree corresponding to a distinct character sequence, the input sequence corresponding to a first node in the character sequence tree; and selecting one or more candidate character sequences corresponding to one or more descendent nodes of the first node that have values above a predefined threshold, wherein a respective value for a respective descendent node of the first node is the usage frequency weight of the respective descendent node divided by the usage frequency weight of the first node; and presenting a candidate sequence from the one or more identified candidate sequences that is a partial word, wherein the partial word comprises a concatenation of the input sequence and two or more additional alphabet characters and the partial word by itself is not a complete word. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A graphical user interface on a portable electronic device with memory and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
-
an input sequence of one or more alphabet characters; one or more partial word suggestions that satisfy predefined usage frequency criteria with respect to the input sequence, each partial word suggestion comprising a concatenation of the input sequence and two or more additional alphabet characters and the partial word by itself is not a complete word; wherein; the input sequence of one or more alphabet characters are received from a user; a character sequence data tree structure is identified, each node of the character sequence tree corresponding to a distinct character sequence, the input sequence corresponding to a first node in the character sequence tree; and one or more partial word suggestions corresponding to one or more descendent nodes of the first node that have values above a predefined threshold are selected, wherein a respective value for a respective descendent node of the first node is the usage frequency weight of the respective descendent node divided by the usage frequency weight of the first node. - View Dependent Claims (11, 12)
-
-
13. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a portable electronic device, cause the portable electronic device to:
-
receive an input sequence of one or more alphabet characters; identify one or more candidate sequences that satisfy predefined usage frequency criteria with respect to the input sequence, each candidate sequence comprising a concatenation of the input sequence and one or more additional alphabet characters, wherein; the candidate sequences include partial words; and identifying one or more candidate sequences that satisfy predefined usage frequency criteria comprises; identifying a character sequence tree data structure, each node of the character sequence tree corresponding to a distinct character sequence, the input sequence corresponding to a first node in the character sequence tree; and selecting one or more candidate character sequences corresponding to one or more descendent nodes of the first node that have values above a predefined threshold, wherein a respective value for a respective descendent node of the first node is the usage frequency weight of the respective descendent node divided by the usage frequency weight of the first node; and present a candidate sequence from the one or more identified candidate sequences that is a partial word, wherein the partial word comprises a concatenation of the input sequence and two or more additional alphabet characters and the partial word by itself is not a complete word.
-
-
14. A portable electronic device, comprising:
-
a display; one or more processors; memory; and one or more programs, wherein the is one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including; instructions to receive an input sequence of one or more alphabet characters; instructions to identify one or more candidate sequences that satisfy predefined usage frequency criteria with respect to the input sequence, each candidate sequence comprising a concatenation of the input sequence and one or more additional alphabet characters, wherein; the candidate sequences include partial words; and the instructions to identify one or more candidate sequences that satisfy predefined usage frequency criteria comprises; instructions to identify a character sequence tree data structure, each node of the character sequence tree corresponding to a distinct character sequence, the input sequence corresponding to a first node in the character sequence tree; and instructions to select one or more candidate character sequences corresponding to one or more descendent nodes of the first node that have values above a predefined threshold, wherein a respective value for a respective descendent node of the first node is the usage frequency weight of the respective descendent node divided by the usage frequency weight of the first node; and instructions for presenting a candidate sequence from the one or more identified candidate sequences that is a partial word, wherein the partial word comprises a concatenation of the input sequence and two or more additional alphabet characters and the partial word by itself is not a complete word.
-
-
15. A portable electronic device, comprising:
-
means for receiving an input sequence of one or more alphabet characters; means for identifying one or more candidate sequences that satisfy predefined usage frequency criteria with respect to the input sequence, each candidate sequence comprising a concatenation of the input sequence and one or more additional alphabet characters, wherein; the candidate sequences include partial words; and the means for identifying one or more candidate sequences that satisfy predefined usage frequency criteria comprises; means for identifying a character sequence tree data structure, each node of the character sequence tree corresponding to a distinct character sequence, the input sequence corresponding to a first node in the character sequence tree; and means for selecting one or more candidate character sequences corresponding to one or more descendent nodes of the first node that have values above a predefined threshold, wherein a respective value for a respective descendent node of the first node is the usage frequency weight of the respective descendent node divided by the usage frequency weight of the first node; and means for presenting a candidate sequence from the one or more identified candidate sequences that is a partial word, wherein the partial word comprises a concatenation of the input sequence and two or more additional alphabet characters and the partial word by itself is not a complete word.
-
Specification