Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-15T01:46:00.197Z Has data issue: false hasContentIssue false
  • English
  • Français

Do all fragments count?

Published online by Cambridge University Press:  25 November 2003

RENS BOD
RENS BOD
Affiliation:
School of Computing, University of Leeds, Leeds LS2 9JT, UK Institute for Logic, Language and Computation, University of Amsterdam, Nieuwe Achtergracht 166, 1018 WV Amsterdam, NL e-mail: rens@illc.uva.nl
Get access Rights & Permissions [Opens in a new window]

Abstract

We aim at finding the minimal set of fragments that achieves maximal parse accuracy in Data Oriented Parsing (DOP). Experiments with the Penn Wall Street Journal (WSJ) treebank show that counts of almost arbitrary fragments within parse trees are important, leading to improved parse accuracy over previous models tested on this treebank. We isolate a number of dependency relations which previous models neglect but which contribute to higher accuracy. We show that the history of statistical parsing models displays a tendency towards using more and larger fragments from training data.

Type
Papers
Information
Natural Language Engineering , Volume 9 , Issue 4 , December 2003 , pp. 307 - 323
Copyright
© 2003 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)