Paper: What Is The Minimal Set Of Fragments That Achieves Maximal Parse Accuracy?

ACL ID P01-1010
Title What Is The Minimal Set Of Fragments That Achieves Maximal Parse Accuracy?
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2001
Authors
  • Rens Bod (University of Leeds, Leeds UK; University of Amsterdam, Amsterdam The Netherlands)

We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Expe- riments with the Penn Wall Street Journal 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 (a precis - ion of 90.8% and a recall of 90.6%). We isolate some dependency relations which previous models neglect but which contribute to higher parse accuracy.