Attention-Seeker: Dynamic Self-Attention Scoring for Unsupervised Keyphrase Extraction

Erwin D. López Z., Cheng Tang, Atsushi Shimada
9/17/2024
cs.CLcs.IR

No official code found. Best implementation: EruM16/Attention-Seeker (2 stars, last commit 2025-04-21).

Abstract

This paper proposes Attention-Seeker, an unsupervised keyphrase extraction method that leverages self-attention maps from a Large Language Model to estimate the importance of candidate phrases. Our approach identifies specific components - such as layers, heads, and attention vectors - where the model pays significant attention to the key topics of the text. The attention weights provided by these components are then used to score the candidate phrases. Unlike previous models that require manual tuning of parameters (e.g., selection of heads, prompts, hyperparameters), Attention-Seeker dynamically adapts to the input text without any manual adjustments, enhancing its practical applicability. We evaluate Attention-Seeker on four publicly available datasets: Inspec, SemEval2010, SemEval2017, and Krapivin. Our results demonstrate that, even without parameter tuning, Attention-Seeker outperforms most baseline models, achieving state-of-the-art performance on three out of four datasets, particularly excelling in extracting keyphrases from long documents.

View on arXivView PDF

Code Implementations(1)

20Python, Jupyter NotebookSep 16, 20241 years ago

Similar Papers

Cite this paper

@article{z2024attentionseeker,
  title  = {Attention-Seeker: Dynamic Self-Attention Scoring for Unsupervised Keyphrase Extraction},
  author = {Erwin D. López Z. and Cheng Tang and Atsushi Shimada},
  year   = {2024},
  eprint = {2409.10907},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.10907v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.10907.svg)](https://codeofpaper.com/paper/2409.10907)

Discussion