Spell checking for text input via reduced keypad keys
First Claim
1. A method for spell checking an intended word entered using a reduced keypad, where each of one or more input keys of the reduced keypad is mapped to a plurality of letters, the method comprising:
- for an entered key input corresponding to an entered misspelled word and at least one of a left context and a right context,finding one or more potential non-corresponding words from a dictionary of words based on a cost, where each potential non-corresponding word has a key input that does not match the key input of the entered misspelled word, and wherein the cost between the key input of the entered misspelled word and the non-corresponding potential word is less than or equal to a maximum cost; and
determining a probability for the one or more potential non-corresponding words based on the at least one of a left context and a right context using a language model comprising probability values corresponding to sequences of word N-grams of a natural language, the language model trained in part using words previously entered in a cache;
updating the language model using words entered into the cache; and
presenting at least one of the one or more potential non-corresponding words as the intended word based on probability.
2 Assignments
0 Petitions
Accused Products
Abstract
Spell checking of a word corresponding to a typically numeric key sequence entered by the user using numeric keys or other reduced keyboards is disclosed. The spell checking is based on comparisons of the entered number sequences with number sequences within a dictionary, or number sequences for words within a dictionary. For a given entered number sequence, the number sequences of words in a dictionary, or the number sequences in the dictionary, are compared. Those having costs according to a metric not greater than a maximum cost are presented as the potential intended word of the user. The metric may be the minimum edit distance, for example.
144 Citations
31 Claims
-
1. A method for spell checking an intended word entered using a reduced keypad, where each of one or more input keys of the reduced keypad is mapped to a plurality of letters, the method comprising:
-
for an entered key input corresponding to an entered misspelled word and at least one of a left context and a right context, finding one or more potential non-corresponding words from a dictionary of words based on a cost, where each potential non-corresponding word has a key input that does not match the key input of the entered misspelled word, and wherein the cost between the key input of the entered misspelled word and the non-corresponding potential word is less than or equal to a maximum cost; and determining a probability for the one or more potential non-corresponding words based on the at least one of a left context and a right context using a language model comprising probability values corresponding to sequences of word N-grams of a natural language, the language model trained in part using words previously entered in a cache; updating the language model using words entered into the cache; and presenting at least one of the one or more potential non-corresponding words as the intended word based on probability. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computer-readable medium having instructions stored thereon for execution by a processor to perform a method for determining a word entered using a reduced keypad, where each of one or more input keys of the reduced keypad is mapped to a plurality of letters, the method comprising:
-
receiving key input corresponding to the word and a left context; for each word in a vocabulary that is consistent with the key input of the word, determining a probability of the word given the left context using a language model comprising probability values corresponding to sequences of word N-grams of a natural language, the language model trained in part on words entered into a cache, and adding the word and the probability of the word to an array of word-probability pairs; updating the language model using words entered in the cache; finding one or more potential words from a dictionary of words, where each potential word has a cost between the entered key input of the word and an input sequence corresponding to the potential word less than or equal to a maximum cost; determining a probability of each potential word given the left context and taking into account a probability that each letter of the potential word is misspelled, and adding the potential word and the probability of the word to the array; and determining the intended word corresponding to the key input as a word of a word-probability pair within the array of word-probability pairs having a greatest probability. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23)
-
-
24. An apparatus comprising:
-
a plurality of keys, each of one or more of the keys mapped to a plurality of letters, the plurality of keys used to enter key input corresponding to a word and at least one of a left context and a right context; a word-determining logic comprising; an ambiguity resolving logic comprising; a module adapted to generate a list of words, each listed word having a key input sequence identical to the key input sequence of the entered word; a second module adapted to determine a probability of each listed word based in part on the at least one of the left context and the right context using a language model comprising probability values corresponding to sequences of word N-grams of a natural language, the language model trained in part with words previously entered into a cache; a third module adapted to update the language model based on words entered into the cache; and a spell-checking logic designed to provide potential alternative words for the entered word corresponding to the key input entered, where the entered word is misspelled, taking into account that the word was entered using the plurality of keys, as opposed to a keyboard having a unique key for each of a plurality of letters. - View Dependent Claims (25, 26, 27, 28, 29, 30, 31)
-
Specification