Contextual Distortion Reveals Constituency: Masked Language Models are Implicit Parsers
Not on the map. Why?
Abstract (arXiv)
Recent advancements in pre-trained language models (PLMs) have demonstrated that these models possess some degree of syntactic awareness. To leverage this knowledge, we propose a novel chart-based method for extracting parse trees from masked language models (LMs) without the need to train separate parsers. Our method computes a score for each span based on the distortion of contextual representations resulting from linguistic perturbations. We design a set of perturbations motivated by the linguistic concept of constituency tests, and use these to score each span by aggregating the distortion scores. To produce a parse tree, we use chart parsing to find the tree with the minimum score. Our method consistently outperforms previous state-of-the-art methods on English with masked LMs, and also demonstrates superior performance in a multilingual setting, outperforming the state of the art in 6 out of 8 languages. Notably, although our method does not involve parameter updates or extensive hyperparameter search, its performance can even surpass some unsupervised parsing methods that require fine-tuning. Our analysis highlights that the distortion of contextual representation resulting from syntactic perturbation can serve as an effective indicator of constituency across languages.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 21 of its 36 references that are in the map. First posted on arXiv 1 Jun 2023.
Builds on
21 of 36 references.
References · 21
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2018Constituency Parsing with a Self-Attentive Encodercited by 196
- 2020Perturbed Masking: Parameter-free Probing for Analyzing and Interpreting BERTcited by 109
- 2018Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networkscited by 101
- 2019Compound Probabilistic Context-Free Grammars for Grammar Inductioncited by 76
- 2019Tree Transformer: Integrating Tree Structures into Self-Attentioncited by 68
- 2019Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoderscited by 60
- 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
9 more
- 2020Are Pre-trained Language Models Aware of Phrases? Simple but Strong Baselines for Grammar Inductioncited by 47
- 2020Unsupervised Parsing via Constituency Testscited by 23
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbolscited by 22
- 2020The Return of Lexical Dependencies: Neural Lexicalized PCFGscited by 19
- 2021Syntactic Perturbations Reveal Representational Correlates of Hierarchical Phrase Structure in Pretrained Language Modelscited by 14
- 2020Heads-up! Unsupervised Constituency Parsing via Self-Attention Headscited by 12
- 2021An Empirical Study of Compound PCFGscited by 6
- 2020Multilingual Chart-based Constituency Parse Extraction from Pre-trained Language Modelscited by 2
- 2022Revisiting the Practical Effectiveness of Constituency Parse Extraction from Pre-trained Language Modelscited by 1
Built on by
Citing papers per year: 2023: 3; 2024: 2; 2025: 1; 2026: 1.
7 papers.
- 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memorycited by 170
- 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
- 2024Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsingcited by 0
- 2025Understanding Syntactic Generalization in Structure-inducing Language Modelscited by 0
- 2026Holographic Neural PCFG for Unsupervised Parsingcited by 0
- 2026Holographic Neural PCFG for Unsupervised Parsing9 Jul 2026
- 2025Understanding Syntactic Generalization in Structure-inducing Language Models11 Aug 2025
- 2024Unsupervised Parsing by Searching for Frequent Word Sequences among Sentences with Equivalent Predicate-Argument Structures18 Apr 2024
- 2024Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing29 Feb 2024
- 2023LLM in a flash: Efficient Large Language Model Inference with Limited Memory12 Dec 2023
- 2023Simple Hardware-Efficient PCFGs with Independent Left and Right Productions23 Oct 2023
- 2023Ensemble Distillation for Unsupervised Constituency Parsing3 Oct 2023