Khuyagbaatar Batsuren, Erdenebileg Batbaatar, Tsendsuren Munkhdalai, Meijing Li, Oyun-Erdene Namsrai, Keun Ho Ryu, Journal of Information Processing Systems Vol. 14, No. 5, pp. 1254-1271, Oct. 2018  

https://doi.org/ 10.3745/JIPS.04.0091
Keywords: dependency graph, Keyphrase Extraction
Fulltext: PDF Full Text PubReader

Abstract

Keyphrase extraction is one of fundamental natural language processing (NLP) tools to improve many textmining applications such as document summarization and clustering. In this paper, we propose to use two novel techniques on the top of the state-of-the-art keyphrase extraction methods. First is the anti-patterns that aim to recognize non-keyphrase candidates. The state-of-the-art methods often used the rich feature set to identify keyphrases while those rich feature set cover only some of all keyphrases because keyphrases share very few similar patterns and stylistic features while non-keyphrase candidates often share many similar patterns and stylistic features. Second one is to use the dependency graph instead of the word co-occurrence graph that could not connect two words that are syntactically related and placed far from each other in a sentence while the dependency graph can do so. In experiments, we have compared the performances with different settings of the graphs (co-occurrence and dependency), and with the existing method results. Finally, we discovered that the combination method of dependency graph and anti-patterns outperform the state-of-the-art performances.

Statistics
Cite this article