179 search results - page 26 / 36 » Lambek Grammars Are Context Free |
TSE
2008
13 years 7 months ago
2008
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
IJBRA
2006
13 years 7 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...
EMNLP
2009
13 years 5 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
EMNLP
2008
13 years 9 months ago
2008
Syntactic word reordering is essential for translations across different grammar structures between syntactically distant languagepairs. In this paper, we propose to embed local a...
NAACL
2007
13 years 9 months ago
2007
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...