Back to Results
First PageMeta Content
Substitution cipher / Ciphertext / Cipher / Known-plaintext attack / Unicity distance / Information theory / Cryptanalysis / Vigenère cipher / Affine cipher / Cryptography / Formal sciences / Science


Attacking Decipherment Problems Optimally with Low-Order N-gram Models Sujith Ravi and Kevin Knight University of Southern California Information Sciences Institute Marina del Rey, California 90292
Add to Reading List

Document Date: 2010-06-14 16:48:29


Open Document

File Size: 692,69 KB

Share Result on Facebook

City

Honolulu / Marina del Rey / /

Company

SRI International / John Wiley & Sons / /

/

Facility

Kevin Knight University of Southern California Information Sciences Institute Marina del Rey / /

IndustryTerm

decipherment network / translation systems / few solutions / search-error-free decipherment results / ciphertext network / proper solution / relaxation algorithm / search error / secrecy systems / /

NaturalFeature

Shannon / /

Organization

Defense Advanced Research Projects Agency / University of Southern California Information Sciences Institute Marina / Kevin Knight University of Southern California Information Sciences Institute / Association for Computational Linguistics / /

Person

Thorsten Brants / Alan T. Sherman / Edwin Olson / Rebecca Finch / Thomas Jakobsen / Ashok C. Popat / David Graff / Ravi Ganesan / Franz J. Och / Peng Xu / Nishit Rathod / Frederick Jelinek / Azriel Rosenfeld / Jonathan Graehl / Kenji Yamada / Shmuel Peleg / Claude E. Shannon / Ciprian Chelba / Jeffrey Dean / Alexander Schrijver / Anish Nair / Kevin Knight / Friedrich L. Bauer / /

Position

analytic model / /

ProvinceOrState

California / /

PublishedMedium

Computational Linguistics / /

Region

Southern California / /

Technology

speech recognition / Human Language Technology / Natural Language Processing / machine translation / relaxation algorithm / secret key / EM algorithm / /

SocialTag