mlsanityData to 7 Oct 2026

Headed-Span-Based Projective Dependency Parsing

arXiv 2108.04750 ↗First posted 10 Aug 2021cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

We propose a new method for projective dependency parsing based on headed spans. In a projective dependency tree, the largest subtree rooted at each word covers a contiguous sequence (i.e., a span) in the surface order. We call such a span marked by a root word textitheaded span. A projective dependency tree can be represented as a collection of headed spans. We decompose the score of a dependency tree into the scores of the headed spans and design a novel O(n3) dynamic programming algorithm to enable global training and exact inference. Our model achieves state-of-the-art or competitive results on PTB, CTB, and UD. Our code is publicly available at urlhttps://github.com/sustcsonglin/span-based-dependency-parsing.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 28 of its 86 references that are in the map. First posted on arXiv 10 Aug 2021.

Builds on

28 of 86 references.

References · 28

  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. 2015Pointer Networkscited by 882
  5. 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
  6. 2018Constituency Parsing with a Self-Attentive Encodercited by 196
  7. 2017A Minimal Span-Based Neural Constituency Parsercited by 59
  8. 2020Fast and Accurate Neural CRF Constituency Parsingcited by 50
  9. 2020Efficient Second-Order TreeCRF for Neural Dependency Parsingcited by 48
  10. 2019Head-Driven Phrase Structure Grammar Parsing on Penn Treebankcited by 43
  11. 2020Torch-Struct: Deep Structured Prediction Librarycited by 40
  12. 2018Stack-Pointer Networks for Dependency Parsingcited by 36
16 more
  1. 2019Dependency-Guided LSTM-CRF for Named Entity Recognitioncited by 28
  2. 2019Enhancing Machine Translation with Dependency-Aware Self-Attentioncited by 24
  3. 2019Left-to-Right Dependency Parsing with Pointer Networkscited by 21
  4. 2016Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oraclescited by 20
  5. 2020Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinementcited by 20
  6. 2020Second-Order Neural Dependency Parsing with Message Passing and End-to-End Trainingcited by 17
  7. 2021Dependency Parsing as MRC-based Span-Span Predictioncited by 13
  8. 2020Multitask Pointer Network for Multi-Representational Parsingcited by 12
  9. 2020Span-based discontinuous constituency parsing: a family of exact chart-based algorithms with time complexities from O(n^6) down to O(n^3)cited by 11
  10. 2019Hierarchical Pointer Net Parsingcited by 8
  11. 2015Approximation-Aware Dependency Parsing by Belief Propagationcited by 6
  12. 2017Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Setcited by 5
  13. 2021Dependency Parsing with Bottom-up Hierarchical Pointer Networkscited by 5
  14. 2019Recursive Subtree Composition in LSTM-Based Dependency Parsingcited by 4
  15. 2018Global Transition-based Non-projective Dependency Parsingcited by 3
  16. 2019The (Non-)Utility of Structural Features in BiLSTM-based Dependency Parserscited by 3

Built on by

Cited by year

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

11 papers.