Sciweavers

5 search results - page 1 / 1
» Context-free reordering, finite-state translation
Sort
View
ACL
2010
13 years 4 months ago
cdec: A Decoder, Alignment, and Learning Framework for Finite-State and Context-Free Translation Models
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...
Chris Dyer, Adam Lopez, Juri Ganitkevitch, Jonatha...
EMNLP
2008
13 years 8 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
NIPS
2008
13 years 8 months ago
Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...
Phil Blunsom, Trevor Cohn, Miles Osborne
APL
1992
ACM
13 years 11 months ago
Compiler Tools in APL
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
Robert Bernecky, Gert Osterburg
ACL
2008
13 years 8 months ago
Generalizing Word Lattice Translation
Word lattice decoding has proven useful in spoken language translation; we argue that it provides a compelling model for translation of text genres, as well. We show that prior wo...
Christopher Dyer, Smaranda Muresan, Philip Resnik