20 search results - page 1 / 4 » Extending Stochastic Context-Free Grammars for an Applicatio... |
LATA
2010
Springer
14 years 2 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...
CLEIEJ
2006
13 years 7 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...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
ICDAR
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a document understanding system in which the arrangement of lines of text and block separators within a document are modeled by stochastic context free grammars. A gram...
ACL
1998
13 years 8 months ago
1998
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...