sCAKE: Semantic Connectivity Aware Keyword Extraction

Swagata Duari, Vasudha Bhatnagar
11/27/2018
cs.IR

Official code: SDuari/sCAKE-and-LAKE (6 stars, last commit 2019-10-24).

Abstract

Keyword Extraction is an important task in several text analysis endeavors. In this paper, we present a critical discussion of the issues and challenges ingraph-based keyword extraction methods, along with comprehensive empirical analysis. We propose a parameterless method for constructing graph of text that captures the contextual relation between words. A novel word scoring method is also proposed based on the connection between concepts. We demonstrate that both proposals are individually superior to those followed by the state-of-the-art graph-based keyword extraction algorithms. Combination of the proposed graph construction and scoring methods leads to a novel, parameterless keyword extraction method (sCAKE) based on semantic connectivity of words in the document. Motivated by limited availability of NLP tools for several languages, we also design and present a language-agnostic keyword extraction (LAKE) method. We eliminate the need of NLP tools by using a statistical filter to identify candidate keywords before constructing the graph. We show that the resulting method is a competent solution for extracting keywords from documents oflanguages lacking sophisticated NLP support.

View on arXivView PDF

Code Implementations(1)

R Scripts for implementing sCAKE and LAKE method for single document keyword Extraction

63R, PythonNov 26, 20177 years ago

Similar Papers

Cite this paper

@article{duari2018scake,
  title  = {sCAKE: Semantic Connectivity Aware Keyword Extraction},
  author = {Swagata Duari and Vasudha Bhatnagar},
  year   = {2018},
  eprint = {1811.10831},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1811.10831}
}

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

Discussion