<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="elworthy-2000-finite">
    <titleInfo>
        <title>A Finite-state Parser with Dependency Structure Output</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">David</namePart>
        <namePart type="family">Elworthy</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2000-feb&quot; 23-25&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Sixth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Trento, Italy</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We show how to augment a finite-state grammar with annotations which allow dependency structures to be extracted. There are some difficulties in determinising the grammar, which is an essential step for computational efficiency, but they can be overcome. The parser also allows syntactically ambiguous structures to be packed into a single representation.</abstract>
    <identifier type="citekey">elworthy-2000-finite</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.33</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>301</start>
            <end>302</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Finite-state Parser with Dependency Structure Output
%A Elworthy, David
%S Proceedings of the Sixth International Workshop on Parsing Technologies
%D 2000
%8 feb" 23 25"
%I Association for Computational Linguistics
%C Trento, Italy
%F elworthy-2000-finite
%X We show how to augment a finite-state grammar with annotations which allow dependency structures to be extracted. There are some difficulties in determinising the grammar, which is an essential step for computational efficiency, but they can be overcome. The parser also allows syntactically ambiguous structures to be packed into a single representation.
%U https://aclanthology.org/2000.iwpt-1.33
%P 301-302

Markdown (Informal)

[A Finite-state Parser with Dependency Structure Output](https://aclanthology.org/2000.iwpt-1.33) (Elworthy, IWPT 2000)

• A Finite-state Parser with Dependency Structure Output (Elworthy, IWPT 2000)

ACL

• David Elworthy. 2000. A Finite-state Parser with Dependency Structure Output. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 301–302, Trento, Italy. Association for Computational Linguistics.