13 search results - page 2 / 3 » Refining the Structure of a Stochastic Context-Free Grammar |
TCBB
2011
13 years 8 hour ago
2011
Stochastic models such as hidden Markov models or stochastic context free grammars can fail to return the correct, maximum likelihood solution in the case of semantic ambiguity. T...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we evaluate a method for on-line handwritten Kanji character recognition by describing the structure of Kanji using Stochastic Context-Free Grammar (SCFG), and exte...
IJBRA
2006
13 years 5 months ago
2006
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
ISMB
1994
13 years 6 months ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
COLING
1996
13 years 6 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...