4. The method of claim 1 wherein the n-grams are bigrams.
4. The method of claim 1 wherein the n-grams are bigrams. 5. The method of claim 4 wherein generating the segment score St(L) for each segment t includes computing, for each language L that is in the active one of the disjoint subsets At: S t ⁡ ( L ) = log ⁡ [ 1 P L ⁡ ( c 0 ) ] + ∑ i = 1 n - 1 ⁢ log ⁡ [ 1 P L ⁡ ( c i | c i - 1 ) ] , wherein c 0 represents the first character in the segment t, P L (c 0 ) is a probability of the character c 0 occurring in the language L, c i−1 and c i represent a pair of consecutive characters in the segment t, P L (c i |c i−1 ) is a probability of a bigram consisting of a character sequence c i−1 c 1 occurring in the language L, and n is the number of characters in the segment t.