Browse by Topic

More Output

  1. Lost in Translation: A Formal Model of Merge-over-Move and Its Implications for the Language Faculty

    Graf, Thomas

    Abstract I demonstrate that Merge-over-Move (MOM), a transderivational constraint (TC) put forward in Chomsky (1995, 2000), can be modeled by linear tree transducers, i.e.\ machines that take a tree as input and traverse it from the leaves towards the root while at …

    read more
  2. Reference-Set Computation = Minimalism + Transformational Rules?

    Graf, Thomas

    Abstract Transderivational constraints (TC) formed an integral part of the early Minimalist Program. I develop a formal model of TCs firmly rooted in automata theory and subsequently argue that

    • in general, TCs aren’t computationally intractable, nor does their complexity exceed that of …
    read more
  3. Efficient Computation at the Interfaces

    Graf, Thomas

    Files [pdf] [code]

      author    = {Graf, Thomas},
      title     = {Efficient Computation at the Interfaces},
      year      = {2010},
      note      = {Poster presented at On Linguistic Interfaces II (OnLI II),
              December 2--4, 2010, University of Ulster, Belfast, United
    read more
  4. A Tree Transducer Model of Reference-Set Computation

    Graf, Thomas

    Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

    read more