Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We describe an approach to speed-up inference with latent-variable PCFGs, which have been shown to be highly effective for… 
2011
2011
We present a novel approach to Data-Oriented Parsing (DOP). Like other DOP models, our parser utilizes syntactic fragments of… 
2010
2010
Weighted finite-state string transducer cascades are a powerful formalism for models of solutions to many natural language… 
2006
2006
Grammar induction is one of the most important research areas of the natural language processing. The lack of a large Treebank… 
2001
2001
  • Taisuke Sato
  • Fuji International Symposium on Functional and…
  • 2001
  • Corpus ID: 17052719
In this paper, we describe recent attempts to incorporate learning into logic programs as a step toward adaptive software that… 
Highly Cited
1994
Highly Cited
1994
The paper describes a parser of sequences of (English) part-of-speech labels which utilises a probabilistic grammar trained using… 
Highly Cited
1993
Highly Cited
1993
We report grammar inference experiments on partially parsed sentences taken from the Wall Street Journal corpus using the inside… 
Highly Cited
1992
Highly Cited
1992
The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of… 
Highly Cited
1992
Highly Cited
1992
  • E. BrillM. Marcus
  • Human Language Technology - The Baltic Perspectiv
  • 1992
  • Corpus ID: 16624536
In this paper, we present evidence that the acquisition of the phrase structure of a natural language is possible without… 
Highly Cited
1992
Highly Cited
1992
The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of…