English

LSBert: A Simple Framework for Lexical Simplification

Computation and Language 2020-06-29 v1 Information Retrieval

Abstract

Lexical simplification (LS) aims to replace complex words in a given sentence with their simpler alternatives of equivalent meaning, to simplify the sentence. Recently unsupervised lexical simplification approaches only rely on the complex word itself regardless of the given sentence to generate candidate substitutions, which will inevitably produce a large number of spurious candidates. In this paper, we propose a lexical simplification framework LSBert based on pretrained representation model Bert, that is capable of (1) making use of the wider context when both detecting the words in need of simplification and generating substitue candidates, and (2) taking five high-quality features into account for ranking candidates, including Bert prediction order, Bert-based language model, and the paraphrase database PPDB, in addition to the word frequency and word similarity commonly used in other LS methods. We show that our system outputs lexical simplifications that are grammatically correct and semantically appropriate, and obtains obvious improvement compared with these baselines, outperforming the state-of-the-art by 29.8 Accuracy points on three well-known benchmarks.

Keywords

Cite

@article{arxiv.2006.14939,
  title  = {LSBert: A Simple Framework for Lexical Simplification},
  author = {Jipeng Qiang and Yun Li and Yi Zhu and Yunhao Yuan and Xindong Wu},
  journal= {arXiv preprint arXiv:2006.14939},
  year   = {2020}
}

Comments

arXiv admin note: text overlap with arXiv:1907.06226

R2 v1 2026-06-23T16:38:57.331Z