<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="tendeau-1997-earley">
    <titleInfo>
        <title>An Earley Algorithm for Generic Attribute Augmented Grammars and Applications</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Frederic</namePart>
        <namePart type="family">Tendeau</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1997-sep&quot; 17-20&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Fifth International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Boston/Cambridge, Massachusetts, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.</abstract>
    <identifier type="citekey">tendeau-1997-earley</identifier>
    <location>
        <url>https://aclanthology.org/1997.iwpt-1.23</url>
    </location>
    <part>
        <date>1997-sep&quot; 17-20&quot;</date>
        <extent unit="page">
            <start>199</start>
            <end>209</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T An Earley Algorithm for Generic Attribute Augmented Grammars and Applications
%A Tendeau, Frederic
%S Proceedings of the Fifth International Workshop on Parsing Technologies
%D 1997
%8 sep" 17 20"
%I Association for Computational Linguistics
%C Boston/Cambridge, Massachusetts, USA
%F tendeau-1997-earley
%X We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.
%U https://aclanthology.org/1997.iwpt-1.23
%P 199-209

Markdown (Informal)

[An Earley Algorithm for Generic Attribute Augmented Grammars and Applications](https://aclanthology.org/1997.iwpt-1.23) (Tendeau, IWPT 1997)

• An Earley Algorithm for Generic Attribute Augmented Grammars and Applications (Tendeau, IWPT 1997)

ACL

• Frederic Tendeau. 1997. An Earley Algorithm for Generic Attribute Augmented Grammars and Applications. In Proceedings of the Fifth International Workshop on Parsing Technologies, pages 199–209, Boston/Cambridge, Massachusetts, USA. Association for Computational Linguistics.