Sciweavers

159 search results - page 16 / 32
» Fast Decoding and Optimal Decoding for Machine Translation
Sort
View
EMNLP
2008
13 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
EMNLP
2011
12 years 7 months ago
Heuristic Search for Non-Bottom-Up Tree Structure Prediction
State of the art Tree Structures Prediction techniques rely on bottom-up decoding. These approaches allow the use of context-free features and bottom-up features. We discuss the l...
Andrea Gesmundo, James Henderson
VTC
2008
IEEE
14 years 1 months ago
Reduced-Complexity Adaptive Receiver Algorithms for 4G SU-MIMO Systems
Abstract—In this paper we present reduced-complexity highperformance receivers for single-user MIMO systems that employ coded OFDM transmission with bit-interleaved coded modulat...
Ozgun Y. Bursalioglu, Haralabos C. Papadopoulos, C...
TAL
2010
Springer
13 years 5 months ago
OpenMaTrEx: A Free/Open-Source Marker-Driven Example-Based Machine Translation System
Abstract. We describe OpenMaTrEx, a free/open-source examplebased machine translation (EBMT) system based on the marker hypothesis, comprising a marker-driven chunker, a collection...
Sandipan Dandapat, Mikel L. Forcada, Declan Groves...
EMNLP
2009
13 years 5 months ago
Better Synchronous Binarization for Machine Translation
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...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...