Probabilistic Robust Parsing with Parallel Multiple Context-Free Grammars

We present an algorithm for incremental statistical parsing with Parallel Multiple Context-Free Grammars (PMCFG). This is an extension of the algorithm in \citet{angelov09:incremental-parser} to which we added statistical ranking and robustness. The new algorithm preserves the empirically linear complexity of the parser, and it continues to support erasing and reduplication in the grammar. The extension is important since it make it possible to use the algorithm for parsing with large and ambiguous grammars.