基于中心性测度的搭配网络关键词和关键短语抽取
Keyword and Keyphrase Extraction Using Centrality Measures on Collocation Networks
摘要：
关键词和关键短语提取是自然语言处理中的一个重要问题，其应用范围从摘要到语义搜索再到文档聚类。基于图的关键词和关键短语提取方法避免了通过在词网络上应用PageRank算法的变体来获取大型域内训练语料库的问题。虽然基于图的方法是知识贫乏的，很容易在在线系统中采用，但它们是否能从PageRank以外的中心性度量中受益，在很大程度上仍然是开放的。在本文中，我们在单词和名词短语搭配网络上实验了一系列中心性度量，并在四个基准数据集上分析了它们的性能。不仅有中心性指标的表现与PageRank一样好或更好，而且它们更简单（例如，度、强度和邻域大小）。此外，基于中心的方法给出的结果与两个强无监督基线竞争，并且在某些情况下优于两个强无监督基线。
英文摘要：
Keyword and keyphrase extraction is an important problem in natural language processing, with applications ranging from summarization to semantic search to document clustering. Graph-based approaches to keyword and keyphrase extraction avoid the problem of acquiring a large in-domain training corpus by applying variants of PageRank algorithm on a network of words. Although graph-based approaches are knowledge-lean and easily adoptable in online systems, it remains largely open whether they can benefit from centrality measures other than PageRank. In this paper, we experiment with an array of centrality measures on word and noun phrase collocation networks, and analyze their performance on four benchmark datasets. Not only are there centrality measures that perform as well as or better than PageRank, but they are much simpler (e.g., degree, strength, and neighborhood size). Furthermore, centrality-based methods give results that are competitive with and, in some cases, better than two strong unsupervised baselines.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
