Top-down derivation, recursion, and the model of grammar

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    1 Downloads (Pure)

    Abstract

    This article argues that common views on the nature of phrase structure rules (finite-state or of a higher complexity) suffer from an unmotivated and unnecessary hidden assumption, namely that the rules of grammar are fed by a homogeneous set of symbols, the alphabet/numeration. Once it is understood that the symbols in a numeration may themselves be the output of a separate derivation layer, arguments against the finite-state character of the phrase structure rules lose their force.
    Original languageEnglish
    Title of host publicationSyntactic complexity across interfaces
    EditorsAndreas Trotzke, Josef Bayer
    Place of PublicationBerlin
    PublisherDe Gruyter Mouton
    Pages25-42
    Number of pages18
    ISBN (Electronic)978-1-5015-0101-2
    ISBN (Print)978-1-61451-790-0
    DOIs
    Publication statusPublished - 15-Feb-2015
    EventComplex sentences, types of embedding, and recursivity - University of Konstanz, Konstanz, Germany
    Duration: 5-Mar-20126-Mar-2012

    Publication series

    NameInterface Explorations
    PublisherDe Gruyter Mouton
    Volume30
    ISSN (Print)1861-4167

    Conference

    ConferenceComplex sentences, types of embedding, and recursivity
    CountryGermany
    CityKonstanz
    Period05/03/201206/03/2012

    Keywords

    • Syntax
    • Syntactic derivation
    • Merge
    • Top-down derivation
    • finite-state grammar
    • recursion
    • formal grammar
    • merge
    • model of grammar

    Cite this