Unsupervised Learning of Syntactic Structure with Invertible Neural Projections
Not on the map. Why?
Abstract (arXiv)
Unsupervised learning of syntactic structure is typically performed using generative models with discrete latent variables and multinomial parameters. In most cases, these models have not leveraged continuous word representations. In this work, we propose a novel generative model that jointly learns discrete syntactic structure and continuous word representations in an unsupervised fashion by cascading an invertible neural network with a structured generative prior. We show that the invertibility condition allows for efficient exact inference and marginal likelihood computation in our model so long as the prior is well-behaved. In experiments we instantiate our approach with both Markov and tree-structured priors, evaluating on two tasks: part-of-speech (POS) induction, and unsupervised dependency parsing without gold POS annotation. On the Penn Treebank, our Markov-structured model surpasses state-of-the-art results on POS induction. Similarly, we find that our tree-structured model achieves state-of-the-art performance on unsupervised dependency parsing for the difficult training condition where neither gold POS annotation nor punctuation-based constraints are available.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 4; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
11 papers.
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbolscited by 22
- 2021On the Inductive Bias of Masked Language Modeling: From Statistical to Syntactic Dependenciescited by 18
- 2021Neural Bi-Lexicalized PCFG Inductioncited by 18
- 2023Visual Dependency Transformers: Dependency Tree Emerges from Reversed Attentioncited by 12
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGscited by 10
- 2022Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammarscited by 7
- 2021Dependency Induction Through the Lens of Visual Perceptioncited by 2
- 2022Bridging Pre-trained Language Models and Hand-crafted Features for Unsupervised POS Taggingcited by 1
- 2026A Blueprint for Equilibrium-Based Differentiable Continuous-Variable Thermodynamic Computingcited by 1
- 2021Variational Gaussian Topic Model with Invertible Neural Projectionscited by 0
- 2022Masked Part-Of-Speech Model: Does Modeling Long Context Help Unsupervised POS-tagging?cited by 0
- 2026A Blueprint for Equilibrium-Based Differentiable Continuous-Variable Thermodynamic Computing17 Jul 2026
- 2023Visual Dependency Transformers: Dependency Tree Emerges from Reversed Attention6 Apr 2023
- 2022Unsupervised Discontinuous Constituency Parsing with Mildly Context-Sensitive Grammars18 Dec 2022
- 2022Masked Part-Of-Speech Model: Does Modeling Long Context Help Unsupervised POS-tagging?30 Jun 2022
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGs1 May 2022
- 2022Bridging Pre-trained Language Models and Hand-crafted Features for Unsupervised POS Tagging19 Mar 2022
- 2021Dependency Induction Through the Lens of Visual Perception20 Sep 2021
- 2021Neural Bi-Lexicalized PCFG Induction31 May 2021
- 2021Variational Gaussian Topic Model with Invertible Neural Projections21 May 2021
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbols28 Apr 2021
- 2021On the Inductive Bias of Masked Language Modeling: From Statistical to Syntactic Dependencies12 Apr 2021