<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="kiefer-krieger-2000-context">
    <titleInfo>
        <title>A Context-free Approximation of Head-driven Phrase Structure Grammar</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Bernd</namePart>
        <namePart type="family">Kiefer</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Hans-Ulrich</namePart>
        <namePart type="family">Krieger</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 present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways , either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations a la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.</abstract>
    <identifier type="citekey">kiefer-krieger-2000-context</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.15</url>
    </location>
    <part>
        <date>2000-feb&quot; 23-25&quot;</date>
        <extent unit="page">
            <start>135</start>
            <end>146</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Context-free Approximation of Head-driven Phrase Structure Grammar
%A Kiefer, Bernd
%A Krieger, Hans-Ulrich
%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 kiefer-krieger-2000-context
%X We present a context-free approximation of unification-based grammars, such as HPSG or PATR-II. The theoretical underpinning is established through a least fixpoint construction over a certain monotonic function. In order to reach a finite fixpoint, the concrete implementation can be parameterized in several ways , either by specifying a finite iteration depth, by using different restrictors, or by making the symbols of the CFG more complex adding annotations a la GPSG. We also present several methods that speed up the approximation process and help to limit the size of the resulting CF grammar.
%U https://aclanthology.org/2000.iwpt-1.15
%P 135-146

Markdown (Informal)

[A Context-free Approximation of Head-driven Phrase Structure Grammar](https://aclanthology.org/2000.iwpt-1.15) (Kiefer & Krieger, IWPT 2000)

• A Context-free Approximation of Head-driven Phrase Structure Grammar (Kiefer & Krieger, IWPT 2000)

ACL

• Bernd Kiefer and Hans-Ulrich Krieger. 2000. A Context-free Approximation of Head-driven Phrase Structure Grammar. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 135–146, Trento, Italy. Association for Computational Linguistics.