Using the bottom-up , dynamic programming technique ( see the appendix for details ) of computing inside probabilities ( Lari and Young 1990 ) , we can efficiently compute the probability of the sentence , P ( w | G ) .
the estimation of stochastic contextfree grammars using the insideoutside algorithm computer speech and language
Karim A Lari Steve J Young
Mapping it back into the entropy definition from equation ( 3 ) , we derive the tree entropy of w as follows : Using the bottom-up , dynamic programming technique ( see the appendix for details ) of computing inside probabilities ( Lari and Young 1990 ) , we can efficiently compute the probability of the sentence , P ( w | G ) . Similarly , the algorithm can be modified to compute the quantity E P ( v | G ) lg ( P ( v | G ) ) .
Using the bottom-up , dynamic programming technique ( see the appendix for details ) of computing inside probabilities ( @@CITATION ) , we can efficiently compute the probability of the sentence , P ( w | G ) .