Computer Science – Computation and Language
Scientific paper
2000-11-24
Technical Report COMP-11-12
Computer Science
Computation and Language
18 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. We isolate a number of dependency relations which previous models neglect but which contribute to higher parse accuracy.
No associations
LandOfFree
Do All Fragments Count? 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 Do All Fragments Count?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Do All Fragments Count? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-61064