Resumen

POPOVA, Svetlana; DANILOVA, Vera; ALEXANDROV, Mikhail  y  CARDIFF, John. Unsupervised Keyphrase Extraction: Ranking Step and Single-Word Phrase Problem. Comp. y Sist. [online]. 2024, vol.28, n.3, pp.1377-1391.  Epub 21-Ene-2025. ISSN 2007-9737.  https://doi.org/10.13053/cys-28-3-5197.

Keyphrases provide a compact representation of a document‘s content and can be efficiently used to enhance Web search results and improve natural language processing tasks. This paper extends the state-of-the-art in unsupervised keyphrase extraction from scientific abstracts. We aim to demonstrate the difference between two types of datasets used in the keyphrase extraction domain: datasets where keyphrases for each text are manually assigned by readers, and datasets where keyphrases are assigned by the authors themselves. We aim to highlight the problem of single-word phrases and illustrate the role of this problem for each dataset type. Additionally, we noticed that well-known algorithms in the domain can be divided into two groups. Algorithms in the first group minimize the number of single-word phrases in the set of the extracted keyphrases. In contrast, algorithms in the second group allow the extraction of a larger number of single-word keyphrases. This property of algorithms ”to extract few or many single-word keyphrases” determines how they perform on each type of dataset. We explain the reasons for this.

Palabras llave : Unsupervised keyphrase extraction; single-word phrase problem; keyphrase length.

        · texto en Inglés     · Inglés ( pdf )