Stochastic context-free grammar

Known as: SCFG, Probabilistic parsing, Probabilized context-free grammar 
PCFGs extend context-free grammars similar to how hidden Markov models extend regular grammars. Each production is assigned a probability. The… (More)
Wikipedia

Related topics

Related topics

36 relations
A* search algorithmAmbiguous grammarBrute-force searchCYK algorithm
(More)

Broader (1)

Bioinformatics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Dialogue Act Prediction Using Stochastic Context-Free Grammar Induction
This paper presents a model-based approach to dialogue management that is guided by data-driven dialogue act prediction. The… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Hand Gesture Recognition Using Haar-Like Features and a Stochastic Context-Free Grammar
This paper proposes a new approach to solve the problem of real-time vision-based hand gesture recognition with the combination… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Pfold: RNA secondary structure prediction using stochastic context-free grammars
RNA secondary structures are important in many biological processes and efficient structure prediction can give vital directions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Recognizing Multitasked Activities from Video Using Stochastic Context-Free Grammar
In this paper, we present techniques for recognizing complex, multitasked activities from video. Visual information like image… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2001
2001
Recognizing Multitasked Activities using Stochastic Context-Free Grammar
In this paper, we present techniques for characterizing complex, multi-tasked activities that require both exemplars and models… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
2001
2001
Refining the Structure of a Stochastic Context-Free Grammar
We present a machine learning algorithm for refining the structure of a stochastic context–free grammar (SCFG). This algorithm… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
RNA secondary structure prediction using stochastic context-free grammars and evolutionary history
MOTIVATION Many computerized methods for RNA secondary structure prediction have been developed. Few of these methods, however… (More)
  • table 1
  • table 3
  • table 4
  • table 2
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Using a stochastic context-free grammar as a language model for speech recognition
This paper describes a number of experiments in adding new grammatical knowledge to the Berkeley Restaurant Project (BeRP), our… (More)
  • figure 2
  • figure 3
  • table 1
Is this relevant?
1994
1994
Acquiring a Stochastic Context-Free Grammar from the Penn Treebank
In this paper we present preliminary results of investigating the structure of the Penn Treebank and how these results can be… (More)
Is this relevant?
1971
1971
On stochastic context-free languages
In this paper, properties of normalized stochastic languages are discussed and alternative procedures for constructing the… (More)
Is this relevant?