Sciweavers

182 search results - page 26 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
IJBRA
2006
111views more  IJBRA 2006»
14 years 9 months ago
Memory efficient alignment between RNA sequences and stochastic grammar models of pseudoknots
: 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...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Co...
93
Voted
EMNLP
2008
14 years 11 months ago
Generalizing Local and Non-Local Word-Reordering Patterns for Syntax-Based Machine Translation
Syntactic word reordering is essential for translations across different grammar structures between syntactically distant languagepairs. In this paper, we propose to embed local a...
Bing Zhao, Yaser Al-Onaizan
90
Voted
NAACL
2007
14 years 11 months ago
Bayesian Inference for PCFGs via Markov Chain Monte Carlo
This paper presents two Markov chain Monte Carlo (MCMC) algorithms for Bayesian inference of probabilistic context free grammars (PCFGs) from terminal strings, providing an altern...
Mark Johnson, Thomas L. Griffiths, Sharon Goldwate...
ECML
2003
Springer
15 years 2 months ago
A Hybrid Language Model based on Stochastic Context-free Grammars
Abstract. This paper explores the use of initial Stochastic Context-Free Grammars (SCFG) obtained from a treebank corpus for the learning of SCFG by means of estimation algorithms....
Diego Linares, José-Miguel Benedí, J...
79
Voted
COLING
2008
14 years 11 months ago
Extracting Synchronous Grammar Rules From Word-Level Alignments in Linear Time
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
Hao Zhang, Daniel Gildea, David Chiang