Entity generation algorithm based on reference expansion

Q1 Engineering
Jia-Jia Ruan , Xi-Xu He , Min Zhang , Yuan Gao
{"title":"Entity generation algorithm based on reference expansion","authors":"Jia-Jia Ruan ,&nbsp;Xi-Xu He ,&nbsp;Min Zhang ,&nbsp;Yuan Gao","doi":"10.1016/j.jnlest.2023.100218","DOIUrl":null,"url":null,"abstract":"<div><p>The extraction and understanding of text knowledge become increasingly crucial in the age of big data. One of the current research areas in the field of natural language processing (NLP) is how to accurately understand the text and collect accurate linguistic information because Chinese vocabulary is diverse and ambiguous. This paper mainly studies the candidate entity generation module of the entity link system. The candidate entity generation module constructs an entity reference expansion algorithm to improve the recall rate of candidate entities. In order to improve the efficiency of the connection algorithm of the entire system while ensuring the recall rate of candidate entities, we design a graph model filtering algorithm that fuses shallow semantic information to filter the list of candidate entities, and verify and analyze the efficiency of the algorithm through experiments. By analyzing the related technology of the entity linking algorithm, we study the related technology of candidate entity generation and entity disambiguation, improve the traditional entity linking algorithm, and give an innovative and practical entity linking model. The recall rate exceeds 82%, and the link accuracy rate exceeds 73%. Efficient and accurate entity linking can help machines to better understand text semantics, further promoting the development of NLP and improving the users’ knowledge acquisition experience on the text.</p></div>","PeriodicalId":53467,"journal":{"name":"Journal of Electronic Science and Technology","volume":"21 3","pages":"Article 100218"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Electronic Science and Technology","FirstCategoryId":"95","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1674862X23000368","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

The extraction and understanding of text knowledge become increasingly crucial in the age of big data. One of the current research areas in the field of natural language processing (NLP) is how to accurately understand the text and collect accurate linguistic information because Chinese vocabulary is diverse and ambiguous. This paper mainly studies the candidate entity generation module of the entity link system. The candidate entity generation module constructs an entity reference expansion algorithm to improve the recall rate of candidate entities. In order to improve the efficiency of the connection algorithm of the entire system while ensuring the recall rate of candidate entities, we design a graph model filtering algorithm that fuses shallow semantic information to filter the list of candidate entities, and verify and analyze the efficiency of the algorithm through experiments. By analyzing the related technology of the entity linking algorithm, we study the related technology of candidate entity generation and entity disambiguation, improve the traditional entity linking algorithm, and give an innovative and practical entity linking model. The recall rate exceeds 82%, and the link accuracy rate exceeds 73%. Efficient and accurate entity linking can help machines to better understand text semantics, further promoting the development of NLP and improving the users’ knowledge acquisition experience on the text.

基于参考扩展的实体生成算法
在大数据时代,文本知识的提取和理解变得越来越重要。由于汉语词汇的多样性和歧义性,如何准确理解文本并收集准确的语言信息是当前自然语言处理领域的研究热点之一。本文主要研究实体链接系统的候选实体生成模块。候选实体生成模块构造实体参考扩展算法,以提高候选实体的召回率。为了提高整个系统连接算法的效率,同时保证候选实体的召回率,我们设计了一种融合浅层语义信息的图模型过滤算法来过滤候选实体列表,并通过实验验证和分析了算法的效率。通过对实体链接算法相关技术的分析,研究了候选实体生成和实体消歧的相关技术,改进了传统的实体链接算法,给出了一个创新实用的实体链接模型。召回率超过82%,链接准确率超过73%。高效准确的实体链接可以帮助机器更好地理解文本语义,进一步促进NLP的发展,提高用户对文本的知识获取体验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Electronic Science and Technology
Journal of Electronic Science and Technology Engineering-Electrical and Electronic Engineering
CiteScore
4.30
自引率
0.00%
发文量
1362
审稿时长
99 days
期刊介绍: JEST (International) covers the state-of-the-art achievements in electronic science and technology, including the most highlight areas: ¨ Communication Technology ¨ Computer Science and Information Technology ¨ Information and Network Security ¨ Bioelectronics and Biomedicine ¨ Neural Networks and Intelligent Systems ¨ Electronic Systems and Array Processing ¨ Optoelectronic and Photonic Technologies ¨ Electronic Materials and Devices ¨ Sensing and Measurement ¨ Signal Processing and Image Processing JEST (International) is dedicated to building an open, high-level academic journal supported by researchers, professionals, and academicians. The Journal has been fully indexed by Ei INSPEC and has published, with great honor, the contributions from more than 20 countries and regions in the world.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信