mlsanityData to 7 Oct 2026

A Conditional Splitting Framework for Efficient Constituency Parsing

arXiv 2106.15760 ↗First posted 30 Jun 2021cs.CL cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

We introduce a generic seq2seq parsing framework that casts constituency parsing problems (syntactic and discourse parsing) into a series of conditional splitting decisions. Our parsing model estimates the conditional probability distribution of possible splitting points in a given text span and supports efficient top-down decoding, which is linear in number of nodes. The conditional splitting formulation together with efficient beam search inference facilitate structural consistency without relying on expensive structured inference. Crucially, for discourse analysis we show that in our formulation, discourse segmentation can be framed as a special case of parsing which allows us to perform discourse parsing without requiring segmentation as a pre-requisite. Experiments show that our model achieves good results on the standard syntactic parsing tasks under settings with/without pre-trained representations and rivals state-of-the-art (SoTA) methods that are more computationally expensive than ours. In discourse parsing, our method outperforms SoTA by a good margin.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 33 of its 53 references that are in the map. First posted on arXiv 30 Jun 2021.

Builds on

33 of 53 references.

References · 33

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  4. 2018Deep contextualized word representationscited by 2,285
  5. 2015Pointer Networkscited by 882
  6. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 779
  7. 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
  8. 2018Constituency Parsing with a Self-Attentive Encodercited by 196
  9. 2018Multilingual Constituency Parsing with Self-Attention and Pre-Trainingcited by 117
  10. 2016Recurrent Neural Network Grammarscited by 109
  11. 2014Grammar as a Foreign Languagecited by 70
  12. 2017A Minimal Span-Based Neural Constituency Parsercited by 59
21 more
  1. 2020Fast and Accurate Neural CRF Constituency Parsingcited by 50
  2. 2019Head-Driven Phrase Structure Grammar Parsing on Penn Treebankcited by 43
  3. 2018Stack-Pointer Networks for Dependency Parsingcited by 36
  4. 2018Straight to the Tree: Constituency Parsing with Neural Syntactic Distancecited by 32
  5. 2018Constituent Parsing as Sequence Labelingcited by 26
  6. 2017Effective Inference for Generative Neural Parsingcited by 24
  7. 2018What's Going On in Neural Constituency Parsers? An Analysiscited by 22
  8. 2019Left-to-Right Dependency Parsing with Pointer Networkscited by 21
  9. 2016Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oraclescited by 20
  10. 2020Transition-based Semantic Dependency Parsing with Pointer Networkscited by 16
  11. 2019A Unified Linear-Time Framework for Sentence-Level Discourse Parsingcited by 15
  12. 2016Dependency Parsing as Head Selectioncited by 13
  13. 2020Multilingual Neural RST Discourse Parsingcited by 13
  14. 2020A Top-Down Neural Architecture towards Text-Level Parsing of Discourse Rhetorical Structurecited by 12
  15. 2015Neural CRF Parsingcited by 10
  16. 2019Multi-Task Semantic Dependency Parsing with Policy Gradient for Learning Easy-First Strategiescited by 9
  17. 2020Enriched In-Order Linearization for Faster Sequence-to-Sequence Constituent Parsingcited by 9
  18. 2016Shift-Reduce Constituent Parsing with Neural Lookahead Featurescited by 8
  19. 2020Efficient Constituency Parsing by Pointingcited by 7
  20. 2020A Span-based Linearization for Constituent Treescited by 6
  21. 2017Joint Syntacto-Discourse Parsing and the Syntacto-Discourse Treebankcited by 1

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 4; 2024: 1; 2025: 1.

7 papers.