@inproceedings{barry-etal-2020-adapt,
    title = "The {ADAPT} Enhanced Dependency Parser at the {IWPT} 2020 Shared Task",
    author = "Barry, James  and
      Wagner, Joachim  and
      Foster, Jennifer",
    editor = "Bouma, Gosse  and
      Matsumoto, Yuji  and
      Oepen, Stephan  and
      Sagae, Kenji  and
      Seddah, Djam{\'e}  and
      Sun, Weiwei  and
      S{\o}gaard, Anders  and
      Tsarfaty, Reut  and
      Zeman, Dan",
    booktitle = "Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies",
    month = jul,
    year = "2020",
    address = "Online",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/ingest_wac_2008/2020.iwpt-1.24/",
    doi = "10.18653/v1/2020.iwpt-1.24",
    pages = "227--235",
    abstract = "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."
}