====== FSAs and FSTs ======

===== Overviews =====
  * Finite state automata (FSAs)
    * [[https://en.wikipedia.org/wiki/Finite-state_machine|Wikipedia - Finite-State Machine]]
    * Lecture: [[https://classes.soe.ucsc.edu/nlp201/Fall20/slides/fsa-notes.pdf|NLP 201 2020 - Oct 8]]
  * Finite state transducers (FSTs)
    * [[https://en.wikipedia.org/wiki/Finite-state_transducer|Wikipedia - Finite-State Transducer]]

===== Papers =====
  * [[https://arxiv.org/pdf/1701.03038.pdf|Argueta & Chiang 2017 - Decoding with Finite-State Transducers on GPUs]]
  * [[https://arxiv.org/pdf/1805.06383.pdf|Argueta & Chiang 2018 - Composing Finite State Transducers on GPUs]]
  * [[https://aclanthology.org/W19-3112.pdf|Suresh et al 2019 - Distilling Weighted Finite Automata from Arbitrary Probabilistic Models]] Talks about converting a neural language model into a WFSA
  * [[https://arxiv.org/pdf/2310.05161.pdf|Svete & Cotterell 2023 - Recurrent Neural Language Models as Probabilistic Finite-state Automata]]

===== Neural Versions =====
  * RNNs can the thought of as the neural version of FSAs, see [[https://arxiv.org/pdf/2004.08500.pdf|Merrill 2020]]

===== Conferences =====
  * [[https://aclanthology.org/venues/fsmnlp/|International Conference on Finite State Methods for Natural Language Processing]]

===== Related Pages =====
  * [[Morphological Analysis]]