11. The computer program product of claim 10 , where the position of a particular n-gram in each ranked collection of n-grams is a randomized function of a reliability and a rarity of the particular n gram within the collection of texts.
10. The computer program product of claim 8 , where generating a plurality of randomized ranked collections of n-grams further comprises: generating a probability matrix for each n-gram from the first and the second collections of n-grams using a first collection of text in the first natural language and a second collection of text in the second natural language, where the probability matrix for a particular n-gram identifies a probability for each of four categories: a probability that the n gram is not found in either the first or second collection of text, a probability that the n gram is found in the first collection of text but not the second collection of text; a probability that the n gram is found in the second collection of text but not the first collection of text, and a probability that the n-gram is found in both the first and second collection of text; and generating a ranked collection of n-grams for each of the first natural language and the second natural language as a function of the generated probability matrix for each n-gram of the respective natural language.