Improving Unsupervised Constituency Parsing via Maximizing Semantic Information
Not on the map. Why?
Abstract (arXiv)
Unsupervised constituency parsers organize phrases within a sentence into a tree-shaped syntactic constituent structure that reflects the organization of sentence semantics. However, the traditional objective of maximizing sentence log-likelihood (LL) does not explicitly account for the close relationship between the constituent structure and the semantics, resulting in a weak correlation between LL values and parsing accuracy. In this paper, we introduce a novel objective that trains parsers by maximizing SemInfo, the semantic information encoded in constituent structures. We introduce a bag-of-substrings model to represent the semantics and estimate the SemInfo value using the probability-weighted information metric. We apply the SemInfo maximization objective to training Probabilistic Context-Free Grammar (PCFG) parsers and develop a Tree Conditional Random Field (TreeCRF)-based model to facilitate the training. Experiments show that SemInfo correlates more strongly with parsing accuracy than LL, establishing SemInfo as a better unsupervised parsing objective. As a result, our algorithm significantly improves parsing accuracy by an average of 7.85 sentence-F1 scores across five PCFG variants and in four languages, achieving state-of-the-art level results in three of the four languages.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 48 references that are in the map. First posted on arXiv 3 Oct 2024.
Builds on
19 of 48 references.
References · 19
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
- 2024Large Language Models: A Surveycited by 525
- 2018Mean Field Multi-Agent Reinforcement Learningcited by 207
- 2016Recurrent Neural Network Grammarscited by 109
- 2019Compound Probabilistic Context-Free Grammars for Grammar Inductioncited by 76
- 2023INSTRUCTEVAL: Towards Holistic Evaluation of Instruction-Tuned Large Language Modelscited by 62
- 2017A Minimal Span-Based Neural Constituency Parsercited by 59
- 2017Neural Language Modeling by Jointly Learning Syntax and Lexiconcited by 57
- 2019Unsupervised Recurrent Neural Network Grammarscited by 47
- 2020Visually Grounded Compound PCFGscited by 34
- 2020StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modelingcited by 33
- 2020Unsupervised Parsing via Constituency Testscited by 23
7 more
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbolscited by 22
- 2021Neural Bi-Lexicalized PCFG Inductioncited by 18
- 2021Video-aided Unsupervised Grammar Inductioncited by 17
- 2021Improved Latent Tree Induction with Distant Supervision via Span Constraintscited by 6
- 2023Ensemble Distillation for Unsupervised Constituency Parsingcited by 6
- 2023Simple Hardware-Efficient PCFGs with Independent Left and Right Productionscited by 3
- 2024Unsupervised Parsing by Searching for Frequent Word Sequences among Sentences with Equivalent Predicate-Argument Structurescited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Holographic Neural PCFG for Unsupervised Parsingcited by 0
- 2026Holographic Neural PCFG for Unsupervised Parsing9 Jul 2026