Abstract
We propose the design of deterministic constituent parsers that choose parser actions according to the probabilities of parses of a given probabilistic context-free grammar. Several variants are presented. One of these deterministically constructs a parse structure while postponing commitment to labels. We investigate theoretical time complexities and report experiments. © 2014 Association for Computational Linguistics.
Cite
CITATION STYLE
Nederhof, M. J., & McCaffery, M. (2014). Deterministic parsing using PCFGs. In 14th Conference of the European Chapter of the Association for Computational Linguistics 2014, EACL 2014 (pp. 338–347). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/e14-1036
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
