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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Toward A Principle-Based Parser
Toward A Principle-Based Parser
Computational complexity and lexical-functional grammar
Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Practical parsing of generalized phrase structure grammars
Computational Linguistics
Extending context-free grammars with permutation phrases
ACM Letters on Programming Languages and Systems (LOPLAS)
The complexity of recognition of linguistically adequate dependency grammars
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Computational complexity of current GPSG theory
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Revised generalized phrase structure grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Processing word order variation within a modified ID/LP framework
COLING '86 Proceedings of the 11th coference on Computational linguistics
A chart-based method of ID/LP parsing with generalized discrimination networks
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Loosely tree-based alignment for machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
A probabilistic plan recognition algorithm based on plan tree grammars
Artificial Intelligence
On natural language processing and plan recognition
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Semantic tagging of web search queries
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar
Computational Linguistics
Recognizing shuffled languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Plan recognition in exploratory domains
Artificial Intelligence
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. An ID/LP parsing algorithm by Shieber shows how to use ID and LP constraints directly in language processing, without expanding them into an intermediate context-free "object grammar". However, Shieber's purported runtime bound underestimates the difficulty 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.