The results show that the quality of small ``base'' models can be greatly enhanced, and that reinforcement learning with verifiable rewards can be applied to NMT in the legal domain and surpasses the translation quality of supervised fine-tuning.
Abstract
Neural machine translation (NMT) in the legal domain is a linguistically and conceptually demanding task, primarily due to the complexity of legal language and the high level of precision it requires. The recent emergence of reasoning-capable language models opens new possibilities for tackling such challenges. They add to a set of other previously proposed techniques to enhance the translation quality, which includes supervised fine-tuning and reinforcement learning. In this work, we perform a comparison between these various approaches. More particularly, we evaluate small language models such as Qwen3.5 4B, Qwen3.5 9B, and Gemma 3 12B enhanced with various re-training paradigms and compare their performances against frontier reasoning models. We focus on the Swiss legal system, which -- with its unique multilingual statutes -- offers a particularly challenging testbed for reasoning-augmented models. Our results show that the quality of small ``base''models can be greatly enhanced, and that reinforcement learning with verifiable rewards can be applied to NMT in the legal domain and surpasses the translation quality of supervised fine-tuning. The performance of enhanced small models is close to the one of state-of-the-art reasoning models yet remains inferior. We also note that re-training paradigms yield diminishing returns as model size increase. The code and models are publicly available at https://github.com/aixiuxiuxiu/Legal-MT-SFT-RL.
This work investigates the importance of including the model's reasoning trace in the generated responses during both training and inference by systematically omitting it from one of the phases and shows that including the reasoning, specifically during inference, has a positive effect on the overall translation qualit...
Michael Jungo, Aixiu An· Proceedings of the 2026 ACM...· 0 citations
A novel fragment-based reasoning framework is introduced in which the model first extracts parallel source-target fragments from retrieved similar exemplars, and uses these fragments as intermediate reasoning traces to produce the final translation.
Maxime Bouthors, J. Crego, François Yvon· 0 citations
It is demonstrated that combining LLMs with semantic retrieval techniques enhances precision and scalability in legal information systems, offering a viable roadmap for developing domain-specific, efficient, and sustainable AI legal assistants.
C. Martín, J. Torres, R. M. Aguilar et al.· Logic Journal of the IGPL· 0 citations
Mathematical reasoning has become a central task for evaluating and tuning reasoning Large Language Models (LLMs), yet existing benchmarks remain heavily biased toward high-resource languages, with English and Chinese dominating both pre-training corpora and evaluation suites. The recently released PolyMath (Wang et al...
Daryna Dementieva, N. Babakov, Kathy Hammerl et al.· 0 citations
The evaluation of various NMT and LLM architectures specifically for Croatian from/to English and Spanish demonstrates that open–source models can achieve, and occasionally surpass, the quality of Google Translate, a widely used commercial NMT system.
Antoni Oliver, Sergi Álvarez–Vidal· Suvremena Lingvistika· 1 citation
PAMT is proposed, a process-aligned training framework that combines cold-start domain-aware Long-CoT supervision with reinforcement learning that improves over base models, outperforms MT-specialized baselines on average, and remains competitive with strong LLMs/LRMs across in-domain, OOD, and multilingual settings.
Yongshi Ye, Biao Fu, Chongxuan Huang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.