15. A system for evaluating a sequence of characters to determine the presence of a natural language word in the sequence, the system comprising: one or more processors; and a memory comprising: instructions which, when executed by the one or more processors, cause the one or more processors to implement a method, the method comprising: finding a subsequence of alphabetical characters in the sequence of characters, wherein the received sequence comprises both alphabetical and non-alphabetic characters, and wherein the subsequence corresponds to alphabetical characters occurring between the non-alphabetic characters in the received sequence; calculating a probability, based on the statistical model, that the subsequence of alphabetical characters is a natural language word; and determining if the subsequence is a natural language word based on the probability.
15. A system for evaluating a sequence of characters to determine the presence of a natural language word in the sequence, the system comprising: one or more processors; and a memory comprising: instructions which, when executed by the one or more processors, cause the one or more processors to implement a method, the method comprising: finding a subsequence of alphabetical characters in the sequence of characters, wherein the received sequence comprises both alphabetical and non-alphabetic characters, and wherein the subsequence corresponds to alphabetical characters occurring between the non-alphabetic characters in the received sequence; calculating a probability, based on the statistical model, that the subsequence of alphabetical characters is a natural language word; and determining if the subsequence is a natural language word based on the probability. 24. The system of claim 15 , wherein the computation module employs a Bayesian inference in calculating the probability.