Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Inside–outside algorithm

Known as: Inside-outside algorithm 
In computer science, the inside–outside algorithm is a way of re-estimating production probabilities in a probabilistic context-free grammar. It was… 
Wikipedia

Related topics

Related topics

5 relations
Computer scienceExpectation–maximization algorithmForward–backward algorithmHidden Markov model
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Tensor Decomposition for Fast Parsing with Latent-Variable PCFGs
We describe an approach to speed-up inference with latent-variable PCFGs, which have been shown to be highly effective for… 
  • figure 1
  • figure 2
  • figure 3
2011
2011
Accurate Parsing with Compact Tree-Substitution Grammars: Double-DOP
We present a novel approach to Data-Oriented Parsing (DOP). Like other DOP models, our parser utilizes syntactic fragments of… 
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 8
2006
2006
Hisory-Based Inside-Outside Algorithm
Grammar induction is one of the most important research areas of the natural language processing. The lack of a large Treebank… 
1996
1996
Comparison Between the Inside-Outside Algorithm and the Viterbi Algorithm for Stochastic Context-Free Grammars
The most popular algorithms for the estimation of the probabilities of a context-free grammar are the Inside-Outside algorithm… 
Highly Cited
1994
Highly Cited
1994
Robust stochastic parsing using the inside-outside algorithm
The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using… 
  • table 1
Highly Cited
1993
Highly Cited
1993
Parsing the Wall Street Journal with the Inside-Outside Algorithm
We report grammar inference experiments on partially parsed sentences taken from the Wall Street Journal corpus using the inside… 
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
Highly Cited
1992
Highly Cited
1992
Inside-Outside Reestimation From Partially Bracketed Corpora
The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of… 
  • figure 1
  • figure 2
Highly Cited
1992
Highly Cited
1992
Automatically Acquiring Phrase Structure Using Distributional Analysis
In this paper, we present evidence that the acquisition of the phrase structure of a natural language is possible without… 
  • table 1
Highly Cited
1992
Highly Cited
1992
Inside-Outside Reestimation from Partially Bracketed Corpora
The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of… 
  • figure 1
  • figure 3
  • figure 2
  • table 2
Highly Cited
1990
Highly Cited
1990
Applications of stochastic context-free grammars using the Inside-Outside algorithm
Abstract This paper describes two applications in speech recognition of the use of stochastic context-free grammars (SCFGs… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE