Proceedings of the 10th annual conference on Genetic and evolutionary computation
Attacking decipherment problems optimally with low-order N-gram models
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Natural Language Processing with Python
Natural Language Processing with Python
An exact A* method for deciphering letter-substitution ciphers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Bayesian inference for Zodiac and other homophonic ciphers
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
| Hi-index | 0.00 |
There has been recent interest in the problem of decoding letter substitution ciphers using techniques inspired by natural language processing. We consider a different type of classical encoding scheme known as the running key cipher, and propose a search solution using Gibbs sampling with a word language model. We evaluate our method on synthetic cipher-texts of different lengths, and find that it outperforms previous work that employs Viterbi decoding with character-based models.