Distilling weighted finite automata from arbitrary probabilistic models.
Ananda Theertha SureshBrian RoarkMichael RileyVlad SchogolPublished in: FSMNLP (2019)
Keyphrases
- finite automata
- probabilistic model
- graphical models
- probabilistic automata
- regular expressions
- grammatical inference
- deterministic automata
- tree automata
- conditional random fields
- regular languages
- expectation maximization
- hidden markov models
- bayesian networks
- finite automaton
- data mining
- hidden variables
- data warehouse
- data analysis