What is the minimal set of fragments that achieves maximal parse accuracy?
| dc.creator | Bod, Rens | |
| dc.date | 2001-10-24 | |
| dc.date.accessioned | 2026-07-07T03:17:50Z | |
| dc.date.available | 2026-07-07T03:17:50Z | |
| 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 (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. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0110050 | |
| dc.identifier | http://arxiv.org/abs/cs/0110050 | |
| dc.identifier | Proceedings ACL'2001, Toulouse, France | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30874 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | What is the minimal set of fragments that achieves maximal parse accuracy? | |
| dc.type | text |