Fast Exact Inference with a Factored Model for Natural Language Parsing
Abstract
We present a novel generative model for natural language tree structures in which semantic (lexical dependency) and syntactic (PCFG) structures are scored with separate models. This factorization provides concep- tual simplicity, straightforward opportunities for separately improving the component models, and a level of performance comparable to simi- lar, non-factored models. Most importantly, unlike other modern parsing models, the factored model admits an extremely effective A* parsing al- gorithm, which enables efficient, exact inference.
Cite
Text
Klein and Manning. "Fast Exact Inference with a Factored Model for Natural Language Parsing." Neural Information Processing Systems, 2002.Markdown
[Klein and Manning. "Fast Exact Inference with a Factored Model for Natural Language Parsing." Neural Information Processing Systems, 2002.](https://mlanthology.org/neurips/2002/klein2002neurips-fast/)BibTeX
@inproceedings{klein2002neurips-fast,
title = {{Fast Exact Inference with a Factored Model for Natural Language Parsing}},
author = {Klein, Dan and Manning, Christopher D.},
booktitle = {Neural Information Processing Systems},
year = {2002},
pages = {3-10},
url = {https://mlanthology.org/neurips/2002/klein2002neurips-fast/}
}