<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="heinecke-2020-hybrid">
    <titleInfo>
        <title>Hybrid Enhanced Universal Dependencies Parsing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Johannes</namePart>
        <namePart type="family">Heinecke</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2020-jul</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Online</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This paper describes our system to predict enhanced dependencies for Universal Dependencies (UD) treebanks, which ranked 2nd in the Shared Task on Enhanced Dependency Parsing with an average ELAS of 82.60%. Our system uses a hybrid two-step approach. First, we use a graph-based parser to extract a basic syntactic dependency tree. Then, we use a set of linguistic rules which generate the enhanced dependencies for the syntactic tree. The application of these rules is optimized using a classifier which predicts their suitability in the given context. A key advantage of this approach is its language independence, as rules rely solely on dependency trees and UPOS tags which are shared across all languages.</abstract>
    <identifier type="citekey">heinecke-2020-hybrid</identifier>
    <identifier type="doi">10.18653/v1/2020.iwpt-1.18</identifier>
    <location>
        <url>https://aclanthology.org/2020.iwpt-1.18</url>
    </location>
    <part>
        <date>2020-jul</date>
        <extent unit="page">
            <start>174</start>
            <end>180</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Hybrid Enhanced Universal Dependencies Parsing
%A Heinecke, Johannes
%S Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies
%D 2020
%8 jul
%I Association for Computational Linguistics
%C Online
%F heinecke-2020-hybrid
%X This paper describes our system to predict enhanced dependencies for Universal Dependencies (UD) treebanks, which ranked 2nd in the Shared Task on Enhanced Dependency Parsing with an average ELAS of 82.60%. Our system uses a hybrid two-step approach. First, we use a graph-based parser to extract a basic syntactic dependency tree. Then, we use a set of linguistic rules which generate the enhanced dependencies for the syntactic tree. The application of these rules is optimized using a classifier which predicts their suitability in the given context. A key advantage of this approach is its language independence, as rules rely solely on dependency trees and UPOS tags which are shared across all languages.
%R 10.18653/v1/2020.iwpt-1.18
%U https://aclanthology.org/2020.iwpt-1.18
%U https://doi.org/10.18653/v1/2020.iwpt-1.18
%P 174-180

Markdown (Informal)

[Hybrid Enhanced Universal Dependencies Parsing](https://aclanthology.org/2020.iwpt-1.18) (Heinecke, IWPT 2020)

• Hybrid Enhanced Universal Dependencies Parsing (Heinecke, IWPT 2020)

ACL

• Johannes Heinecke. 2020. Hybrid Enhanced Universal Dependencies Parsing. In Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies, pages 174–180, Online. Association for Computational Linguistics.