Data-Driven Adaptive Simultaneous Machine Translation
원문 초록
In simultaneous translation (SimulMT), the most widely used strategy is the wait-k policy thanks to its simplicity and effectiveness in balancing translation quality and latency. However, wait-k suffers from two major limitations: (a) it is a fixed policy that can not adaptively adjust latency given context, and (b) its training is much slower than full-sentence translation. To alleviate these issues, we propose a novel and efficient training scheme for adaptive SimulMT by augmenting the training corpus with adaptive prefix-to-prefix pairs, while the training complexity remains the same as that of training full-sentence translation models. Experiments on two language pairs show that our method outperforms all strong baselines in terms of translation quality and latency.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Intrinsic vs. Extrinsic Evaluation of Czech Sentence Embeddings: Semantic Relevance Doesn't Help with MT Evaluation
ConECT Dataset: Overcoming Data Scarcity in Context-Aware E-Commerce MT
Building a Functional Machine Translation Corpus for Kpelle
Combining the Best of Both Worlds: A Method for Hybrid NMT and LLM Translation
Same evaluation, more tokens: On the effect of input length for machine translation evaluation using Large Language Models
CycleDistill: Bootstrapping Machine Translation using LLMs with Cyclical Distillation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.