<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kankanampati-etal-2020-multitask">
    <titleInfo>
        <title>Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Yash</namePart>
        <namePart type="family">Kankanampati</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Joseph</namePart>
        <namePart type="family">Le Roux</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Nadi</namePart>
        <namePart type="family">Tomeh</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Dima</namePart>
        <namePart type="family">Taji</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Nizar</namePart>
        <namePart type="family">Habash</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2020-dec</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 28th International Conference on Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <publisher>International Committee on Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Barcelona, Spain (Online)</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <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.</abstract>
    <identifier type="citekey">kankanampati-etal-2020-multitask</identifier>
    <identifier type="doi">10.18653/v1/2020.coling-main.225</identifier>
    <location>
        <url>https://aclanthology.org/2020.coling-main.225</url>
    </location>
    <part>
        <date>2020-dec</date>
        <extent unit="page">
            <start>2497</start>
            <end>2508</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations
%A Kankanampati, Yash
%A Le Roux, Joseph
%A Tomeh, Nadi
%A Taji, Dima
%A Habash, Nizar
%S Proceedings of the 28th International Conference on Computational Linguistics
%D 2020
%8 dec
%I International Committee on Computational Linguistics
%C Barcelona, Spain (Online)
%F kankanampati-etal-2020-multitask
%X 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.
%R 10.18653/v1/2020.coling-main.225
%U https://aclanthology.org/2020.coling-main.225
%U https://doi.org/10.18653/v1/2020.coling-main.225
%P 2497-2508

Markdown (Informal)

[Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations](https://aclanthology.org/2020.coling-main.225) (Kankanampati et al., COLING 2020)

• Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations (Kankanampati et al., COLING 2020)

ACL

• Yash Kankanampati, Joseph Le Roux, Nadi Tomeh, Dima Taji, and Nizar Habash. 2020. Multitask Easy-First Dependency Parsing: Exploiting Complementarities of Different Dependency Representations. In Proceedings of the 28th International Conference on Computational Linguistics, pages 2497–2508, Barcelona, Spain (Online). International Committee on Computational Linguistics.