MultiLS: A Multi-task Lexical Simplification Framework

Kai North, Tharindu Ranasinghe, Matthew Shardlow, Marcos Zampieri
2/22/2024
cs.CLcs.AI

No confident code implementation found for this paper.

Abstract

Lexical Simplification (LS) automatically replaces difficult to read words for easier alternatives while preserving a sentence's original meaning. LS is a precursor to Text Simplification with the aim of improving text accessibility to various target demographics, including children, second language learners, individuals with reading disabilities or low literacy. Several datasets exist for LS. These LS datasets specialize on one or two sub-tasks within the LS pipeline. However, as of this moment, no single LS dataset has been developed that covers all LS sub-tasks. We present MultiLS, the first LS framework that allows for the creation of a multi-task LS dataset. We also present MultiLS-PT, the first dataset to be created using the MultiLS framework. We demonstrate the potential of MultiLS-PT by carrying out all LS sub-tasks of (1). lexical complexity prediction (LCP), (2). substitute generation, and (3). substitute ranking for Portuguese. Model performances are reported, ranging from transformer-based models to more recent large language models (LLMs).

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{north2024multils,
  title  = {MultiLS: A Multi-task Lexical Simplification Framework},
  author = {Kai North and Tharindu Ranasinghe and Matthew Shardlow and Marcos Zampieri},
  year   = {2024},
  eprint = {2402.14972},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.14972v1}
}

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/2402.14972.svg)](https://codeofpaper.com/paper/2402.14972)

Discussion