Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T08:25:49.315Z Has data issue: false hasContentIssue false

Some notes on the PARC 700 Dependency Bank

Published online by Cambridge University Press:  11 June 2007

TOMAS BY
Affiliation:
Institut für Informatik, Technische Universität München Boltzmannstraße 3, 85748 Garching bei München, Germany e-mail: tomas.by@in.tum.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The PARC 700 dependency bank is a potentially very useful resource for parser evaluation that has, so to speak, a high barrier to entry, because of tokenisation that is quite different from the source of the data, the Penn Treebank, and because there is no representation of word order, producing an uncertainty factor of some 15%. There is also a small, but perhaps not insignificant, number of errors. When using the dependency bank for evaluation, it seems likely that these things will cause inflated counts for mismatches, so to obtain more accurate measurements, it is desirable to eliminate them. The work reported here consists of an automatic conversion of the dependency bank into a Prolog representation where the word order is explicit, as well as graphical representations of the dependency trees for all 700 sentences, automatically generated from the Prolog data. As a side effect of the transformation, errors were detected and corrected. It is hoped that this work will lead to more widespread use of the PARC 700 dependency bank for parser evaluation.

Information

Type
Papers
Copyright
2007 Cambridge University Press