We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/AttentionRank: Unsupervised Keyphrase Extraction using Self and Cross Attentions
Conference ProceedingsArtificial Intelligence & Machine Learning

AttentionRank: Unsupervised Keyphrase Extraction using Self and Cross Attentions

Checking your access to this record.

Abstract & Overview

Keyword or keyphrase extraction is to identify words or phrases presenting the main topics of a document.This paper proposes the AttentionRank, a hybrid attention model, to identify keyphrases from a document in an unsupervised manner.AttentionRank calculates self-attention and cross-attention using a pretrained language model.The self-attention is designed to determine the importance of a candidate within the context of a sentence.The cross-attention is calculated to identify the semantic relevance between a candidate and sentences within a document.We evaluate the AttentionRank on three publicly available datasets against seven baselines.The results show that the AttentionRank is an effective and robust unsupervised keyphrase extraction model on both long and short documents.Source code is available on Github 1 .

Cite this record

Haoran Ding, Xiao Luo (2021). AttentionRank: Unsupervised Keyphrase Extraction using Self and Cross Attentions. Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.18653/v1/2021.emnlp-main.146

Copy in another style

Ding, H., & Luo, X. (2021). AttentionRank: Unsupervised Keyphrase Extraction using Self and Cross Attentions. Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.18653/v1/2021.emnlp-main.146
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.