Fast Statistical Parsing with Parallel Multiple Context-Free Grammars
2014pp. 368–376
Citations Over TimeTop 10% of 2014 papers
Abstract
We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by We show that the new algorithm is several times faster than other statistical PMCFG parsing algorithms on real-sized grammars. At the same time the algorithm is more general since it supports non-binarized and non-linear grammars.
Related Papers
- → A CKY parser for picture grammars(2007)10 cited
- Partially ordered multiset context-free grammars and free-word-order parsing(2003)
- → Computational aspects of M-grammars(1991)
- → Parsing Reflective Grammars(2011)