Incremental Parsing of Parallel Multiple Context-Free Grammars
Paper i proceeding, 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.


Krasimir Angelov

Chalmers, Data- och informationsteknik, Datavetenskap

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



Studier av enskilda språk

Datavetenskap (datalogi)