Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations
Yash Kankanampati, Joseph Le Roux, Nadi Tomeh, Dima Taji, Nizar Habash
Abstract
In this paper we present a parsing model for projective dependency trees which takes advantage of the existence of complementary dependency annotations which is the case in Arabic, with the availability of CATiB and UD treebanks. Our system performs syntactic parsing according to both annotation types jointly as a sequence of arc-creating operations, and partially created trees for one annotation are also available to the other as features for the score function. This method gives error reduction of 9.9% on CATiB and 6.1% on UD compared to a strong baseline, and ablation tests show that the main contribution of this reduction is given by sharing tree representation between tasks, and not simply sharing BiLSTM layers as is often performed in NLP multitask systems.
BibTeX
@inproceedings{kankanampati-etal-2020-multitask,
title = "Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations",
author = "Kankanampati, Yash and
Le Roux, Joseph and
Tomeh, Nadi and
Taji, Dima and
Habash, Nizar",
editor = "Scott, Donia and
Bel, Nuria and
Zong, Chengqing",
booktitle = "Proceedings of the 28th International Conference on Computational Linguistics",
month = dec,
year = "2020",
address = "Barcelona, Spain (Online)",
publisher = "International Committee on Computational Linguistics",
url = "https://aclanthology.org/2020.coling-main.225/",
doi = "10.18653/v1/2020.coling-main.225",
pages = "2497--2508"
}