To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Fast Statistical Parsing … - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Fast Statistical Parsing with Parallel Multiple Context-Free Grammars

Conference paper
Authors Krasimir Angelov
Peter Ljunglöf
Published in EACL'14, 14th Conference of the European Chapter of the Association for Computational Linguistics
Publication year 2014
Published at Department of Computer Science and Engineering, Computing Science (GU)
Language en
Subject categories Language Technology (Computational Linguistics)


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

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?