Boris Iomdin
Author directory2026
The IOL-AI Challenge: An Open Challenge towards Advancing Linguistic Reasoning
Eduardo Sánchez | Rita Berrada | Dan-Mircea Mirea | Sara Rajaee | Alexander Piperski | Ana Meta Dolinar | Boris Iomdin | Andrey Nikulin | Mariya Shmatova | Marzieh Fadaee | Julia Kreutzer
The Proceedings of the Workshop on Open Reasoning Across Cultures Languages (ORACLE)
Eduardo Sánchez | Rita Berrada | Dan-Mircea Mirea | Sara Rajaee | Alexander Piperski | Ana Meta Dolinar | Boris Iomdin | Andrey Nikulin | Mariya Shmatova | Marzieh Fadaee | Julia Kreutzer
The Proceedings of the Workshop on Open Reasoning Across Cultures Languages (ORACLE)
Reasoning in LLMs is overwhelmingly studied in domains that provide a model with rules: mathematics and code. Linguistic puzzles invert this: the solver must first discover the system before reasoning within it. We present the IOL-AI Challenge, an open-science competition run on the unseen problems of the International Linguistics Olympiad (IOL) 2026 Individual Contest, evaluated both automatically and, for the first time, by members of the official IOL Jury under the same rubrics applied to human contestants. The challenge drew 731 submissions from 46 teams under a strict compute budget (one T4, 30 mins). We additionally benchmark 18 unconstrained frontier and open models, with Claude Opus 4.8 earning a jury score equivalent to a gold medal, while both resource-constrained systems we submitted for jury grading scored in the range of the bottom 5% of contestants. Capability was not determined by scale: 14B submissions outperform models twice their size, and gains come from decoding and output-handling rather than model capacity. We also found that automatic metrics rank systems exactly as the jury does, but compress the scale, upscoring weak systems by ∼13 points and understating strong ones. Our analysis shows that while frontier models might have prior knowledge about some of the problem languages, it does not significantly help them solve the linguistic reasoning tasks, leaving linguistic reasoning as a strong benchmarking proxy for generalizable reasoning skills.
2013
Linguistic Problems Based on Text Corpora
Boris Iomdin | Alexander Piperski | Anton Somin
Proceedings of the Fourth Workshop on Teaching NLP and CL
Boris Iomdin | Alexander Piperski | Anton Somin
Proceedings of the Fourth Workshop on Teaching NLP and CL
2006
A Syntactically and Semantically Tagged Corpus of Russian: State of the Art and Prospects
Juri Apresjan | Igor Boguslavsky | Boris Iomdin | Leonid Iomdin | Andrei Sannikov | Victor Sizov
Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06)
Juri Apresjan | Igor Boguslavsky | Boris Iomdin | Leonid Iomdin | Andrei Sannikov | Victor Sizov
Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06)
We describe a project aimed at creating a deeply annotated corpus of Russian texts. The annotation consists of comprehensive morphological marking, syntactic tagging in the form of a complete dependency tree, and semantic tagging within a restricted semantic dictionary. Syntactic tagging is using about 80 dependency relations. The syntactically annotated corpus counts more than 28,000 sentences and makes an autonomous part of the Russian National Corpus (www.ruscorpora.ru). Semantic tagging is based on an inventory of semantic features (descriptors) and a dictionary comprising about 3,000 entries, with a set of tags assigned to each lexeme and its argument slots. The set of descriptors assigned to words has been designed in such a way as to construct a linguistically relevant classification for the whole Russian vocabulary. This classification serves for discovering laws according to which the elements of various lexical and semantic classes interact in the texts. The inventory of semantic descriptors consists of two parts, object descriptors (about 90 items in total) and predicate descriptors (about a hundred). A set of semantic roles is thoroughly elaborated and contains about 50 roles.