Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,320 papers from all fields of science
Search
Sign In
Create Free Account
Stochastic context-free grammar
Known as:
SCFG
, Probabilistic parsing
, Probabilized context-free grammar
Expand
PCFGs extend context-free grammars similar to how hidden Markov models extend regular grammars. Each production is assigned a probability. The…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
A* search algorithm
Ambiguous grammar
Brute-force search
CYK algorithm
Expand
Broader (1)
Bioinformatics
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
Frank Weinberg
,
M. Nebel
Language and Automata Theory and Applications
2010
Corpus ID: 1081266
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the…
Expand
2009
2009
Dialogue Act Prediction Using Stochastic Context-Free Grammar Induction
J. Geertzen
2009
Corpus ID: 3129121
This paper presents a model-based approach to dialogue management that is guided by data-driven dialogue act prediction. The…
Expand
2007
2007
Acquiring a Stochastic Context-Free Grammar from the Penn Treebank
Alexander Krotov
,
R. Gaizauskas
,
Y. Wilks
2007
Corpus ID: 16370241
In this paper we present preliminary results of investigating the structure of the Penn Treebank and how these results can be…
Expand
2005
2005
Document understanding system using stochastic context-free grammars
J. Handley
,
A. Namboodiri
,
R. Zanibbi
IEEE International Conference on Document…
2005
Corpus ID: 7193808
We present a document understanding system in which the arrangement of lines of text and block separators within a document are…
Expand
Highly Cited
2001
Highly Cited
2001
Recognizing Multitasked Activities using Stochastic Context-Free Grammar
Darnell J. Moore
,
Irfan Essa
2001
Corpus ID: 12679853
In this paper, we present techniques for characterizing complex, multi-tasked activities that require both exemplars and models…
Expand
2001
2001
Refining the Structure of a Stochastic Context-Free Grammar
Joseph Bockhorst
,
M. Craven
International Joint Conference on Artificial…
2001
Corpus ID: 6454284
We present a machine learning algorithm for refining the structure of a stochastic context‐free grammar (SCFG). This algorithm…
Expand
2001
2001
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar
A. Jagota
,
Rune B. Lyngsø
,
Christian N. S. Pedersen
Workshop on Algorithms in Bioinformatics
2001
Corpus ID: 37374742
Stochastic models are commonly used in bioinformatics, e.g., hidden Markov models for modeling sequence families or stochastic…
Expand
1998
1998
Learning Stochastic Context-Free Grammars from Corpora Using a Genetic Algorithm.
R. Lutz
1998
Corpus ID: 15688222
A genetic algorithm for learning stochastic context-free grammars from finite language samples as described. Solutions to the…
Expand
1994
1994
Improving sentence recognition in stochastic context-free grammars
A. Fred
,
J. Leitao
Proceedings of ICASSP '94. IEEE International…
1994
Corpus ID: 45697
This paper introduces an improved stochastic context-free language recognizer. The algorithm is basically a best-first search on…
Expand
1992
1992
Hidden Markov estimation for unrestricted stochastic context-free grammars
J. Kupiec
IEEE International Conference on Acoustics…
1992
Corpus ID: 62632209
A novel algorithm for estimating the parameters of a hidden stochastic context-free grammar is presented. In contrast to the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE