<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="harkema-2000-recognizer">
    <titleInfo>
        <title>A Recognizer for Minimalist Grammars</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Henk</namePart>
        <namePart type="family">Harkema</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2000-feb 23-25</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>Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.</abstract>
    <identifier type="citekey">harkema-2000-recognizer</identifier>
    <location>
        <url>https://aclanthology.org/2000.iwpt-1.13</url>
    </location>
    <part>
        <date>2000-feb 23-25</date>
        <extent unit="page">
            <start>111</start>
            <end>122</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A Recognizer for Minimalist Grammars
%A Harkema, Henk
%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 harkema-2000-recognizer
%X Minimalist Grammars are a rigorous formalization of the sort of grammars proposed in the linguistic framework of Chomsky’s Minimalist Program. One notable property of Minimalist Grammars is that they allow constituents to move during the derivation of a sentence, thus creating discontinuous constituents. In this paper we will present a bottom-up parsing method for Minimalist Grammars, prove its correctness, and discuss its complexity.
%U https://aclanthology.org/2000.iwpt-1.13
%P 111-122

Markdown (Informal)

[A Recognizer for Minimalist Grammars](https://aclanthology.org/2000.iwpt-1.13) (Harkema, IWPT 2000)

• A Recognizer for Minimalist Grammars (Harkema, IWPT 2000)

ACL

• Henk Harkema. 2000. A Recognizer for Minimalist Grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies, pages 111–122, Trento, Italy. Association for Computational Linguistics.