Incremental Parsing of Parallel Multiple Context-Free Grammars
Paper in proceedings, 2009

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.

Author

Krasimir Angelov

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

12th Conference of the European Chapter of the Association for Computational Linguistics

69-76

Subject Categories

Specific Languages

Computer Science

ISBN

978-193243216-9

More information

Created

10/7/2017