179 search results - page 20 / 36 » Lambek Grammars Are Context Free |
153
click to vote
CL
2000
Springer
15 years 1 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
128
click to vote
ACL
2011
14 years 5 months ago
2011
We discuss some of the practical issues that arise from decoding with general synchronous context-free grammars. We examine problems caused by unary rules and we also examine how ...
113
click to vote
ACL
2010
14 years 12 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
134
click to vote
ACL
2010
14 years 12 months ago
2010
We present cdec, an open source framework for decoding, aligning with, and training a number of statistical machine translation models, including word-based models, phrase-based m...
126
click to vote
NIPS
2008
15 years 3 months ago
2008
We explore a new Bayesian model for probabilistic grammars, a family of distributions over discrete structures that includes hidden Markov models and probabilistic context-free gr...