Нелексифицированный парсер PCFG

We present a novel approach for find- ing discontinuities that outperforms pre- viously published results on this task. Rather than using a deeper grammar for- malism, our system combines a …...

This paper defines a generative probabilis- tic model of parse trees, which we call PCFG-LA. This model is an extension of PCFG in which non-terminal symbols are augmented with latent …...