Probabilistic Methods for a Japanese Syllable Cipher

Authors:
Sujith Ravi;Kevin Knight
Affiliations:
Information Sciences Institute, Computer Science Department, University of Southern California, Marina del Rey 90292;Information Sciences Institute, Computer Science Department, University of Southern California, Marina del Rey 90292
Venue:
ICCPOL '09 Proceedings of the 22nd International Conference on Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy
Year:
2009

Citing 5
Cited 1

Breaking substitution ciphers using a relaxation algorithm

Communications of the ACM
Tagging English text with a probabilistic model

Computational Linguistics
Unsupervised analysis for decipherment problems

COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Robust Dictionary Attack of Short Simple Substitution Ciphers

Cryptologia
Attacking decipherment problems optimally with low-order N-gram models

EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper attacks a Japanese syllable-substitution cipher. We use a probabilistic, noisy-channel framework, exploiting various Japanese language models to drive the decipherment. We describe several innovations, including a new objective function for searching for the highest-scoring decipherment. We include empirical studies of the relevant phenomena, and we give improved decipherment accuracy rates.