Abstract not found

Abstract not found

The goal of this paper is to give a precise, formal account of certain fundamental notions in minimalist syntax, including Merge, Select, Transfer, occurrences, workspace, labels, and convergence. We would like this formalization to be useful to minimalist syntacticians in formulating new proposals and evaluating their own proposals, both conceptually and empirically. We do not attempt to formalize all minimalist analyses that have been proposed in the last two decades. Rather, we focus on widely accepted formulations. Where certain alternatives loom large, we mention them briefly. There are many operations we have not treated for reasons of space, including: head movement, Pair-Merge (adjunction), QR Agree and Feature Inheritance. The framework given in this paper could be extended to incorporate various versions of these operations, which could then be compared rigorously. Our basic approach bears a resemblance to the Minimalist Grammars devised by Stabler (1997) and the work that it has given rise to.1 Those grammars were simplified to facilitate computational assessment, but here we make an effort to stay close to mainstream formulations. We use basic set theory to represent syntactic objects, with standard notation: ∈ (is an element of), ∪ (set union), ⊆ (is a subset of), ⊂ (is a proper subset of). Given any two sets S and T, the set difference S-T={x | x∈S, x∉T}. And S×T is the Cartesian product of S and T, that is, the set of ordered pairs {〈a,b〉 | a∈S,b∈T}. As usual, free variables in definitions are understood to be universally quantified. For example, “W is a workspace iff… ” means the same thing as “For all W, W is a workspace iff…”

In this paper, I argue that the tools and techniques of grammar engineering provide a means to take the development and evaluation of syntactic hypoth-esis testing to a new level. Grammar engineering is the process of creating machine-readable implementations of formal grammars. Traditionally, lin-