Automatic dynamic contextual data entry completion system

• US 8,311,805 B2
• Filed: 06/08/2006
• Issued: 11/13/2012
• Est. Priority Date: 01/21/2005
• Status: Expired due to Fees

• Current Assignee: Mountech IP LLC (IP Edge LLC)
• Original Assignee: Prashant Parikh
• Inventors: Parikh, Prashant
• Primary Examiner(s): Pullias, Jesse
• Application Number:
  US11/422,939
• Publication Number:
  US 20060217953A1
• Time in Patent Office: 2,350 Days
• Field of Search: 715/256, 715/261, 715/271, 707/737
• US Class Current: 704/9
• 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
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates

Abstract

A method, performed in a character entry system, for interrelating character strings so that an incomplete input character string can be completed by selection of a presented character string involves computing relationship scores for individual character strings in the system from documents present in the character entry system, in response to inputting of a string of individual characters that exceeds a specified threshold, identifying at least one selectable character string from among contextual associations that can complete the input character string in context based upon an overall ranking score computed as a function of at least two other scores, and providing the identified at least one selectable character string to a user for selection.

Claims

1. A method, performed in a character entry system, for interrelating character strings so that an incomplete input character string can be completed by selection of a presented character string, the method comprising:

computing relationship scores for individual character strings in the system from documents stored in memory of the character entry system, the relationship scores consisting of a function consisting of co-occurrence scores between pairs of distinct character strings stored in a single matrix created from the character strings in the stored documents;

in response to inputting of a string of individual characters that exceeds a specified threshold, identifying at least one selectable character string from among contextual associations that can complete the input character string in context based upon an overall ranking score computed as a function of a relationship score and at least one other score; and

providing the identified at least one selectable character string to a user for selection.

2. The method of claim 1, wherein each relationship score represents the contextual association between an individual character string and another character string based upon co-occurrence of character strings relative to each other.

3. The method of claim 2, further comprising:

computing the overall ranking score as a monotonic function of the relationship score and a frequency score.

4. The method of claim 3, wherein the overall ranking score is a product of the relationship score and the frequency score, unless either relationship score or frequency score have a value of zero or one, in which case the overall ranking score will be a sum of the relationship score and the frequency score.

5. The method of claim 3, further comprising:

computing the relationship score as a monotonic function of co-occurrence scores.

6. The method of claim 5 wherein:

the relationship score is a sum of the co-occurrence scores.

7. The method of claim 3 wherein the at least one selectable character string comprises at least two strings, each having an overall score, and wherein the overall score for each is the same the method comprises:

ranking the strings according to a hierarchy.

8. The method of claim 7 wherein the hierarchy is based upon at least one of:

exact matches, stopwords, related words, unrelated words.

9. The method of claim 8, wherein the hierarchy comprises, in order of precedence, exact matches followed by stopwords followed by related words followed by unrelated words.

10. The method of claim 1, wherein, each relationship score is a function of membership of the individual character strings in a candidate completion'"'"'s group.

11. The method of claim 10 wherein the function comprises a value based upon membership in multiple groups.

12. The method of claim 11 wherein the value is based upon a frequency within each of the multiple groups to which the at least one selectable character string belongs.

13. The method of claim 10 wherein the at least one selectable character string comprises at least two strings, each having an overall score, and wherein the overall score for each is the same the method comprises:

ranking the strings according to a hierarchy.

14. The method of claim 13 wherein the hierarchy is based upon at least one of:

exact matches, stopwords, related words, unrelated words.

15. The method of claim 14 wherein the hierarchy comprises, in order of precedence, exact matches followed by stopwords followed by related words followed by unrelated words.