Statistical parsing of messages
HLT '90 Proceedings of the workshop on Speech and Natural Language
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
New figures of merit for best-first probabilistic chart parsing
Computational Linguistics
Automatic compensation for parser figure-of-merit flaws
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
| Hi-index | 0.00 |
A standard problem in parsing algorithms is the organization of branched searches to deal with ambiguous sentences. We discuss shift-reduce parsing of stochastic context-free grammars and show how to construct a probabilistic score for ranking competing parse hypotheses. The score we use is the likelihood that the collection of subtrees can be completed into a full parse tree by means of the steps the parser is constrained to follow.