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

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

2001-10-24

arxiv.org/abs/cs/0110050v1

Proceedings ACL'2001, Toulouse, France

Computer Science

Computation and Language

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

What is the minimal set of fragments that achieves maximal parse accuracy? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with What is the minimal set of fragments that achieves maximal parse accuracy?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and What is the minimal set of fragments that achieves maximal parse accuracy? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650950