Approximating Probabilistic Models as Weighted Finite Automata.
Ananda Theertha SureshBrian RoarkMichael RileyVlad SchogolPublished in: Comput. Linguistics (2021)
Keyphrases
- finite automata
- probabilistic model
- graphical models
- probabilistic automata
- grammatical inference
- deterministic automata
- regular expressions
- bayesian networks
- conditional random fields
- expectation maximization
- tree automata
- hidden variables
- finite automaton
- hidden markov models
- domain specific
- regular languages
- information extraction