Difference between revisions of "Inside Outside algorithm"
From Cohen Courses
Jump to navigationJump to searchm |
m |
||
| Line 2: | Line 2: | ||
== Background == | == Background == | ||
| + | |||
| + | The inside-outside algorithm is a way of estimating probabilities in a PCFG. It is first introduced [[http://asadl.org/jasa/resource/1/jasman/v65/iS1/pS132_s1 | Baker, 1979]]. The inside outside algorithm is in fact a generalization of the forward-backward algorithm (for hidden Markov models) to PCFGs. | ||
| + | |||
| + | It is often used as part of the EM algorithm for computing expectations. | ||
== Algorithm == | == Algorithm == | ||
Revision as of 12:33, 29 November 2011
This is a Method page for the Inside-outside algorithm.
Background
The inside-outside algorithm is a way of estimating probabilities in a PCFG. It is first introduced [| Baker, 1979]. The inside outside algorithm is in fact a generalization of the forward-backward algorithm (for hidden Markov models) to PCFGs.
It is often used as part of the EM algorithm for computing expectations.
