4 ms·
If I understand this correctly, saying that vowels tend to be close to vowels is just a special case of using n-grams. If you have a fingerprint with the common
by daivd 16y ago
If I understand this correctly, saying that vowels tend to be close to vowels is just a special case of using n-grams. If you have a fingerprint with the common n-gram distribution for the target language (or even subject), you get an optimization problem where you try to guess the substitutions such that the angle between the fingerprint vectors are minimized.
If it cannot be solved analytically, it seems something like a GA should solve it well.
Is there a standard method for solving substitution cryptos?
- tudorachim 16y agoThere is a much more straightforward and principled way: the Metropolis algorithm (http://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algorithm http://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_alg...). You are basically sampling from the distribution of n-gram likelihoods by following a markov chain. Here is a javascript implementation: http://www.andrew.cmu.edu/user/tachim/page.html http://www.andrew.cmu.edu/user/tachim/page.html
- abecedarius 16y agoSee also http://norvig.com/ngrams/ http://norvig.com/ngrams/ for Python. Random-restart hillclimbing instead of Metropolis.