An LLM-Enhanced Adversarial Editing System for Lexical Simplification

Keren Tan, Kangyang Luo, Yunshi Lan, Zheng Yuan, Jinlong Shu
2/22/2024
cs.CL

No confident code implementation found for this paper.

Abstract

Lexical Simplification (LS) aims to simplify text at the lexical level. Existing methods rely heavily on annotated data, making it challenging to apply in low-resource scenarios. In this paper, we propose a novel LS method without parallel corpora. This method employs an Adversarial Editing System with guidance from a confusion loss and an invariance loss to predict lexical edits in the original sentences. Meanwhile, we introduce an innovative LLM-enhanced loss to enable the distillation of knowledge from Large Language Models (LLMs) into a small-size LS system. From that, complex words within sentences are masked and a Difficulty-aware Filling module is crafted to replace masked positions with simpler words. At last, extensive experimental results and analyses on three benchmark LS datasets demonstrate the effectiveness of our proposed method.

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!

Cite this paper

@article{tan2024llmenhanced,
  title  = {An LLM-Enhanced Adversarial Editing System for Lexical Simplification},
  author = {Keren Tan and Kangyang Luo and Yunshi Lan and Zheng Yuan and Jinlong Shu},
  year   = {2024},
  eprint = {2402.14704},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2402.14704v3}
}

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

Discussion