Search
Now showing items 1-2 of 2
GPSG-Recognition is NP-Hard
(1985-03-01)
Proponents of generalized phrase structure grammar (GPSG) cite its weak context-free generative power as proof of the computational tractability of GPSG-Recognition. Since context-free languages (CFLs) can be parsed ...
Parsing and Linguistic Explanation
(1985-04-01)
This article summarizes and extends recent results linking deterministic parsing to observed "locality principles" in syntax. It also argues that grammatical theories based on explicit phrase structure rules are unlikely ...