13 search results - page 1 / 3 » Refining the Structure of a Stochastic Context-Free Grammar |
IJCAI
2001
14 years 11 months ago
2001
We present a machine learning algorithm for refining the structure of a stochastic context
CLEIEJ
2006
14 years 9 months ago
2006
Pseudoknots are a frequent RNA structure that assumes essential roles for varied biocatalyst cell's functions. One of the most challenging fields in bioinformatics is the pre...
ACL
1994
14 years 11 months ago
1994
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-gr...
LATA
2010
Springer
15 years 4 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
87
Voted
BMCBI
2005
14 years 9 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...