Weighting Finite-State Transductions With Neural Context

From Finite-State to Inversion Transductions: Toward Unsupervised Bilingual Grammar Induction

Regular transductions with MCFG input syntax

We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-fr…

Tutorial: $\varphi$-Transductions in OpenFst via the Gallic Semiring

OpenFst, a popular finite-state transducer library, supports $\varphi$-transitions but, due to an implementation constraint, they cannot be used with transducers in a straightforward way. In this short tutorial, we descr…

Learning Transductions and Alignments with RNN Seq2seq Models

The paper studies the capabilities of Recurrent-Neural-Network sequence to sequence (RNN seq2seq) models in learning four transduction tasks: identity, reversal, total reduplication, and quadratic copying. These transduc…

The single-use restriction for register automata and transducers over infinite alphabets

This thesis studies the single-use restriction for register automata and transducers over infinite alphabets. The restriction requires that a read-access to a register should have the side effect of destroying its conten…