Inside–outside algorithm
For parsing algorithms in computer science, 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).
- Comment
- enFor parsing algorithms in computer science, 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).
- Has abstract
- enFor parsing algorithms in computer science, 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).
- Hypernym
- Way
- Is primary topic of
- Inside–outside algorithm
- Label
- enInside–outside algorithm
- Link from a Wikipage to an external page
- www.sciencedirect.com/science/article/pii/088523089190009F
- asa.scitation.org/doi/abs/10.1121/1.2017061
- faculty.washington.edu/fxia/courses/LING572/inside-outside.ppt
- www.cs.columbia.edu/~mcollins/io.pdf
- courses.cs.washington.edu/courses/cse599d1/16sp/lari-young-90.pdf
- www.aclweb.org/anthology/P92-1017
- Link from a Wikipage to another Wikipage
- Category:Parsing algorithms
- Computer science
- Expectation–maximization algorithm
- Forward–backward algorithm
- Hidden Markov model
- James K. Baker
- Karim Lari
- Parsing
- Probabilistic context-free grammar
- Steve J. Young
- Stochastic context-free grammar
- SameAs
- 4n1Nw
- m.0c5drf
- Q6038052
- 內部外部演算法
- Subject
- Category:Parsing algorithms
- WasDerivedFrom
- Inside–outside algorithm?oldid=1076010185&ns=0
- WikiPageLength
- 4842
- Wikipage page ID
- 4492939
- Wikipage revision ID
- 1076010185
- WikiPageUsesTemplate
- Template:Reflist
- Template:Short description