17. A non-transitory machine-readable medium comprising instructions which, when executed, cause at least one processor to at least: identify a token that frequently begins a suffix found in the corpus; identify first suffixes and second suffixes within the corpus; detect that the first suffixes begin with the token and that the second suffixes do not begin with the token; perform a first counting algorithm to identify a first count of n-grams in the first suffixes; and perform a second counting algorithm to identify a second count of n-grams in the second suffixes, the second counting algorithm different from the first counting algorithm, the second count of n-grams used as a statistic for computational linguistics.
17. A non-transitory machine-readable medium comprising instructions which, when executed, cause at least one processor to at least: identify a token that frequently begins a suffix found in the corpus; identify first suffixes and second suffixes within the corpus; detect that the first suffixes begin with the token and that the second suffixes do not begin with the token; perform a first counting algorithm to identify a first count of n-grams in the first suffixes; and perform a second counting algorithm to identify a second count of n-grams in the second suffixes, the second counting algorithm different from the first counting algorithm, the second count of n-grams used as a statistic for computational linguistics. 18. The machine-readable medium of claim 17 , wherein the instructions cause the at least one processor to perform the second counting algorithm by distributing the second suffixes among a first number of nodes in a cluster, the first number of nodes greater than a second number of suffixes in the second suffixes.