Abstract It has been conjectured that all properties of language beyond recursion can be motivated by interface requirements. One component in this setup is the parser, which is thought to give rise to a preference for computational parsimony. I discuss a mathematical result …

# More Output

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

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 …# A Tree Transducer Model of Reference-Set Computation

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 …