KeyGames: A Game Theoretic Approach to Automatic Keyphrase Extraction

31Citations
Citations of this article
73Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we introduce two advancements in the automatic keyphrase extraction (AKE) space - KeyGames and pke+. KeyGames is an unsupervised AKE framework that employs the concept of evolutionary game theory and consistent labelling problem to ensure consistent classification of candidates into keyphrase and non-keyphrase. Pke+ is a python based pipeline built on top of the existing pke library to standardize various AKE steps, namely candidate extraction and evaluation, to ensure truly systematic and comparable performance analysis of AKE models. In the experiments section, we compare the performance of KeyGames across three publicly available datasets (Inspec 2001, SemEval 2010, DUC 2001) against the results quoted by the existing state-of-the-art models as well as their performance when reproduced using pke+. The results show that KeyGames outperforms most of the state-of-the-art systems while generalizing better on input documents with different domains and length. Further, pke+’s pre-processing brings out improvement in several other system’s quoted performance as well.

Cite

CITATION STYLE

APA

Saxena, A., Mangal, M., & Jain, G. (2020). KeyGames: A Game Theoretic Approach to Automatic Keyphrase Extraction. In COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference (pp. 2037–2048). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2020.coling-main.184

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