Paper: Binding Constraints As Instructions Of Binding Machines

ACL ID C00-1016
Title Binding Constraints As Instructions Of Binding Machines
Venue International Conference on Computational Linguistics
Session Main Conference
Year 2000
Authors

Binding constraints have resisted to be fully integrated into the course of grammatical processing despite its practical relevance and cross-linguistic generality. The ultimate root for this is to be found in the exponential "overgenerate & filter" procedure of the mainstream rationale for their satisfaction. In this paper we design an alternative approach based on the view that nominals are binding machines.