基于关键词抽取任务的文本集分析

IF 0.3 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Journal of Information and Organizational Sciences Pub Date : 2020-06-25 DOI:10.31341/jios.44.1.8
Alexander S. Vanyushkin, Leonid Graschenko
{"title":"基于关键词抽取任务的文本集分析","authors":"Alexander S. Vanyushkin, Leonid Graschenko","doi":"10.31341/jios.44.1.8","DOIUrl":null,"url":null,"abstract":"The article discusses the evaluation of automatic keyword extraction algorithms (AKEA) and points out AKEA’s dependence on the properties of the test collection for effectiveness. As a result, it is difficult to compare different algorithms who’s tests were based on various test datasets. It is also difficult to predict the effectiveness of different systems for solving real-world problems of natural language processing (NLP). We take in to consideration a number of characteristics, such as the text length distribution in words and the method of keyword assignment. Our analysis of publicly available analytical exposition text which is typical for the keywords extraction domain revealed that their length distributions are very regular and described by the lognormal form. Moreover, most of the article lengths range between 400 and 2500 words. Additionally, the paper presents a brief review of eleven corpora that have been used to evaluate AKEA’s.","PeriodicalId":43428,"journal":{"name":"Journal of Information and Organizational Sciences","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2020-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Analysis of Text Collections for the Purposes of Keyword Extraction Task\",\"authors\":\"Alexander S. Vanyushkin, Leonid Graschenko\",\"doi\":\"10.31341/jios.44.1.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article discusses the evaluation of automatic keyword extraction algorithms (AKEA) and points out AKEA’s dependence on the properties of the test collection for effectiveness. As a result, it is difficult to compare different algorithms who’s tests were based on various test datasets. It is also difficult to predict the effectiveness of different systems for solving real-world problems of natural language processing (NLP). We take in to consideration a number of characteristics, such as the text length distribution in words and the method of keyword assignment. Our analysis of publicly available analytical exposition text which is typical for the keywords extraction domain revealed that their length distributions are very regular and described by the lognormal form. Moreover, most of the article lengths range between 400 and 2500 words. Additionally, the paper presents a brief review of eleven corpora that have been used to evaluate AKEA’s.\",\"PeriodicalId\":43428,\"journal\":{\"name\":\"Journal of Information and Organizational Sciences\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2020-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Information and Organizational Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31341/jios.44.1.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information and Organizational Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31341/jios.44.1.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 3

摘要

本文讨论了自动关键字提取算法(AKEA)的评价,指出AKEA的有效性依赖于测试集的性质。因此,很难对基于不同测试数据集的不同算法进行比较。在解决自然语言处理(NLP)的实际问题时,很难预测不同系统的有效性。我们考虑了一些特征,如单词中的文本长度分布和关键字分配方法。我们对关键字提取领域中典型的公开可用的分析说明文本进行了分析,发现它们的长度分布非常规则,并以对数正态形式描述。此外,大多数文章的长度在400到2500字之间。此外,本文还简要回顾了11个用于评估AKEA的语料库。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Analysis of Text Collections for the Purposes of Keyword Extraction Task
The article discusses the evaluation of automatic keyword extraction algorithms (AKEA) and points out AKEA’s dependence on the properties of the test collection for effectiveness. As a result, it is difficult to compare different algorithms who’s tests were based on various test datasets. It is also difficult to predict the effectiveness of different systems for solving real-world problems of natural language processing (NLP). We take in to consideration a number of characteristics, such as the text length distribution in words and the method of keyword assignment. Our analysis of publicly available analytical exposition text which is typical for the keywords extraction domain revealed that their length distributions are very regular and described by the lognormal form. Moreover, most of the article lengths range between 400 and 2500 words. Additionally, the paper presents a brief review of eleven corpora that have been used to evaluate AKEA’s.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Information and Organizational Sciences
Journal of Information and Organizational Sciences COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
1.10
自引率
0.00%
发文量
14
审稿时长
12 weeks
期刊最新文献
Employing a Time Series Forecasting Model for Tourism Demand Using ANFIS A Mobile Based Pharmacy Store Location-aware System The Contribution of Women on Corporate Boards Croatian Journals Covered by SCIE/SSCI Towards an Improved Framework for E-Risk Management for Digital Financial Services (DFS) in Ugandan Banks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1