Abstract
We propose an unsupervised keyphrase extraction model that encodes topical information within a multipartite graph structure. Our model represents keyphrase candidates and topics in a single graph and exploits their mutually reinforcing relationship to improve candidate ranking. We further introduce a novel mechanism to incorporate keyphrase selection preferences into the model. Experiments conducted on three widely used datasets show significant improvements over state-of-the-art graph-based models.
Cite
CITATION STYLE
Boudin, F. (2018). Unsupervised keyphrase extraction with multipartite graphs. In NAACL HLT 2018 - 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies - Proceedings of the Conference (Vol. 2, pp. 667–672). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/n18-2105
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.