Compound Probabilistic Context-Free Grammars for Grammar Induction
ACL (1), pp. 2369-2385, 2019.
We study a formalization of the grammar induction problem that models sentences as being generated by a compound probabilistic context-free grammar. In contrast to traditional formulations which learn a single stochastic grammar, our context-free rule probabilities are modulated by a per-sentence continuous latent variable, which induce...More
PPT (Upload PPT)