作者: Florian Boudin and Emmanuel Morin
来源: 2013 NAACL-HLT
概述:
这篇文章扩展了Filippova (2010)’s word graph-based MSC方法,添加了一个re-reranking步骤,使得包含最多相关关键词的compression被选择出来。
资源:
1. 代码:https://github.com/boudinfl/takahe
2. 数据集:https://github.com/boudinfl/lina-msc
相关工作:
1. Multi-sentence compression
a) Use a syntactic parser (control the grammaticality of the output)
b) Word graph-based approaches that only require a POS tagger (The key assumption is that the redundancy provides a reliable way of generating grammatical sentences. )
2. Keyphrase extraction
Supervised: 将其视为一个二分类问题,缺点:the need for training data; the bias towards the domain
Unsupervised: a) langu
论文阅读:Keyphrase Extraction for N-best Reranking in Multi-Sentence Compression
最新推荐文章于 2024-09-19 07:36:25 发布