Attacking Decipherment Problems Optimally With Low-Order N-Gram Models

doi 10.3115/1613715.1613819
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computational Linguistics