What is the minimal set of fragments that achieves maximal parse accuracy?

2001/10/24 by Rens Bod
Computer Science · #cs.CL

paper · pdf

published as Proceedings ACL'2001, Toulouse, France · 8 pages

arxiv created 2001/10/24 · arxiv updated 2009/11/30

Abstract

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 precision 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.

Related

• Do All Fragments Count?
• Precision-biased Parsing and High-Quality Parse Selection
• Exploiting Diversity in Natural Language Processing: Combining Parsers
• A Fundamental Algorithm for Dependency Parsing (With Corrections)
• Identifiability and Unmixing of Latent Parse Trees