Decipherment

task ID: decipherment

Related Papers

Simple Effective Decipherment via Combinatorial Optimization

Authors: nan

Publication: TIPSTER (2011)

DOI: nan

We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identifica- tion problems. The objective simultaneously scores a matching between two alphabets …...

44392

Beyond Parallel Data: Joint Word Alignment and Decipherment Improves Machine Translation

Authors: nan

Publication: TIPSTER (2014)

DOI: nan

Inspired by previous work, where decipher- ment is used to improve machine translation, we propose a new idea to combine word align- ment and decipherment into a single learning process. …...

34692

Solving Substitution Ciphers with Combined Language Models

Authors: nan

Publication: TIPSTER (2014)

DOI: nan

We propose a novel approach to deciphering short monoalphabetic ciphers that combines both character-level and word-level language models. We formulate decipherment as tree search, and use Monte Carlo Tree Search …...

5631

Neural Decipherment via Minimum-Cost Flow: From Ugaritic to Linear B

Authors: nan

Publication: TIPSTER (2019)

DOI: nan

AbstractIn this paper we propose a novel neural approach for automatic decipherment of lost languages. To compensate for the lack of strong supervision signal, our model design is informed by …...

39658

Can Sequence-to-Sequence Models Crack Substitution Ciphers?

Authors: nan

Publication: TIPSTER (2021)

DOI: nan

AbstractDecipherment of historical ciphers is a challenging problem. The language of the target plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art decipherment methods use beam …...

7999

Decipherment as Regression: Solving Historical Substitution Ciphers by Learning Symbol Recurrence Relations

Authors: nan

Publication: TIPSTER (2023)

DOI: nan

AbstractSolving substitution ciphers involves mapping sequences of cipher symbols to fluent text in a target language. This has conventionally been formulated as a search problem, to find the decipherment key …...

33301