Paper: On Parsing Strategies And Closure

ACL ID P80-1028
Title On Parsing Strategies And Closure
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1980
Authors

point of view. It will be assumed that there is ultimately a single processing machine with its multiple characterizations (the ideal and the real components). The processor does not literally apply ideal rules of competence for lack of ideal TM resources, but rather, it resorts to more realistic approximations. Exactly where the idealizations call for inordinate resources, we should expect to find empirical discrepancies between competence and performance. A F5 processor is unable to parse complex sentences even though they may be grammatical. We claim these complex sentences are unacceptable. Which constructions are in principle beyond the capabilities of a finite state machine? Chomsky and Bar-Hillel independently showed that (arbitrarily deep) center-embedded structures require unbound...