Metaheuristic approaches to lexical substitution and simplification

5Citations
Citations of this article
79Readers
Mendeley users who have this article in their library.

Abstract

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 datasets, one English and one German. We find that D-Bees has robust performance for both languages, and performs better than simulated annealing, though both achieve good results. Moreover, the D-Bees-based lexical substitution system outperforms state-of-the-art systems on several evaluation metrics. We also show that D-Bees achieves competitive performance in lexical simplification, a variant of lexical substitution.

Cite

CITATION STYLE

APA

Abualhaija, S., Miller, T., Eckle-Kohler, J., Gurevych, I., & Zimmermann, K. H. (2017). Metaheuristic approaches to lexical substitution and simplification. In 15th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2017 - Proceedings of Conference (Vol. 2, pp. 870–880). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/e17-1082

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free