Coordinate Constructions in English Enhanced Universal Dependencies: Analysis and Computational Modeling

03/16/2021
by   Stefan Grünewald, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/03/2020

The ADAPT Enhanced Dependency Parser at the IWPT 2020 Shared Task

We describe the ADAPT system for the 2020 IWPT Shared Task on parsing en...
research
07/05/2021

The DCU-EPFL Enhanced Dependency Parser at the IWPT 2021 Shared Task

We describe the DCU-EPFL submission to the IWPT 2021 Shared Task on Pars...
research
05/25/2020

Køpsala: Transition-Based Graph Parsing via Efficient Training and Effective Encoding

We present Køpsala, the Copenhagen-Uppsala system for the Enhanced Unive...
research
11/26/2016

Fill it up: Exploiting partial dependency annotations in a minimum spanning tree parser

Unsupervised models of dependency parsing typically require large amount...
research
09/21/2019

Automatic Weighted Matching Rectifying Rule Discovery for Data Repairing

Data repairing is a key problem in data cleaning which aims to uncover a...
research
06/24/2023

Unsupervised Mapping of Arguments of Deverbal Nouns to Their Corresponding Verbal Labels

Deverbal nouns are nominal forms of verbs commonly used in written Engli...
research
09/02/2019

All Roads Lead to UD: Converting Stanford and Penn Parses to English Universal Dependencies with Multilayer Annotations

We describe and evaluate different approaches to the conversion of gold ...

Please sign up or login with your details

Forgot password? Click here to reset