Coordinate Constructions in English Enhanced Universal Dependencies: Analysis and Computational Modeling
Not on the map. Why?
Abstract (arXiv)
In this paper, we address the representation of coordinate constructions in Enhanced Universal Dependencies (UD), where relevant dependency links are propagated from conjunction heads to other conjuncts. English treebanks for enhanced UD have been created from gold basic dependencies using a heuristic rule-based converter, which propagates only core arguments. With the aim of determining which set of links should be propagated from a semantic perspective, we create a large-scale dataset of manually edited syntax graphs. We identify several systematic errors in the original data, and propose to also propagate adjuncts. We observe high inter-annotator agreement for this semantic annotation task. Using our new manually verified dataset, we perform the first principled comparison of rule-based and (partially novel) machine-learning based methods for conjunction propagation for English. We show that learning propagation rules is more effective than hand-designing heuristic rules. When using automatic parses, our neural graph-parser based edge predictor outperforms the currently predominant pipelinesusing a basic-layer tree parser plus converters.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 12 of its 34 references that are in the map. First posted on arXiv 16 Mar 2021.
Builds on
12 of 34 references.
References · 12
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2019BERT Rediscovers the Classical NLP Pipelinecited by 1,059
- 2016Deep Biaffine Attention for Neural Dependency Parsingcited by 334
- 201975 Languages, 1 Model: Parsing Universal Dependencies Universallycited by 90
- 2018Simpler but More Accurate Semantic Dependency Parsingcited by 46
- 2019Universal Dependency Parsing from Scratchcited by 46
- 2020ConjNLI: Natural Language Inference Over Conjunctive Sentencescited by 27
- 2020Efficient EUD Parsingcited by 8
- 2020Enhanced Universal Dependency Parsing with Second-Order Inference and Mixture of Training Datacited by 5
- 2018Sentences with Gapping: Parsing and Reconstructing Elided Predicatescited by 4
- 2020Kopsala: Transition-Based Graph Parsing via Efficient Training and Effective Encodingcited by 4
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 1.
4 papers.
- 2023MUX-PLMs: Data Multiplexing for High-throughput Language Modelscited by 4
- 2021TGIF: Tree-Graph Integrated-Format Parser for Enhanced UD with Two-Stage Generic- to Individual-Language Finetuningcited by 3
- 2021Cross-linguistically Consistent Semantic and Syntactic Annotation of Child-directed Speechcited by 3
- 2021Transition-based Bubble Parsing: Improvements on Coordination Structure Predictioncited by 0
- 2023MUX-PLMs: Data Multiplexing for High-throughput Language Models24 Feb 2023
- 2021Cross-linguistically Consistent Semantic and Syntactic Annotation of Child-directed Speech22 Sep 2021
- 2021TGIF: Tree-Graph Integrated-Format Parser for Enhanced UD with Two-Stage Generic- to Individual-Language Finetuning14 Jul 2021
- 2021Transition-based Bubble Parsing: Improvements on Coordination Structure Prediction14 Jul 2021