<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="ellis-etal-1993-new">
    <titleInfo>
        <title>A New Transformation into Deterministically Parsable Form for Natural Language Grammars</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Nigel</namePart>
        <namePart type="given">R</namePart>
        <namePart type="family">Ellis</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Roberto</namePart>
        <namePart type="family">Garigliano</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Richard</namePart>
        <namePart type="given">G</namePart>
        <namePart type="family">Morgan</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>1993-aug&quot; 10-13&quot;</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Third International Workshop on Parsing Technologies</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Tilburg, Netherlands and Durbuy, Belgium</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Marcus demonstrated that it was possible to construct a deterministic grammar/interpreter for a subset of natural language [Marcus, 1980]. Although his work with PARSIFAL pioneered the field of deterministic natural language parsing, his method has several drawbacks: $\bullet$ The rules and actions in the grammar / interpreter are so embedded that it is difficult to distinguish between them. $\bullet$ The grammar / interpreter is very difficult to construct (the small grammar shown in [Marcus, 1980] took about four months to construct). $\bullet$ The grammar is very difficult to maintain, as a small change may have several side effects. This paper outlines a set of structure transformations for converting a non-deterministic grammar into deterministic form. The original grammar is written in a context free form; this is then transformed to resolve ambiguities.</abstract>
    <identifier type="citekey">ellis-etal-1993-new</identifier>
    <location>
        <url>https://aclanthology.org/1993.iwpt-1.7</url>
    </location>
    <part>
        <date>1993-aug&quot; 10-13&quot;</date>
        <extent unit="page">
            <start>61</start>
            <end>72</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A New Transformation into Deterministically Parsable Form for Natural Language Grammars
%A Ellis, Nigel R.
%A Garigliano, Roberto
%A Morgan, Richard G.
%S Proceedings of the Third International Workshop on Parsing Technologies
%D 1993
%8 aug" 10 13"
%I Association for Computational Linguistics
%C Tilburg, Netherlands and Durbuy, Belgium
%F ellis-etal-1993-new
%X Marcus demonstrated that it was possible to construct a deterministic grammar/interpreter for a subset of natural language [Marcus, 1980]. Although his work with PARSIFAL pioneered the field of deterministic natural language parsing, his method has several drawbacks: $\bullet$ The rules and actions in the grammar / interpreter are so embedded that it is difficult to distinguish between them. $\bullet$ The grammar / interpreter is very difficult to construct (the small grammar shown in [Marcus, 1980] took about four months to construct). $\bullet$ The grammar is very difficult to maintain, as a small change may have several side effects. This paper outlines a set of structure transformations for converting a non-deterministic grammar into deterministic form. The original grammar is written in a context free form; this is then transformed to resolve ambiguities.
%U https://aclanthology.org/1993.iwpt-1.7
%P 61-72

Markdown (Informal)

[A New Transformation into Deterministically Parsable Form for Natural Language Grammars](https://aclanthology.org/1993.iwpt-1.7) (Ellis et al., IWPT 1993)

• A New Transformation into Deterministically Parsable Form for Natural Language Grammars (Ellis et al., IWPT 1993)

ACL

• Nigel R. Ellis, Roberto Garigliano, and Richard G. Morgan. 1993. A New Transformation into Deterministically Parsable Form for Natural Language Grammars. In Proceedings of the Third International Workshop on Parsing Technologies, pages 61–72, Tilburg, Netherlands and Durbuy, Belgium. Association for Computational Linguistics.