Accurate Unlexicalized Parsing-英文文献.pdf

Accurate Unlexicalized Parsing Dan Klein Christopher D. Manning Computer Science Department Computer Science Department Stanford University Stanford University Stanford, CA 94305-9040 Stanford, CA 94305-9040 klein@ manning@ Abstract mance of an unlexicalized PCFG over the Penn tree- bank could be improved enormously simply by an- We demonstrate that an unlexicalized PCFG can notating each node by its parent category. The Penn parse much more accurately than previously shown, treebank covering PCFG is a poor tool for parsing be- by making use of simple, linguistically motivated state splits, which break down false independence cause the context-freedom assumptions it embodies assumptions latent in a vanilla treebank grammar. are far too strong, and weakening them in this way Indeed, its performance of 86.36% (LP/LR F ) is 1 makes the model much better. More recently, Gildea better than that of early lexicalized PCFG models, (2001) discusses how taking the bilexical probabil- and surprisingly close to the current state-of-the- art. This result has potential uses beyond establish- ities out of a good current lexicalized PCFG parser ing a strong lower bound on the maximum possi- hurts performance hardly at all: by at most 0.5% for ble accuracy of unlexicalized model