A Computational Account of Some Constraints on Language

this paper will show that the structure of the grammar interpreter constrains its operation in sucl a way that, by and large, grammar rules cannot parse sentences wlich violate either.the Specified Subject Constraint or the Subjacency. Principle. The component of the grammar interpreter upon which tiffs result principally depends is motivated by the Determinism Hypothesis; this resttit thus provides indirect evidence for the hypothesis. This result also depends upon the use within a computational framework of the closely related notions of annotated surface structure and trace theory, which also derive from Chomsky's recent wor