Patent ID: 7188064

Claim:
A method for coding text data, comprising the steps of: generating a Hidden Markov Model which computes a probable coding responsive to a first group of text data; coding the first group of text data using a Viterbi algorithm using the Hidden Markov model; updating the Hidden Markov Model based upon the coding of the first group of text data; coding a second group of text data using the Viterbi algorithm using the updated Hidden Markov Model; wherein the step of coding the first group of text data comprises: assigning word concepts to groups of at least one word in the first group of text data; assigning propositions to groups of the assigned word concepts; wherein the steps of coding further comprises the step of determining a most probable proposition using the Viterbi algorithm; wherein the step of determining a most probable proposition further comprises the step of: determining a most probable set of word concepts for each set of words in a text segment and for a plurality of propositions using the Viterbi algorithm; and determining the most probable proposition for the plurality of propositions using the equation: I = - ( 1 / M ) ⁢ log ⁡ [ p ⁡ ( F J ) ⁢ ∏ i = 1 M ⁢ p ⁡ ( C i ❘ C i - 1 , C i - 2 , … ⁢ , C i - K , F J ) ⁢ p ⁡ ( W i ❘ C i ) ] where log [x] denotes the logarithm base 2 ; p(F)=percentage of time proposition F is used; p(C i |C i−1, . . . , C i−K , F)=percentage of time that word concept C i follows a previous sequence of word concepts, C i−1 , . . . , C i−K , given the proposition F; p(W i |C i )=percentage of time that a word (W i ) is used to express the word concept C i ; and K≧1.