Efficient probabilistic top-down and left-corner parsing
| dc.creator | Roark, Brian | |
| dc.creator | Johnson, Mark | |
| dc.date | 2000-08-21 | |
| dc.date.accessioned | 2026-07-07T03:16:28Z | |
| dc.date.available | 2026-07-07T03:16:28Z | |
| dc.description | This paper examines efficient predictive broad-coverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses that are fully connected trees spanning the entire left context, from which any kind of non-local dependency or partial semantic interpretation can in principle be read. We contrast two predictive parsing approaches, top-down and left-corner parsing, and find both to be viable. In addition, we find that enhancement with non-local information not only improves parser accuracy, but also substantially improves the search efficiency. | |
| dc.description | 8 pages, 3 tables, 3 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0008017 | |
| dc.identifier | http://arxiv.org/abs/cs/0008017 | |
| dc.identifier | Proceedings of the 37th Annual Meeting of the Association for Computational Linguistics, 1999, pages 421-428 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30365 | |
| dc.subject | Computation and Language | |
| dc.subject | I.2.7 | |
| dc.title | Efficient probabilistic top-down and left-corner parsing | |
| dc.type | text |