Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
On the complexity of ID/LP parsing 1
Computational Linguistics
Computational Linguistics
Revised generalized phrase structure grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
A constructive view of GPSG or how to make it work
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Bottom-Up Filtering: a parsing strategy for GPSG
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
An important goal of computational linguistics has been to use linguistic theory to guide the construction of computationally efficient real-world natural language processing systems. At first glance, generalized phrase structure grammar (GPSG) appears to be a blessing on two counts. First, the precise formalisms of GPSG might be a direct and transparent guide for parser design and implementation. Second, since GPSG has weak context-free generative power and context-free languages can be parsed in O(n3) by a wide range of algorithms, GPSG parsers would appear to run in polynomial time. This widely-assumed GPSG "efficient parsability" result is misleading: here we prove that the universal recognition problem for current GPSG theory is exponential-polynomial time hard, and assuredly intractable. The paper pinpoints sources of complexity (e.g. metarules and the theory of syntactic features) in the current GPSG theory and concludes with some linguistically and computationally motivated restrictions on GPSG.