N-үздік қайта реттеу
Related Papers
N-Best Reranking by Multitask Learning
We propose a new framework for N-best reranking on sparse feature sets. The idea is to reformulate the reranking problem as a Multitask Learning problem, where each N-best list corresponds …...
The RWTH System Combination System for WMT 2010
RWTH participated in the System Combi- nation task of the Fifth Workshop on Sta- tistical Machine Translation (WMT 2010). For 7 of the 8 language pairs, we com- bine 5 …...
Keyphrase Extraction for N-best Reranking in Multi-Sentence Compression
Multi-Sentence Compression (MSC) is the task of generating a short single sentence sum- mary from a cluster of related sentences. This paper presents an N-best reranking method based on keyphrase …...
Illinois Japanese ↔ English News Translation for WMT 2021
AbstractThis system paper describes an end-to-end NMT pipeline for the Japanese ↔ English news translation task as submitted to WMT 2021, where we explore the efficacy of techniques such as …...
Quality-Aware Decoding for Neural Machine Translation
AbstractDespite the progress in machine translation quality estimation and evaluation in the last years, decoding in neural machine translation (NMT) is mostly oblivious to this and centers around finding the …...