1. An apparatus to identify a count of n-grams in a corpus, the apparatus comprising: a hot-word detector to identify a token that frequently begins a suffix found in the corpus; a suffix identifier to identify first suffixes and second suffixes within the corpus, the suffix identifier to detect that the first suffixes begin with the token and that the second suffixes do not begin with the token; and an n-gram count controller to direct a cluster of nodes to perform a first counting algorithm to identify a first count of n-grams in the first suffixes, the n-gram count controller to direct the cluster of nodes to 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 count of n-grams used as a statistic for computational linguistics.
1. An apparatus to identify a count of n-grams in a corpus, the apparatus comprising: a hot-word detector to identify a token that frequently begins a suffix found in the corpus; a suffix identifier to identify first suffixes and second suffixes within the corpus, the suffix identifier to detect that the first suffixes begin with the token and that the second suffixes do not begin with the token; and an n-gram count controller to direct a cluster of nodes to perform a first counting algorithm to identify a first count of n-grams in the first suffixes, the n-gram count controller to direct the cluster of nodes to 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 count of n-grams used as a statistic for computational linguistics. 5. The apparatus of claim 1 , wherein the first counting algorithm is to use a MapReduce job executed within a clustered computing environment.