Samuel Frontull
Author directory2026
Grammatist at WMT 2026 General MT Task: An Agentic LLM Framework for Machine Translation with Explicit Linguistic Knowledge
Samuel Frontull | Jean Maillard | Christopher Haberland | Ruth Videsott | Stefano Lusito
Proceedings of the Eleventh Conference on Machine Translation
Samuel Frontull | Jean Maillard | Christopher Haberland | Ruth Videsott | Stefano Lusito
Proceedings of the Eleventh Conference on Machine Translation
We describe Grammatist, our submission to the unconstrained track of the WMT 2026 General Machine Translation Task, developed in direct collaboration with community members of two regional languages of Italy, Ladin and Ligurian. Ladin and Ligurian represent challenging scenarios for machine translation (MT), as they have limited resources for conventional data-driven approaches. However, this scarcity of large-scale parallel data does not reflect a lack of linguistic documentation: both languages are extensively documented in dictionaries and grammar books, which contain valuable knowledge but are not readily exploitable by conventional MT approaches. Grammatist addresses this gap by making this information available to a large language model (LLM) at inference time. The framework is both agentic and model-agnostic: it dynamically consults dictionaries and grammar books during translation to retrieve the information most relevant to the input. Any LLM can serve as the underlying base model, enabling Grammatist to benefit from advances in increasingly capable models. For the WMT 2026 task, we apply Grammatist to structured document-level translation from English into Ligurian and Ladin.
LiLa at WMT 2026 General MT Task: Exploring Beyond NMT and Learning the Limits of LLM Adaptation for Ligurian and Ladin
Mirelle Bueno | Lucas Domingues | Samuel Frontull | Jean Maillard | Sushil Garg
Proceedings of the Eleventh Conference on Machine Translation
Mirelle Bueno | Lucas Domingues | Samuel Frontull | Jean Maillard | Sushil Garg
Proceedings of the Eleventh Conference on Machine Translation
We describe LiLa, our submission to the constrained track of the WMT 2026 General Machine Translation Task. Motivated by recent advances in large language models (LLMs) and their increasing availability as open models, we investigate the adaptation of LLMs for Ligurian and Ladin, two low-resource languages included in the shared task. We evaluate several adaptation strategies for Gemma-4, including Instruction Tuning (IT-only), continuous pre-training followed by Instruction Tuning (CPT+IT), and Low-Rank Adaptation (LoRA), and compare them with a dedicated encoder-decoder pipeline based on fine-tuned No-Language Left Behind (NLLB) models. Our experiments show that, under the evaluated conditions, fine-tuned NLLB models achieve higher automatic translation scores than the investigated LLM adaptation strategies. Based on these results, our final submission adopts a fine-tuned NLLB-based translation pipeline. We discuss the main observations from the different approaches explored during development. We release the code and models produced in these experiments through a publicly accessible GitHub repository https://github.com/schtailmuel/wmt26-lila/
Findings of the WMT26 General Machine Translation Shared Task: Contrastive Dynamic Human Evaluation at Scale
Tom Kocmi | Ekaterina Artemova | Eleftherios Avramidis | Rachel Bawden | Ondřej Bojar | Sergey Dukanov | Anton Dvorkovich | Mark Fishel | Markus Freitag | Samuel Frontull | Thamme Gowda | Roman Grundkiewicz | Barry Haddow | Stan Kharevich | Philipp Koehn | Zheng Li | Jean Maillard | Christof Monz | Alexander Murauski | Kenton Murray | Masaaki Nagata | Stefano Perrella | Martin Popel | Maja Popović | Lorenzo Proietti | Sara Rajaee | Parker Riley | Mariya Shmatova | Steinthór Steingrímsson | Lisa Yankovskaya | Vilem Zouhar
Proceedings of the Eleventh Conference on Machine Translation
Tom Kocmi | Ekaterina Artemova | Eleftherios Avramidis | Rachel Bawden | Ondřej Bojar | Sergey Dukanov | Anton Dvorkovich | Mark Fishel | Markus Freitag | Samuel Frontull | Thamme Gowda | Roman Grundkiewicz | Barry Haddow | Stan Kharevich | Philipp Koehn | Zheng Li | Jean Maillard | Christof Monz | Alexander Murauski | Kenton Murray | Masaaki Nagata | Stefano Perrella | Martin Popel | Maja Popović | Lorenzo Proietti | Sara Rajaee | Parker Riley | Mariya Shmatova | Steinthór Steingrímsson | Lisa Yankovskaya | Vilem Zouhar
Proceedings of the Eleventh Conference on Machine Translation
This paper presents the results of the General Machine Translation Task organized under the 2026 Conference on Machine Translation (WMT). Participants build systems for any of the 23 language pairs spanning four to five domains. This year we brought major changes to the human evaluation: (1) new annotation platform Pearmut for better reproducibility, (2) new human protocol "contrastive Error Span Annotation" for higher quality and side-by-side evaluation, and (3) Dynamic human evaluation that allows assessing all submitted models while evaluating higher-performing models more frequently. Beyond human evaluation, we (4) extended difficulty sampling with a human-driven stage, (5) added two new domains, (6) made the test sets fully document-level without requiring segment-level alignment and relying on HTML or JSON structure, (7) prepared some human references by post-editing open-weight model outputs, and (8) introduced contextual instructions governing formality and structural style. We evaluated 46 systems in total: 30 submitted by participants and 16 consisting of translations from large language models (LLMs) and industry translation providers.
Adding ciofs and ciüfs to BOUQuET: Benchmark Extension to Ladin
Samuel Frontull | Lara Castlunger | Maximilian Oberhollenzer | Karin Comploj | Ruth Videsott | Robert Sama | Gabriel Perathoner | Carlo Zoli | Paul Videsott
Proceedings of the Eleventh Conference on Machine Translation
Samuel Frontull | Lara Castlunger | Maximilian Oberhollenzer | Karin Comploj | Ruth Videsott | Robert Sama | Gabriel Perathoner | Carlo Zoli | Paul Videsott
Proceedings of the Eleventh Conference on Machine Translation
Benchmarks do more than report scores: they provide a shared basis for evaluating methods, comparing systems, and measuring progress. As language technologies are now widely integrated into everyday life, efforts should also be made to include minority languages in the resources that underpin language-technology development. If languages are absent from relevant benchmarks, they remain harder to evaluate, compare, and incorporate into future language technologies. Expanding benchmark coverage is therefore essential for ensuring fair evaluation, increasing visibility, and enabling continued development of language technologies for these communities. To support MT development for Ladin, we contribute a Ladin extension of BOUQuET to the WMT 2026 OLDI shared task, covering the Val Badia and Gherdëina varieties. We present a systematic reference-creation workflow combining human translation, expert revision, cross-variant alignment, and blind ranking to produce high-quality references. The dataset is released under the CC BY-SA 4.0 license.
Every Word Presented in Context: Syntactic Coverage as Objective for Low-Resource Machine Translation with Large Language Models
Samuel Frontull | Thomas Ströhle
Proceedings of the Fifteenth Language Resources and Evaluation Conference
Samuel Frontull | Thomas Ströhle
Proceedings of the Fifteenth Language Resources and Evaluation Conference
Large Language Models (LLMs) have demonstrated strong capabilities in multilingual machine translation. However, they underperform for low-resource languages, indicating the need for more explicit instructional guidance. In this work, we introduce Fragment-Shot Prompting, a novel few-shot prompting method that aims to retrieve examples for every word occurring in the sentence to be translated, illustrating their use and meaning in context. We evaluate our method on translation between Italian, Ladin (Val Badia) and Ladin (Gherdëina) and compare its performance with zero-shot prompting, random few-shot prompting, as well as established lexical and semantic retrieval strategies. We conduct these experiments using state-of-the-art LLMs, including GPT-3.5, GPT-4o, o1-mini, LlaMA-3.3, and DeepSeek-R1. Our results demonstrate that LLMs can extract substantial value from limited data when translating from a low- to the high-resource language. However, this does not apply to translations into the low-resource languages, where the prompting method plays a much more important role. In particular, our method consistently delivers the best results and enables significant gains. Even though translation performance into Ladin remains limited with the available resources, our results highlight the importance of syntactic coverage for improving translation accuracy and ariant-specific adaptation in low-resource scenarios.
AlignFix: A Tool for Parallel Corpora Augmentation and Refinement
Samuel Frontull | Simon Haller-Seeber
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 3: System Demonstrations)
Samuel Frontull | Simon Haller-Seeber
Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics (Volume 3: System Demonstrations)
High-quality datasets are crucial for training effective state of the art machine translation systems. However, due to the data-intensive nature of these systems, they have to be trained on large amounts of text that can easily go beyond the scope of full human inspection. This makes the presence of noise that can degrade overall system performance a frequent and significant issue. While various approaches have been developed to identify and select only the highest-quality training examples, this is undesirable in scenarios where resources are limited. For this reason, we introduce AlignFix, an open-source tool for augmenting data, identifying and correcting errors in parallel corpora. Leveraging word alignments, AlignFix extracts consistent phrase pairs, enabling targeted replacements that can improve the dataset quality. Besides targeted replacements, the tool enables contextual augmentation by duplicating sentences and allowing users to substitute words with alternatives of their choice. The tool maintains and updates the underlying word alignments, thereby avoiding the costly recomputation. AlignFix runs locally in the browser, requires no installation, and ensures that all data remains entirely on the client side. It is released under Apache 2.0 license, encouraging broad adoption, reuse, and further development. A live demo is available at https://ifi-alignfix.uibk.ac.at.
2025
Bringing Ladin to FLORES+
Samuel Frontull | Thomas Ströhle | Carlo Zoli | Werner Pescosta | Ulrike Frenademez | Matteo Ruggeri | Daria Valentin | Karin Comploj | Gabriel Perathoner | Silvia Liotto | Paolo Anvidalfarei
Proceedings of the Tenth Conference on Machine Translation
Samuel Frontull | Thomas Ströhle | Carlo Zoli | Werner Pescosta | Ulrike Frenademez | Matteo Ruggeri | Daria Valentin | Karin Comploj | Gabriel Perathoner | Silvia Liotto | Paolo Anvidalfarei
Proceedings of the Tenth Conference on Machine Translation
Recent advances in neural machine translation (NMT) have opened new possibilities for developing translation systems also for smaller, so-called low-resource, languages. The rise of large language models (LLMs) has further revolutionized machine translation by enabling more flexible and context-aware generation. However, many challenges remain for low-resource languages, and the availability of high-quality, validated test data is essential to support meaningful development, evaluation, and comparison of translation systems. In this work, we present an extension of the FLORES+ dataset for two Ladin variants, Val Badia and Gherdëina, as a submission to the Open Language Data Initiative Shared Task 2025. To complement existing resources, we additionally release two parallel datasets for Gherdëina–Val Badia and Gherdëina–Italian. We validate these datasets by evaluating state-of-the-art LLMs and NMT systems on this test data, both with and without leveraging the newly released parallel data for fine-tuning and prompting. The results highlight the considerable potential for improving translation quality in Ladin, while also underscoring the need for further research and resource development, for which this contribution provides a basis.
LaTeXMT: Machine Translation for LaTeX Documents
Calvin Hoy | Samuel Frontull | Georg Moser
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
Calvin Hoy | Samuel Frontull | Georg Moser
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing: System Demonstrations
While machine translation has taken great strides in recent years, thanks in large part to transformer language models, machine translation tools are designed primarily for plain text, and thus not equipped to deal with complex markup documents. Not even Large Language Models can reliably handle LaTeX source files, as non-standard structures are not captured by any available training data. Previous attempts to create translation engines for LaTeX either work on compiled documents, rely on document pre-processors which may lose critical semantic elements, or cannot distinguish between text and non-text content. In this paper we present LaTeXMT, a software solution for structure-preserving, source-to-source translation of LaTeX documents. All of the source code to LaTeXMT is provided under the LGPL-3.0 open-source licence and a web version is publicly available.
2024
Rule-Based, Neural and LLM Back-Translation: Comparative Insights from a Variant of Ladin
Samuel Frontull | Georg Moser
Proceedings of the Seventh Workshop on Technologies for Machine Translation of Low-Resource Languages (LoResMT 2024)
Samuel Frontull | Georg Moser
Proceedings of the Seventh Workshop on Technologies for Machine Translation of Low-Resource Languages (LoResMT 2024)
This paper explores the impact of different back-translation approaches on machine translation for Ladin, specifically the Val Badia variant. Given the limited amount of parallel data available for this language (only 18k Ladin-Italian sentence pairs), we investigate the performance of a multilingual neural machine translation model fine-tuned for Ladin-Italian. In addition to the available authentic data, we synthesise further translations by using three different models: a fine-tuned neural model, a rule-based system developed specifically for this language pair, and a large language model. Our experiments show that all approaches achieve comparable translation quality in this low-resource scenario, yet round-trip translations highlight differences in model performance.
Search
Fix author
Co-authors
- Jean Maillard 3
- Karin Comploj 2
- Georg Moser 2
- Gabriel Perathoner 2
- Thomas Ströhle 2
- Ruth Videsott 2
- Carlo Zoli 2
- Paolo Anvidalfarei 1
- Ekaterina Artemova 1
- Eleftherios Avramidis 1
- Rachel Bawden 1
- Ondřej Bojar 1
- Mirelle Bueno 1
- Lara Castlunger 1
- Lucas Domingues 1
- Sergey Dukanov 1
- Anton Dvorkovich 1
- Mark Fishel 1
- Markus Freitag 1
- Ulrike Frenademez 1
- Sushil Garg 1
- Thamme Gowda 1
- Roman Grundkiewicz 1
- Christopher Haberland 1
- Barry Haddow 1
- Simon Haller-Seeber 1
- Calvin Hoy 1
- Stan Kharevich 1
- Tom Kocmi 1
- Philipp Koehn 1
- Zheng Li 1
- Silvia Liotto 1
- Stefano Lusito 1
- Christof Monz 1
- Alexander Murauski 1
- Kenton Murray 1
- Masaaki Nagata 1
- Maximilian Oberhollenzer 1
- Stefano Perrella 1
- Werner Pescosta 1
- Martin Popel 1
- Maja Popović 1
- Lorenzo Proietti 1
- Sara Rajaee 1
- Parker Riley 1
- Matteo Ruggeri 1
- Robert Sama 1
- Mariya Shmatova 1
- Steinþór Steingrímsson 1
- Daria Valentin 1
- Paul Videsott 1
- Lisa Yankovskaya 1
- Vilém Zouhar 1