Efficiency, Robustness, and Accuracy in Picky Chart Parsing
| dc.creator | Magerman, David M. | |
| dc.creator | Weir, Carl | |
| dc.date | 1994-05-03 | |
| dc.date.accessioned | 2026-07-07T09:09:14Z | |
| dc.date.available | 2026-07-07T09:09:14Z | |
| dc.description | This paper describes Picky, a probabilistic agenda-based chart parsing algorithm which uses a technique called {\em probabilistic prediction} to predict which grammar rules are likely to lead to an acceptable parse of the input. Using a suboptimal search method, Picky significantly reduces the number of edges produced by CKY-like chart parsing algorithms, while maintaining the robustness of pure bottom-up parsers and the accuracy of existing probabilistic parsers. Experiments using Picky demonstrate how probabilistic modelling can impact upon the efficiency, robustness and accuracy of a parser. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9405006 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9405006 | |
| dc.identifier | Proceedings, ACL 1992 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/150964 | |
| dc.subject | Computation and Language | |
| dc.title | Efficiency, Robustness, and Accuracy in Picky Chart Parsing | |
| dc.type | text |