Accurate unlexicalized parsing

Citations Over TimeTop 1% of 2003 papers

Abstract

We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar. Indeed, its performance of 86.36% (LP/LR F1) is better than that of early lexicalized PCFG models, and surprisingly close to the current state-of-the-art. This result has potential uses beyond establishing a strong lower bound on the maximum possible accuracy of unlexicalized models: an unlexicalized PCFG is much more compact, easier to replicate, and easier to interpret than more complex lexical models, and the parsing algorithms are simpler, more widely understood, of lower asymptotic complexity, and easier to optimize.

Related Papers

• → Annotation schemes and their influence on parsing results(2006)19 cited
• → Wide Coverage Incremental Parsing by Learning Attachment Preferences(2001)17 cited
• Utilizing State-of-the-art Parsers to Diagnose Problems in Treebank Annotation for a Less Resourced Language(2013)
• Interactive predictive parsing framework for the Spanish language(2010)
• → Exploiting Diversity in Natural Language Processing: Combining Parsers(2000)106 cited