期刊名称：Conference on European Chapter of the Association for Computational Linguistics (EACL)
出版年度：2009
卷号：2009
出版社：ACL Anthology
摘要：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.
