ParsEL 1.0: Unsupervised Entity Linking in Persian Social Media Texts

Majid Asgari-Bidhendi, Farzane Fakhrian, B. Minaei-Bidgoli
{"title":"ParsEL 1.0: Unsupervised Entity Linking in Persian Social Media Texts","authors":"Majid Asgari-Bidhendi, Farzane Fakhrian, B. Minaei-Bidgoli","doi":"10.1109/ikt51791.2020.9345631","DOIUrl":null,"url":null,"abstract":"Social media users have exponentially increased in recent years, and social media data has become one of the most populated repositories of data in the world. Natural language text is one of the main portions of this data. However, this textual data contains many entities, which increases the ambiguity of the data. Entity linking targets finding entity mentions and linking them to their corresponding entities in an external dataset. Recently, FarsBase has been introduced as the first Persian knowledge graph, containing almost 750,000 entities. In this study, we propose ParsEL, the first unsupervised end-to-end entity linking system specially designed for the Persian language, and utilizes contextual and graph-based features to rank the candidate entities. To evaluate the proposed approach, we publish the first entity linking dataset for the Persian language, created by crawling social media text from some popular Telegram channels and contains 67,595 tokens. The results show ParsEL records 86.94% f-score for the introduced dataset, and it is comparable with one other entity linking system which supports the Persian language.","PeriodicalId":382725,"journal":{"name":"2020 11th International Conference on Information and Knowledge Technology (IKT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 11th International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ikt51791.2020.9345631","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Social media users have exponentially increased in recent years, and social media data has become one of the most populated repositories of data in the world. Natural language text is one of the main portions of this data. However, this textual data contains many entities, which increases the ambiguity of the data. Entity linking targets finding entity mentions and linking them to their corresponding entities in an external dataset. Recently, FarsBase has been introduced as the first Persian knowledge graph, containing almost 750,000 entities. In this study, we propose ParsEL, the first unsupervised end-to-end entity linking system specially designed for the Persian language, and utilizes contextual and graph-based features to rank the candidate entities. To evaluate the proposed approach, we publish the first entity linking dataset for the Persian language, created by crawling social media text from some popular Telegram channels and contains 67,595 tokens. The results show ParsEL records 86.94% f-score for the introduced dataset, and it is comparable with one other entity linking system which supports the Persian language.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ParsEL 1.0:波斯语社交媒体文本中的无监督实体链接
近年来,社交媒体用户呈指数级增长,社交媒体数据已成为世界上数量最多的数据存储库之一。自然语言文本是这些数据的主要部分之一。然而,这些文本数据包含许多实体,这增加了数据的模糊性。实体链接的目标是找到实体提及,并将其链接到外部数据集中的相应实体。最近,FarsBase 作为第一个波斯语知识图谱问世,其中包含近 75 万个实体。在本研究中,我们提出了 ParsEL,这是首个专为波斯语设计的无监督端到端实体链接系统,并利用上下文和基于图的特征对候选实体进行排序。为了评估所提出的方法,我们发布了首个波斯语实体链接数据集,该数据集是通过抓取一些流行 Telegram 频道的社交媒体文本创建的,包含 67,595 个标记。结果显示,ParsEL 在引入的数据集上获得了 86.94% 的 f-score,与其他支持波斯语的实体链接系统不相上下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Sentence Ordering Method using BERT Pretrained Model Classical-Quantum Multiple Access Wiretap Channel with Common Message: One-Shot Rate Region Business Process Improvement Challenges: A Systematic Literature Review The risk prediction of heart disease by using neuro-fuzzy and improved GOA Distributed Learning Automata-Based Algorithm for Finding K-Clique in Complex Social Networks
×
引用
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