Sciweavers

ACL
2001

What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?

13 years 5 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments 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.
Rens Bod
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2001
Where ACL
Authors Rens Bod
Comments (0)