CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Incremental Parsing of Parallel Multiple Context-Free Grammars

Krasimir Angelov (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
12th Conference of the European Chapter of the Association for Computational Linguistics p. 69-76. (2009)
[Konferensbidrag, refereegranskat]

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.

Denna post skapades 2008-12-24. Senast ändrad 2017-11-16.
CPL Pubid: 82866