2016 (modified: 11 Nov 2022)ICML 2016Readers: Everyone
Abstract:Probabilitic Finite Automata (PFA) are generative graphical models that define distributions with latent variables over finite sequences of symbols, a.k.a. stochastic languages. Traditionally, unsu...