DMCA
PCFG Models of Linguistic Tree Representations (1998)
Cached
Download Links
| Venue: | Computational Linguistics |
| Citations: | 253 - 9 self |
BibTeX
@ARTICLE{Johnson98pcfgmodels,
author = {Mark Johnson},
title = {PCFG Models of Linguistic Tree Representations},
journal = {Computational Linguistics},
year = {1998},
volume = {24},
pages = {613--632}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper points out that the Penn lI treebank representations are of the kind predicted to have such an effect, and describes a simple node relabeling transformation that improves a treebank PCFG-based parser's average precision and recall by around 8%, or approximately half of the performance difference between a simple PCFG model and the best broad-coverage parsers available today. This performance variation comes about because any PCFG, and hence the corpus of trees from which the PCFG is induced, embodies independence assumptions about the distribution of words and phrases. The particular independence assumptions implicit in a tree representation can be studied theoretically and investigated empirically by means of a tree transformation / detransformation process
Keyphrases
linguistic tree representation pcfg model average precision performance difference tree representation penn li treebank representation broad-coverage parser available today performance variation particular independence assumption tree transformation detransformation process treebank pcfg-based parser simple pcfg model simple node
