Sciweavers

84 search results - page 14 / 17
» Evolutionary Parsing for a Probabilistic Context Free Gramma...
Sort
View
STACS
2005
Springer
14 years 1 months ago
Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
Kousha Etessami, Mihalis Yannakakis
TSE
2008
107views more  TSE 2008»
13 years 7 months ago
Interface Grammars for Modular Software Model Checking
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
Graham Hughes, Tevfik Bultan
ACL
2006
13 years 9 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang
RANLP
2003
13 years 9 months ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
BMCBI
2004
133views more  BMCBI 2004»
13 years 7 months ago
Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction
Background: RNA secondary structure prediction methods based on probabilistic modeling can be developed using stochastic context-free grammars (SCFGs). Such methods can readily co...
Robin D. Dowell, Sean R. Eddy