BibTeX
@MISC{Søgaard_isvcomputational,
author = {Anders Søgaard and Martin Haulrich},
title = {ISV Computational Linguistics Group},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Parsing performance is typically assumed to correlate with treebank size and morphological complexity [6, 13]. This paper shows that there is a strong correlation between derivation perplexity and performance across morphologically rich and poor languages. Since perplexity is orthogonal to morphological complexity, this questions the importance of morphological complexity. We also show that derivation perplexity can be used to evaluate parsers. The main advantage of derivation perplexity as an evaluation metric is that it measures global aspects of parsers (like counting exact matches), but is still fine-grained enough to derive significant results on small standard test sets (like attachment scores). 1
