Y ) is bounded above by the probability that the entire derivation starting at X terminates Unfortunately, the terminology used in the literature is not uniform. For example, Jelinek & Lafferty

Y ) is bounded above by the probability that the entire derivation starting at X terminates Unfortunately, the terminology used in the literature is not uniform. For example, Jelinek & Lafferty (1991)

by L

Results 1 - 1 of 1

An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities

by Andreas Stolcke - 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

Y ) is bounded above by the probability that the entire derivation starting at X terminates Unfortunately, the terminology used in the literature is not uniform. For example, Jelinek & Lafferty (1991)

Tools

An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities