mlsanityData to 14 Oct 2026

Unsupervised and Few-shot Parsing from Pretrained Language Models

arXiv 2206.04980 ↗First posted 10 Jun 2022cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Pretrained language models are generally acknowledged to be able to encode syntax [Tenney et al., 2019, Jawahar et al., 2019, Hewitt and Manning, 2019]. In this article, we propose UPOA, an Unsupervised constituent Parsing model that calculates an Out Association score solely based on the self-attention weight matrix learned in a pretrained language model as the syntactic distance for span segmentation. We further propose an enhanced version, UPIO, which exploits both inside association and outside association scores for estimating the likelihood of a span. Experiments with UPOA and UPIO disclose that the linear projection matrices for the query and key in the self-attention mechanism play an important role in parsing. We therefore extend the unsupervised models to few-shot parsing models (FPOA, FPIO) that use a few annotated trees to learn better linear projection matrices for parsing. Experiments on the Penn Treebank demonstrate that our unsupervised parsing model UPIO achieves results comparable to the state of the art on short sentences (length <= 10). Our few-shot parsing model FPIO trained with only 20 annotated trees outperforms a previous few-shot parsing method trained with 50 annotated trees. Experiments on cross-lingual parsing show that both unsupervised and few-shot parsing methods are better than previous methods on most languages of SPMRL [Seddah et al., 2013].

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 51 references that are in the map. First posted on arXiv 10 Jun 2022.

Builds on

24 of 51 references.

References · 24

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
  5. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 1,003
  6. 2018Constituency Parsing with a Self-Attentive Encodercited by 199
  7. 2018Multilingual Constituency Parsing with Self-Attention and Pre-Trainingcited by 117
  8. 2018Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networkscited by 101
  9. 2019Do Attention Heads in BERT Track Syntactic Dependencies?cited by 88
  10. 2019Compound Probabilistic Context-Free Grammars for Grammar Inductioncited by 76
  11. 2019Tree Transformer: Integrating Tree Structures into Self-Attentioncited by 68
  12. 2019Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoderscited by 60
12 more
  1. 2017A Minimal Span-Based Neural Constituency Parsercited by 59
  2. 2017Neural Language Modeling by Jointly Learning Syntax and Lexiconcited by 57
  3. 2019Unsupervised Recurrent Neural Network Grammarscited by 47
  4. 2020Are Pre-trained Language Models Aware of Phrases? Simple but Strong Baselines for Grammar Inductioncited by 47
  5. 2018Straight to the Tree: Constituency Parsing with Neural Syntactic Distancecited by 32
  6. 2020Parsing as Pretrainingcited by 19
  7. 2020On the Role of Supervision in Unsupervised Constituency Parsingcited by 18
  8. 2021Video-aided Unsupervised Grammar Inductioncited by 17
  9. 2017Modeling Source Syntax for Neural Machine Translationcited by 12
  10. 2020Heads-up! Unsupervised Constituency Parsing via Self-Attention Headscited by 12
  11. 2019A Critical Analysis of Biased Parsers in Unsupervised Parsingcited by 7
  12. 2021Synthesizing Context-free Grammars from Recurrent Neural Networks (Extended Version)cited by 2

Built on by

Not cited yet.