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 conceptual simplicity, straightforward opportunities for separately improving the component models, and a level of performance comparable to similar , non-factored models. Most importantly, unlike other modern parsing models, the factored model admits an extremely effective A* parsing algorithm , which enables efficient, exact inference.

Extracted Key Phrases

6 Figures and Tables

Showing 1-10 of 467 extracted citations
050100'04'06'08'10'12'14'16
Citations per Year

786 Citations

Semantic Scholar estimates that this publication has received between 673 and 920 citations based on the available data.

See our FAQ for additional information.