RALS: Resources and Baselines for Romanian Automatic Lexical Simplification

Fabian Anghel, Petru Theodor Cristea, Claudiu Creanga, Sergiu Nisioi
7/22/2026
cs.CL

No official code found. Best implementation: senisioi/RALS (0 stars, last commit 2025-11-02).

Abstract

We introduce the first dataset that jointly covers both lexical complexity prediction (LCP) annotations and lexical simplification (LS) for Romanian, along with a comparison of lexical simplification approaches. We propose a methodology for ordering simplification suggestions using a pairwise ranking approximation method, arranging candidates from simple to complex based on a separate set of human judgments. In addition, we provide human lexical complexity annotations for 3,921 word samples in context. Finally, we explore several novel pipelines for complexity prediction and simplification and present the first text simplification system for Romanian.

View on arXivView PDF

Code Implementations(1)

senisioi/RALSCommunity68%

RALS: Resources and Baselines for Romanian Automatic Lexical Simplification

00Sep 19, 202511 months ago
lexical-complexitylexical-simplificationnlp-machine-learningromanian

Similar Papers

Japanese Lexical Complexity for Non-Native Readers: A New Dataset

92% match1 repo62023

Lexical Complexity Prediction: An Overview

86% match2023

New Evaluation Paradigm for Lexical Simplification

86% match2025

Lexical Complexity Prediction and Lexical Simplification for Catalan and Spanish: Resource Creation, Quality Assessment, and Ethical Considerations

86% match2024

MultiLS: A Multi-task Lexical Simplification Framework

85% match2024

A New Dataset and Empirical Study for Sentence Simplification in Chinese

82% match1 repo62023

Cite this paper

@article{anghel2026rals,
  title  = {RALS: Resources and Baselines for Romanian Automatic Lexical Simplification},
  author = {Fabian Anghel and Petru Theodor Cristea and Claudiu Creanga and Sergiu Nisioi},
  year   = {2026},
  eprint = {2607.20078},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.20078v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.20078.svg)](https://codeofpaper.com/paper/2607.20078)

Discussion