Paper: Fast Statistical Parsing with Parallel Multiple Context-Free Grammars

ACL ID E14-1039
Title Fast Statistical Parsing with Parallel Multiple Context-Free Grammars
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 2014
Authors

We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm by An- gelov (2009) to which we added statisti- cal ranking. We show that the new al- gorithm 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. We also show that if we make the search heuristics non-admissible, the pars- ing speed improves even further, at the risk of returning sub-optimal solutions.