Information | |
---|---|
has gloss | eng: The inside-outside algorithm is a way of re-estimating production probabilities in a probabilistic context-free grammar. It was introduced by James K. Baker in 1979 as a generalization of the forward-backward algorithm for parameter estimation on hidden Markov models to stochastic context-free grammars. It is used to compute expectations, for example as part of the Expectation-maximization algorithm (an unsupervised learning algorithm). |
lexicalization | eng: inside-outside algorithm |
instance of | c/Parsing algorithms |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint