While most work on parsing with PCFGs has focused on local correlations between tree configurations, we attempt to model non-local correlations using a finite mixture of PCFGs. A mixture grammar fit with the EM algorithm shows improvement over a single PCFG, both in parsing accuracy and in test data likelihood. We argue that this improvement comes from the learning of specialized grammars that capture non-local correlations. © 2006 Association for Computational Linguistics.
CITATION STYLE
Petrov, S., Barrett, L., & Klein, D. (2006). Non-local modeling with a mixture of PCFGs. In Proceedings of the Tenth Conference on Computational Natural Language Learning, CoNLL-X (pp. 14–20). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1596276.1596281
Mendeley helps you to discover research relevant for your work.