Unsupervised Lexical Simplification with Context Augmentation

Takashi Wada, Timothy Baldwin, Jey Han Lau
11/1/2023
cs.CLcs.AI

No official code found. Best implementation: twadada/lexsub_decontextualised (4 stars, Apache-2.0, last commit 2023-11-01).

Abstract

We propose a new unsupervised lexical simplification method that uses only monolingual data and pre-trained language models. Given a target word and its context, our method generates substitutes based on the target context and also additional contexts sampled from monolingual data. We conduct experiments in English, Portuguese, and Spanish on the TSAR-2022 shared task, and show that our model substantially outperforms other unsupervised systems across all languages. We also establish a new state-of-the-art by ensembling our model with GPT-3.5. Lastly, we evaluate our model on the SWORDS lexical substitution data set, achieving a state-of-the-art result.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Code for "Unsupervised Lexical Substitution with Decontextualised Embeddings" (COLING 2022)

42PythonSep 5, 20222 years agoApache-2.0

Similar Papers

Cite this paper

@article{wada2023unsupervised,
  title  = {Unsupervised Lexical Simplification with Context Augmentation},
  author = {Takashi Wada and Timothy Baldwin and Jey Han Lau},
  year   = {2023},
  eprint = {2311.00310},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.00310v1}
}

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

Discussion