On multiple context-free grammars
Theoretical Computer Science
Handbook of formal languages, vol. 3
An efficient context-free parsing algorithm
Communications of the ACM
Journal of Functional Programming
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
IEICE - Transactions on Information and Systems
Parsing linear context-free rewriting systems
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Grammatical framework web service
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
PGF: A Portable Run-time Format for Type-theoretical Grammars
Journal of Logic, Language and Information
Tools for multilingual grammar-based translation on the web
ACLDemos '10 Proceedings of the ACL 2010 System Demonstrations
Implementing controlled languages in GF
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Translating between language and logic: what is easy and what is difficult
CADE'11 Proceedings of the 23rd international conference on Automated deduction
DynGenPar: a dynamic generalized parser for common mathematical language
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Controlled language for everyday use: the MOLTO phrasebook
CNL'10 Proceedings of the Second international conference on Controlled Natural Language
| Hi-index | 0.00 |
Parallel Multiple Context-Free Grammar (PMCFG) is an extension of context-free grammar for which the recognition problem is still solvable in polynomial time. We describe a new parsing algorithm that has the advantage to be incremental and to support PMCFG directly rather than the weaker MCFG formalism. The algorithm is also top-down which allows it to be used for grammar based word prediction.