The grammatical basis of linguistic performance: language use and acquisition
The grammatical basis of linguistic performance: language use and acquisition
An efficient context-free parsing algorithm
Communications of the ACM
Toward A Principle-Based Parser
Toward A Principle-Based Parser
Computational complexity and lexical-functional grammar
Computational Linguistics
On the succinctness properties of unordered context-free grammars
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
An LR category-neutral parser with left corner prediction
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Using constraints in a constructive version of GPSG
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
String generating hypergraph grammars with word order restrictions
ICGT'06 Proceedings of the Third international conference on Graph Transformations
| Hi-index | 0.00 |
Modern linguistic theory attributes surface complexity to interacting subsystems of constraints. For instance, the ID/LP grammar formalism separates constraints on immediate dominance from those on linear order. Shieber's (1983) ID/LP parsing algorithm shows how to use ID and LP constraints directly in language processing, without expanding them into an intermediate "object grammar." However, Shieber's purported O(|G|2 n3) runtime bound underestimates the dificulty of ID/LP parsing. ID/LP parsing is actually NP-complete, and the worst-case runtime of Shieber's algorithm is actually exponential in grammar size. The growth of parser data structures causes the difficulty. Some computational and linguistic implications follow: in particular, it is important to note that despite its potential for combinatorial explosion, Shieber's algorithm remains better than the alternative of parsing an expanded object grammar.