Results 21 to 30 of about 349,709 (223)

Chinese Lexical Simplification

open access: yesCoRR, 2020
Lexical simplification has attracted much attention in many languages, which is the process of replacing complex words in a given sentence with simpler alternatives of equivalent meaning. Although the richness of vocabulary in Chinese makes the text very difficult to read for children and non-native speakers, there is no research work for Chinese ...
Jipeng Qiang   +5 more
openaire   +2 more sources

Controllable Lexical Simplification for English

open access: yesProceedings of the Workshop on Text Simplification, Accessibility, and Readability (TSAR-2022), 2022
Fine-tuning Transformer-based approaches have recently shown exciting results on sentence simplification task. However, so far, no research has applied similar approaches to the Lexical Simplification (LS) task. In this paper, we present ConLS, a Controllable Lexical Simplification system fine-tuned with T5 (a Transformer-based model pre-trained with a
Kim Cheng Sheang   +2 more
openaire   +3 more sources

LEXenstein: A Framework for Lexical Simplification [PDF]

open access: yesProceedings of ACL-IJCNLP 2015 System Demonstrations, 2015
Lexical Simplification consists in replacing complex words in a text with simpler alternatives. We introduce LEXenstein, the first open source framework for Lexical Simplification. It covers all major stages of the process and allows for easy benchmarking of various approaches. We test the tool’s performance and report comparisons on different datasets
Gustavo Paetzold, Lucia Specia
openaire   +1 more source

Lexical Simplification with Neural Ranking [PDF]

open access: yesProceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 2, Short Papers, 2017
Conference paper: Lexical Simplification with Neural ...
Paetzold, Gustavo Henrique   +1 more
openaire   +1 more source

Metaheuristic Approaches to Lexical Substitution and Simplification [PDF]

open access: yesProceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics: Volume 1, Long Papers, 2017
In this paper, we propose using metaheuristics- in particular, simulated annealing and the new D-Bees algorithm-to solve word sense disambiguation as an optimization problem within a knowledge-based lexical substitution system. We are the first to perform such an extrinsic evaluation of metaheuristics, for which we use two standard lexical substitution
Abualhaija, Sallam   +4 more
openaire   +1 more source

TEXT COMPLEXITY AND TEXT SIMPLIFICATION [PDF]

open access: yes, 2012
A thesis submitted in partial fulfilment of the requirements of the University of Wolverhampton for the degree of Doctor of PhilosophyDue to the fact that emergency situations can lead to substantial losses, both financial and in terms of human lives, it
Temnikova, Irina
core   +2 more sources

Findings of the TSAR-2022 Shared Task on Multilingual Lexical Simplification [PDF]

open access: yes, 2023
We report findings of the TSAR-2022 shared task on multilingual lexical simplification, organized as part of the Workshop on Text Simplification, Accessibility, and Readability TSAR-2022 held in conjunction with EMNLP 2022.
Ferrés, Daniel   +6 more
core  

MeaningBERT: assessing meaning preservation between sentences

open access: yesFrontiers in Artificial Intelligence, 2023
In the field of automatic text simplification, assessing whether or not the meaning of the original text has been preserved during simplification is of paramount importance.
David Beauchemin   +2 more
doaj   +1 more source

Features of lexical complexity: insights from L1 and L2 speakers

open access: yesFrontiers in Artificial Intelligence, 2023
We discover sizable differences between the lexical complexity assignments of first language (L1) and second language (L2) English speakers. The complexity assignments of 940 shared tokens without context were extracted and compared from three lexical ...
Kai North, Marcos Zampieri
doaj   +1 more source

Home - About - Disclaimer - Privacy