Abstract
In this paper, we address the keyphrase extraction problem as sequence labeling and propose a model that jointly exploits the complementary strengths of Conditional Random Fields that capture label dependencies through a transition parameter matrix consisting of the transition probabilities from one label to the neighboring label, and Bidirectional Long Short Term Memory networks that capture hidden semantics in text through the long distance dependencies. Our results on three datasets of scholarly documents show that the proposed model substantially outperforms strong baselines and previous approaches for keyphrase extraction.
| Original language | English |
|---|---|
| Title of host publication | The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019 |
| Publisher | Association for Computing Machinery, Inc |
| Pages | 2551-2557 |
| Number of pages | 7 |
| ISBN (Electronic) | 9781450366748 |
| DOIs | |
| State | Published - 13 May 2019 |
| Externally published | Yes |
| Event | 2019 World Wide Web Conference, WWW 2019 - San Francisco, United States Duration: 13 May 2019 → 17 May 2019 |
Publication series
| Name | The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019 |
|---|
Conference
| Conference | 2019 World Wide Web Conference, WWW 2019 |
|---|---|
| Country/Territory | United States |
| City | San Francisco |
| Period | 13/05/19 → 17/05/19 |
Bibliographical note
Publisher Copyright:© 2019 IW3C2 (International World Wide Web Conference Committee), published under Creative Commons CC-BY 4.0 License.
Keywords
- Deep learning
- Keyphrase extraction
- Sequence labeling
ASJC Scopus subject areas
- Computer Networks and Communications
- Software