Fork me on GitHub
Browse by Topic

More Output

  1. Case Assignment in TSL Syntax: A Case Study

    Vu, Mai Ha, Nazila Shafiei, and Thomas Graf

    Abstract Recent work suggests that the subregular complexity of syntax might be comparable to that of phonology and morphology. More specifically, whereas phonological and morphological dependencies are tier-based strictly local over strings, syntactic dependencies are tier-based strictly …

    read more
  2. A Hidden Consensus: Computational Invariants of Minimalist Syntax

    Graf, Thomas

    Abstract A common sentiment among linguists is that the Minimalist literature features a dazzling array of competing proposals that seem to share little common ground in their technical assumptions. While differences certainly do exist between accounts, a computationally informed perspective reveals a set …

    read more
  3. Models of Adjunction in Minimalist Grammars

    Graf, Thomas

    Abstract Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational …

    read more
  4. Models of Adjunction in Minimalist Grammars

    Graf, Thomas

    Abstract Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational …

    read more
  5. Closure Properties of Minimalist Derivation Tree Languages

    Graf, Thomas

    Abstract Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; Stabler 1997, Stabler & Keenan 2003) are closed under intersection with regular tree languages (Graf 2010). Using a variation of a proof technique devised by Thatcher (1967), I …

    read more
  6. Closure Properties of Minimalist Derivation Tree Languages

    Graf, Thomas

    Abstract Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; Stabler 1997, Stabler & Keenan 2003) are closed under intersection with regular tree languages (Graf 2010). Using a variation of a proof technique devised by Thatcher (1967), I …

    read more

links

contact