Abstract
Existing methods for keyphrase extraction need preprocessing to generate candidate phrase or post-processing to
transform keyword into keyphrase. In this paper, we propose a novel approach called duration modeling with semi-Markov Conditional
Random Fields (DM-SMCRFs) for keyphrase extraction. First of all, based on the property of semi-Markov chain, DM-SMCRFs can
encode segment-level features and sequentially classify the phrase in the sentence as keyphrase or non-keyphrase. Second, by
assuming the independence between state transition and state duration, DM-SMCRFs model the distribution of duration (length) of
keyphrases to further explore state duration information, which can help identify the size of keyphrase. Based on the convexity of
parametric duration feature derived from duration distribution, a constrained Viterbi algorithm is derived to improve the performance of
decoding in DM-SMCRFs. We thoroughly evaluate the performance of DM-SMCRFs on the datasets from various domains. The
experimental results demonstrate the effectiveness of proposed model.
| Original language | English |
|---|---|
| Article number | 8844794 |
| Pages (from-to) | 1453-1466 |
| Journal | IEEE Transactions on Knowledge and Data Engineering |
| Volume | 33 |
| Issue number | 4 |
| Online published | 19 Sept 2019 |
| DOIs | |
| Publication status | Published - Apr 2021 |
Research Keywords
- Keyphrase extraction
- semi-Markov
- duration modeling
- constrained Viterbi
Fingerprint
Dive into the research topics of 'Duration Modeling with Semi-Markov Conditional Random Fields for Keyphrase Extraction'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver