An efficient domain-independent approach for supervised keyphrase extraction and ranking

Sriraghavendra Ramaswamy
3/24/2024
cs.IRcs.CLcs.LG

No confident code implementation found for this paper.

Abstract

We present a supervised learning approach for automatic extraction of keyphrases from single documents. Our solution uses simple to compute statistical and positional features of candidate phrases and does not rely on any external knowledge base or on pre-trained language models or word embeddings. The ranking component of our proposed solution is a fairly lightweight ensemble model. Evaluation on benchmark datasets shows that our approach achieves significantly higher accuracy than several state-of-the-art baseline models, including all deep learning-based unsupervised models compared with, and is competitive with some supervised deep learning-based models too. Despite the supervised nature of our solution, the fact that does not rely on any corpus of "golden" keywords or any external knowledge corpus means that our solution bears the advantages of unsupervised solutions to a fair extent.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ramaswamy2024efficient,
  title  = {An efficient domain-independent approach for supervised keyphrase extraction and ranking},
  author = {Sriraghavendra Ramaswamy},
  year   = {2024},
  eprint = {2404.07954},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.07954v1}
}

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/2404.07954.svg)](https://codeofpaper.com/paper/2404.07954)

Discussion