Weighted FSAs and FSTs

Weighted FSAs are the weighted generalizations of FSAs and FSTs.

• Mohri et al 2001 - Weighted Finite-State Transducers in Speech Recognition
• Eisner 2002 - Parameter Estimation for Probabilistic Finite-State Transducers

• Dreyer et al 2008 - Latent-Variable Modeling of String Transductions with Finite-State Methods
• Dreyer et al 2009 - Graphical Models over Multiple Strings

• Rastogi et al 2016 - Weighting Finite-State Transductions With Neural Context
• Schwartz 2018 - SoPa Bridging CNNs, RNNs, and Weighted Finite-State Machines
• Lin et al 2019 - Neural Finite State Transducers: Beyond Rational Relations
• Hannun et al 2020 - Differentiable Weighted Finite-State Transducers
• Marzouk et al 2020 - Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results
• Jiang et al 2020 - Cold-Start and Interpretability: Turning Regular Expressions into Trainable Recurrent Neural Networks
• Svete et al 2023 - Algorithms for Acyclic Weighted Finite-State Automata with Failure Arcs

• Weiss et al 2019 - Learning Deterministic Weighted Automata with Queries and Counterexamples

• Recurrent Neural Networks