Efficiency, Robustness, and Accuracy in Picky Chart Parsing
<|reference_start|>Efficiency, Robustness, and Accuracy in Picky Chart Parsing: 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.<|reference_end|>
@article{magerman1994efficiency,,
    title={Efficiency, Robustness, and Accuracy in Picky Chart Parsing},
    author={David M. Magerman and Carl Weir},
    journal={Proceedings, ACL 1992},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9405006},
    primaryClass={cmp-lg cs.CL}
}