@conference {18946,
	title = {Syntactic constraints and efficient parsability},
	series = {ACL {\textquoteright}83},
	year = {1983},
	month = {1983///},
	pages = {119 - 122},
	publisher = {Association for Computational Linguistics},
	organization = {Association for Computational Linguistics},
	address = {Stroudsburg, PA, USA},
	abstract = {A central goal of linguistic theory is to explain why natural languages are the way they are. It has often been supposed that computational considerations ought to play a role in this characterization, but rigorous arguments along these lines have been difficult to come by. In this paper we show how a key "axiom" of certain theories of grammar, Subjacency, can be explained by appealing to general restrictions on on-line parsing plus natural constraints on the rule-writing vocabulary of grammars. The explanation avoids the problems with Marcus{\textquoteright} [1980] attempt to account for the same constraint. The argument is robust with respect to machine implementation, and thus avoids the problems that often arise when making detailed claims about parsing efficiency. It has the added virtue of unifying in the functional domain of parsing certain grammatically disparate phenomena, as well as making a strong claim about the way in which the grammar is actually embedded into an on-line sentence processor.},
	doi = {10.3115/981311.981335},
	url = {http://dx.doi.org/10.3115/981311.981335},
	author = {Berwick,Robert C. and Weinberg, Amy}
}
