Name
Abstract | ||
|---|---|---|
This paper describes Picky, a probabilistic agenda-based chart parsing algorithm which uses a technique called 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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.3115/981967.981973 | ACL '79 Proceedings of the 17th annual meeting on Association for Computational Linguistics |
Keywords | DocType | Volume |
probabilistic modelling,pure bottom-up parsers,probabilistic agenda-based chart,acceptable parse,probabilistic parsers,picky chart parsing,suboptimal search method,probabilistic prediction,grammar rule | Conference | abs/cmp-lg/9405006 |
ISSN | Citations | PageRank |
Proceedings, ACL 1992 | 10 | 11.43 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David M. Magerman | 1 | 726 | 512.15 |
| Carl Weir | 2 | 56 | 23.55 |