A status report on the LRC machine
ANLC '83 Proceedings of the first conference on Applied natural language processing
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Syntactic and semantic parsability
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd 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
Development in parsing technology: from theory to application
New developments in parsing technology
Phrase structure grammars and natural languages
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
A new kind of finite-state automaton: register vector grammar
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.00 |
Context-free grammars, far from having insufficient expressive power for the description of human languages, may be overly powerful, along three dimensions; (i) weak generative capacity: there exists an interesting proper subset of the CFL's, the profligate CFL's, within which no human language appears to fall; (2) strong generative capacity: human languages can be appropriately described in terms of a proper subset of the CF-PSG's, namely those with the ECPO property; (3) time complexity: the recent controversy about the importance of a low deterministic polynomial time bound on the recognition problem for human languages is misdirected, since an appropriately restrictive theory would guarantee even more, namely a linear bound.