10. The computer-readable storage medium of claim 1 , wherein the instructions, when executed, assist a user by predicting at least one of a next word or phrase using a prediction model that includes: P ⁡ ( w n ⁢ | ⁢ w n - N + 1 n - 1 ) = k n ⁢ C ⁡ ( w n - N + 1 n ) C ⁡ ( w n - N + 1 n - 1 ) + k n - 1 ⁢ C ⁡ ( w n - N + 2 n ) C ⁡ ( w n - N + 2 n - 1 ) + … + k 1 ⁢ C ⁡ ( w n ) n wherein, w represents a word where w 1 is the oldest word, w 2 is the next oldest word, . . . and w n is the next word or phrase to be predicted; w m n represents a sequence of words, from w n , to w n ; W n−N+1 . . . w n−1 represents a sequence of preceding candidates; P(w n ) represents the probability of w n ; P(w n |w m n−1 ) represents the probability of the at least one of the next word or phrase (w n ) given a preceding sequence w m n−1 ; C(w m n ) represents a number of times that a sequence of candidates w m . . . w n exists in a data store; k i represents an interpolation coefficient, where Σ i k i =1; n represents a number of words in the data store; and, N represents a number that specifies a length of a candidate sequence used to predict a number of candidates.
11. The computer-readable storage medium of claim 10 , wherein the instructions, when executed, assist a user by predicting the at least one of the next word or phrase using the prediction model and a preceding sequence of words, wherein the preceding sequence of words is determined based in part on the value of N.