Decipherment with a Million Random Restarts

  title={Decipherment with a Million Random Restarts},
  author={Taylor Berg-Kirkpatrick and Dan Klein},
This paper investigates the utility and effect of running numerous random restarts when using EM to attack decipherment problems. We find that simple decipherment models are able to crack homophonic substitution ciphers with high accuracy if a large number of random restarts are used but almost completely fail with only a few random restarts. For particularly difficult homophonic ciphers, we find that big gains in accuracy are to be had by running upwards of 100K random restarts, which we… CONTINUE READING