16. The machine readable storage of claim 13 , further comprising: code for identifying bigrams that are entirely composed of meaningless unigrams; code for determining whether the identified bigrams are individually meaningless; and code for assigning at least a portion of the bigrams identified as being individually meaningless to the first n-gram class.
16. The machine readable storage of claim 13 , further comprising: code for identifying bigrams that are entirely composed of meaningless unigrams; code for determining whether the identified bigrams are individually meaningless; and code for assigning at least a portion of the bigrams identified as being individually meaningless to the first n-gram class. 17. The machine readable storage of claim 16 , further comprising code for categorizing the identified bigrams into at least one class selected from the group consisting of a nonsensical class and at least one ambiguous class.