The ADAPT Enhanced Dependency Parser at the IWPT 2020 Shared Task

by   James Barry, et al.

We describe the ADAPT system for the 2020 IWPT Shared Task on parsing enhanced Universal Dependencies in 17 languages. We implement a pipeline approach using UDPipe and UDPipe-future to provide initial levels of annotation. The enhanced dependency graph is either produced by a graph-based semantic dependency parser or is built from the basic tree using a small set of heuristics. Our results show that, for the majority of languages, a semantic dependency parser can be successfully applied to the task of parsing enhanced dependencies. Unfortunately, we did not ensure a connected graph as part of our pipeline approach and our competition submission relied on a last-minute fix to pass the validation script which harmed our official evaluation scores significantly. Our submission ranked eighth in the official evaluation with a macro-averaged coarse ELAS F1 of 67.23 and a treebank average of 67.49. We later implemented our own graph-connecting fix which resulted in a score of 79.53 (language average) or 79.76 (treebank average), which would have placed fourth in the competition evaluation.



There are no comments yet.


page 1

page 2

page 3

page 4


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...

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

We present Køpsala, the Copenhagen-Uppsala system for the Enhanced Unive...

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

In this paper, we address the representation of coordinate constructions...

TGIF: Tree-Graph Integrated-Format Parser for Enhanced UD with Two-Stage Generic- to Individual-Language Finetuning

We present our contribution to the IWPT 2021 shared task on parsing into...

Enhanced Universal Dependency Parsing with Second-Order Inference and Mixture of Training Data

This paper presents the system used in our submission to the IWPT 2020 S...

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

Unsupervised models of dependency parsing typically require large amount...

COMBO: a new module for EUD parsing

We introduce the COMBO-based approach for EUD parsing and its implementa...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.