Sciweavers

179 search results - page 23 / 36
» Lambek Grammars Are Context Free
Sort
View
PAMI
2006
109views more  PAMI 2006»
13 years 7 months ago
Offline Grammar-Based Recognition of Handwritten Sentences
This paper proposes a sequential coupling of a Hidden Markov Model (HMM) recognizer for offline handwritten English sentences with a probabilistic bottom-up chart parser using Sto...
Matthias Zimmermann, Jean-Cédric Chappelier...
IPL
2011
94views more  IPL 2011»
12 years 11 months ago
Lower bounds for context-free grammars
Ellul, Krawetz, Shallit and Wang prove an exponential lower bound on the size of any context-free grammar generating the language of all permutations over some alphabet. We genera...
Yuval Filmus
ACL
2009
13 years 5 months ago
Demonstration of Joshua: An Open Source Toolkit for Parsing-based Machine Translation
We describe Joshua (Li et al., 2009a)1, an open source toolkit for statistical machine translation. Joshua implements all of the algorithms required for translation via synchronou...
Zhifei Li, Chris Callison-Burch, Chris Dyer, Juri ...
ACL
2012
11 years 10 months ago
Hierarchical Chunk-to-String Translation
We present a hierarchical chunk-to-string translation model, which can be seen as a compromise between the hierarchical phrasebased model and the tree-to-string model, to combine ...
Yang Feng, Dongdong Zhang, Mu Li, Qun Liu
ACL
2012
11 years 10 months ago
Concept-to-text Generation via Discriminative Reranking
This paper proposes a data-driven method for concept-to-text generation, the task of automatically producing textual output from non-linguistic input. A key insight in our approac...
Ioannis Konstas, Mirella Lapata