UvA-MT's Participation in the WMT26 General Translation Shared Task

arXiv:2610.27852 · cs.CL · Submitted 2026-10-20 · Read on arXiv

cs.CL

Submitted: 2026-10-20

Updated: 2026-10-20

Comments: Accepted to WMT26

License: http://creativecommons.org/licenses/by/4.0/

The gist: This paper presents UvA-MT's submission to the WMT 2026 General Machine Translation shared task, competing in the unconstrained track across all 23 translation directions.

Abstract

This paper presents UvA-MT's submission to the WMT 2026 General Machine Translation shared task, competing in the unconstrained track across all 23 translation directions. This year, we fully leverage the test-time methods of Large Language Models (LLMs) for machine translation. Specifically, (1) we use sequential sampling with a refinement prompt to generate a pool of translation candidates for each source segment, a strategy shown to outperform traditional parallel sampling; and (2) we employ LLMs as pairwise judges to select the best candidate via a round-robin voting mechanism, with offline evaluation on the WMT25 benchmark showing a very clear improvement over point-wise best-of-N selection. Combined, these two strategies form our WMT26 submission.

Related papers