TEXT PREDICTION WITH PARTIAL SELECTION IN A VARIETY OF DOMAINS

• US 20080310723A1
• Filed: 06/18/2007
• Published: 12/18/2008
• Est. Priority Date: 06/18/2007
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Manu, Mitica, Markiewicz, Jan-Kristian, Music, Bradley A., Haslam, Brian D.
• Granted Patent: US 8,504,349 B2
• Time in Patent Office: Days
• US Class Current: 382/182
• CPC Class Codes: G06F 3/0237 using prediction or retrieval techniques
• CPC Class Codes: G06F 40/274 Converting codes to words; Guess-ahead of partial word inputs

Abstract

A computing system may predict a word based on received user input that selects a part of the word (e.g., the first characters, the first root, etc.). Specifically, a program, when run on the computing system, may perform a method including creating a candidate list of words based on received user input. These words may be then organized into a hierarchy, or tree structure, in which each word is associated with a parent and each parent is a partial match for its associated words. The top-tier partial matches may be presented, and user input corresponding to a selected partial match may be received. A set of candidates related to the selected partial match may then be presented for user selection.

Claims

1. A computer-implemented method for predicting a word based on partial selection, the method comprising:

creating a candidate list of words based on received user input;

creating a hierarchy for the candidate list, the hierarchy including each of the words in the candidate list and a plurality of partial matches to which each of the words is associated;

presenting a top-tier of partial matches;

receiving user input corresponding to a selected partial match;

presenting a set of candidates related to the selected partial match; and

receiving user input corresponding to a selected candidate.

2. The method of claim 1, further comprising inserting a word corresponding to the selected candidate into a document.

3. The method of claim 1, wherein the top-tier partial matches are created based on linguistic roots.

4. The method of claim 1, wherein the top-tier partial matches are created based on linguistic stems.

5. The method of claim 1, wherein the top-tier partial matches are created based on linguistic syllables.

6. The method of claim 1, wherein the candidate list is created from entries in one or more active dictionaries.

7. The method of claim 1, wherein the candidate list is created from entries in an active prediction dictionary.

8. The method of claim 1, wherein the hierarchy is generated based on a target range of options per partial match.

9. The method of claim 8, wherein the target range comprises a minimum and a maximum number of nodes per tier.

10. The method of claim 1, wherein the candidate list is generated when a predetermined number of characters have been received.

11. The method of claim 1, wherein the hierarchy is generated prior to receiving the user input.

12. The method of claim 1, wherein the top-tier partial matches and the set of candidates are presented in a style similar to the style of the received user input.

13. A computing device comprising:

an input interface;

a display interface;

a console coupled with the input interface and the display interface, the console including computer-readable instructions for performing a word completion process, the word completion process comprising;

creating a candidate list based on received user input;

creating a hierarchy for the candidate list; and

until the word is complete, iteratively;

presenting a next tier of nodes;

receiving input corresponding to a selected node;

determining whether the selected node is a word;

when the selected node is a word, inserting the completed word; and

when the selected node is a partial match for a word, returning to presenting a next tier of nodes.

14. The computing device of claim 13, wherein a node corresponding to a word is presented in a different manner than a node corresponding to a partial match for a word.

15. The computing device of claim 13, wherein a node corresponding to a word and a node corresponding to a partial match for a word are presented on a single tier.

16. The computing device of claim 13, wherein a node corresponding to a word and a node corresponding to a partial match for a word are presented as children of a parent partial match node.

17. A computer-implemented method comprising:

receiving a first set of user input;

determining a first set of predicted characters based on the first set of user input;

presenting the first set of predicted characters in an area that can be edited by the user;

receiving new character user input that overwrites a predicted character;

accepting one or more characters between the overwritten character and the end of the first set of user input as an accepted character; and

completing a word based at least partially on the first set of user input, the accepted one or more characters, and the new character user input.

18. The computer-implemented method of claim 17, further comprising:

receiving an additional new character user input that occurs after the first set of predicted characters, thereby completing the word.

19. The computer-implemented method of claim 17, further comprising:

presenting a revised set of predicted characters based on the first set of user input, the accepted character, and the new character user input.

20. The computer-implemented method of claim 19, wherein the accepted character is accepted without accepting the first set of predicted characters in its entirety.