Skip to main content

Probabilistic Methods for a Japanese Syllable Cipher

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5459))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Merialdo, B.: Tagging English text with a probabilistic model. Computational Linguistics 20(2), 155–171 (1994)

    Google Scholar 

  2. Peleg, S., Rosenfeld, A.: Breaking substitution ciphers using a relaxation algorithm. Comm. ACM 22(11), 598–605 (1979)

    Article  Google Scholar 

  3. Olson, E.: Robust dictionary attack of short simple substitution ciphers. Cryptologia 31(4), 332–342 (2007)

    Article  Google Scholar 

  4. Knight, K., Yamada, K.: A computational approach to deciphering unknown scripts. In: Proceedings of the ACL Workshop on Unsupervised Learning in Natural Language Processing (1999)

    Google Scholar 

  5. Knight, K., Nair, A., Rathod, N., Yamada, K.: Unsupervised analysis for decipherment problems. In: Proceedings of the COLING/ACL (2006)

    Google Scholar 

  6. Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society Series 39(4), 1–38 (1977)

    Google Scholar 

  7. Ravi, S., Knight, K.: Attacking decipherment problems optimally with low-order n-gram models. In: Proceedings of the EMNLP (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ravi, S., Knight, K. (2009). Probabilistic Methods for a Japanese Syllable Cipher. In: Li, W., Mollá-Aliod, D. (eds) Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy. ICCPOL 2009. Lecture Notes in Computer Science(), vol 5459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00831-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00831-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00830-6

  • Online ISBN: 978-3-642-00831-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics