Results 1 -
1 of
1
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
- Computational Linguistics
, 2002
"... this article can compute solutions to all four of these problems in a single flamework, with a number of additional advantages over previously presented isolated solutions ..."
Abstract
-
Cited by 155 (5 self)
- Add to MetaCart
this article can compute solutions to all four of these problems in a single flamework, with a number of additional advantages over previously presented isolated solutions
