Theory of linear and integer programming
Theory of linear and integer programming
Breaking substitution ciphers using a relaxation algorithm
Communications of the ACM
Multilingual text resources at the linguistic data consortium
HLT '94 Proceedings of the workshop on Human Language Technology
Decrypted Secrets: Methods and Maxims of Cryptology
Decrypted Secrets: Methods and Maxims of Cryptology
Unsupervised analysis for decipherment problems
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Probabilistic Methods for a Japanese Syllable Cipher
ICCPOL '09 Proceedings of the 22nd International Conference on Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy
Learning phoneme mappings for transliteration without parallel data
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Bayesian inference for finite-state transducers
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
An exact A* method for deciphering letter-substitution ciphers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Fast, greedy model minimization for unsupervised tagging
COLING '10 Proceedings of the 23rd International Conference on 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
Deciphering foreign language by combining language models and context vectors
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
Large scale decipherment for out-of-domain machine translation
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
| Hi-index | 0.00 |
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees that no decipherment key is overlooked. We carry out extensive empirical experiments showing how decipherment accuracy varies as a function of cipher length and n-gram order. We also make an empirical investigation of Shannon's (1949) theory of uncertainty in decipherment.