<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nivre-2003-efficient">
    <titleInfo>
        <title>An Efficient Algorithm for Projective Dependency Parsing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Joakim</namePart>
        <namePart type="family">Nivre</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2003-04</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Eighth International Conference on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">Nancy, France</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This paper presents a deterministic parsing algorithm for projective dependency grammar. The running time of the algorithm is linear in the length of the input string, and the dependency graph produced is guaranteed to be projective and acyclic. The algorithm has been experimentally evaluated in parsing unrestricted Swedish text, achieving an accuracy above 85% with a very simple grammar.</abstract>
    <identifier type="citekey">nivre-2003-efficient</identifier>
    <location>
        <url>https://aclanthology.org/W03-3017/</url>
    </location>
    <part>
        <date>2003-04</date>
        <extent unit="page">
            <start>149</start>
            <end>160</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T An Efficient Algorithm for Projective Dependency Parsing
%A Nivre, Joakim
%S Proceedings of the Eighth International Conference on Parsing Technologies
%D 2003
%8 April
%C Nancy, France
%F nivre-2003-efficient
%X This paper presents a deterministic parsing algorithm for projective dependency grammar. The running time of the algorithm is linear in the length of the input string, and the dependency graph produced is guaranteed to be projective and acyclic. The algorithm has been experimentally evaluated in parsing unrestricted Swedish text, achieving an accuracy above 85% with a very simple grammar.
%U https://aclanthology.org/W03-3017/
%P 149-160

Markdown (Informal)

[An Efficient Algorithm for Projective Dependency Parsing](https://aclanthology.org/W03-3017/) (Nivre, IWPT 2003)

• An Efficient Algorithm for Projective Dependency Parsing (Nivre, IWPT 2003)

ACL

• Joakim Nivre. 2003. An Efficient Algorithm for Projective Dependency Parsing. In Proceedings of the Eighth International Conference on Parsing Technologies, pages 149–160, Nancy, France.