Compound Probabilistic Context-Free Grammars for Grammar Induction Yoon Kim Chris Dyer Alexander M. Rush Harvard University DeepMind Harvard University Cambridge, MA, USA London, UK Cambridge, MA, USA
[email protected] [email protected] [email protected] Abstract non-parametric models (Kurihara and Sato, 2006; Johnson et al., 2007; Liang et al., 2007; Wang and We study a formalization of the grammar in- Blunsom, 2013), and manually-engineered fea- duction problem that models sentences as be- tures (Huang et al., 2012; Golland et al., 2012) to ing generated by a compound probabilistic context free grammar. In contrast to traditional encourage the desired structures to emerge. formulations which learn a single stochastic We revisit these aforementioned issues in light grammar, our context-free rule probabilities of advances in model parameterization and infer- are modulated by a per-sentence continuous ence. First, contrary to common wisdom, we latent variable, which induces marginal de- find that parameterizing a PCFG’s rule probabil- pendencies beyond the traditional context-free ities with neural networks over distributed rep- assumptions. Inference in this grammar is resentations makes it possible to induce linguis- performed by collapsed variational inference, tically meaningful grammars by simply optimiz- in which an amortized variational posterior is placed on the continuous variable, and the la- ing log likelihood. While the optimization prob- tent trees are marginalized with dynamic pro- lem remains non-convex, recent work suggests gramming. Experiments on English and Chi- that there are optimization benefits afforded by nese show the effectiveness of our approach over-parameterized models (Arora et al., 2018; compared to recent state-of-the-art methods Xu et al., 2018; Du et al., 2019), and we in- for grammar induction from words with neu- deed find that this neural PCFG is significantly ral language models.