Substring ranking

Introduction
To rank substrings of the cipher text, we look at n-gram counts, symbol repetitions, coverage, homophones, and cosine distances. This ranking may be useful for concentrated attacks on small portions of the cipher text.

Results
The results show the following values:


 * Pos: Position at which the substring appears
 * Substring: The substring of cipher text
 * Reps: The number of symbol repetitions in the substring
 * Coverage: When the substring is decoded, this many characters of the entire cipher text will be decoded.
 * n2: Number of appearances of 2-grams that are known to repeat in the entire cipher text.
 * n3: Number of appearances of 3-grams that are known to repeat in the entire cipher text.
 * n4: Number of appearances of 4-grams that are known to repeat in the entire cipher text.
 * nscore: A combination of the n-gram scores. It is equal to n4+(n3/2)+(n2/4).
 * H: Sum of best brute force homophone scores per distinct symbol in the substring. A high score suggests that the substring contains many symbols that are found in strong homophone cycles.
 * Score: A combined score, formed by a product of Reps, Coverage, nscore, and H.

By default, the tables are sorted in descending order of Score, which shows the highest-ranked substrings at the top.

Click the little arrows in the column headings to sort the table by that column. Repeated clicks toggle between ascending and descending order.