69 search results - page 12 / 14 » Synchronization of Grammars |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
Several recent works have studied subfamilies of deterministic context-free languages with good closure properties, for instance the families of input-driven or visibly pushdown la...
EMNLP
2011
13 years 9 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we investigate the use of bilingual parsing on parallel corpora to better estimate the rule parameters in a formal syntax-based machine translation system, which ar...
77
Voted
COLING
2008
14 years 11 months ago
2008
Probabilistic synchronous context-free grammar (PSCFG) translation models define weighted transduction rules that represent translation and reordering operations via nonterminal s...
ACL
2011
14 years 1 months ago
2011
We introduce synchronous tree adjoining grammars (TAG) into tree-to-string translation, which converts a source tree to a target string. Without reconstructing TAG derivations exp...