Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations

Yash Kankanampati, Joseph Le Roux, Nadi Tomeh, Dima Taji, Nizar Habash

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageUndefined
Title of host publicationProceedings of the 28th International Conference on Computational Linguistics
Place of PublicationBarcelona, Spain (Online)
PublisherInternational Committee on Computational Linguistics
Number of pages12
StatePublished - Dec 1 2020

Cite this