Computer Science – Computation and Language
Scientific paper
1994-05-03
Proceedings, ACL 1992
Computer Science
Computation and Language
8 pages
Scientific paper
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.
Magerman David M.
Weir Carl
No associations
LandOfFree
Efficiency, Robustness, and Accuracy in Picky Chart Parsing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Efficiency, Robustness, and Accuracy in Picky Chart Parsing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiency, Robustness, and Accuracy in Picky Chart Parsing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-8789