Do All Fragments Count?
| dc.creator | Bod, Rens | |
| dc.date | 2000-11-24 | |
| dc.date.accessioned | 2026-07-07T03:16:46Z | |
| dc.date.available | 2026-07-07T03:16:46Z | |
| dc.description | 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. | |
| dc.description | 18 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0011040 | |
| dc.identifier | http://arxiv.org/abs/cs/0011040 | |
| dc.identifier | Technical Report COMP-11-12 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30477 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | Do All Fragments Count? | |
| dc.type | text |