Deep mining the textual gold in relation extraction

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Tanvi Sharma, Frank Emmert-Streib
{"title":"Deep mining the textual gold in relation extraction","authors":"Tanvi Sharma,&nbsp;Frank Emmert-Streib","doi":"10.1007/s10462-024-11042-4","DOIUrl":null,"url":null,"abstract":"<div><p>Relation extraction (RE) is a fundamental task in natural language processing (NLP) that seeks to identify and categorize relationships among entities referenced in the text. Traditionally, RE has relied on rule-based systems. Still, recently, a variety of deep learning approaches have been employed, including recurrent neural networks (RNNs), convolutional neural networks (CNNs), and bidirectional encoder representations from transformers (BERT). This review aims to provide a comprehensive overview of relation extraction, focusing on deep learning models. Given the complexity of the RE problem, we will present it from a multi-dimensional perspective, covering model steps, relation types, method types, benchmark datasets, and applications. We will also highlight both historical and current research in the field, identifying promising research areas for further development and emerging directions. Specifically, we will focus on potential enhancements for relation extraction from poorly labeled data and provide a detailed assessment of current shortcomings in handling complex real-world situations.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 1","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2024-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-11042-4.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-11042-4","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Relation extraction (RE) is a fundamental task in natural language processing (NLP) that seeks to identify and categorize relationships among entities referenced in the text. Traditionally, RE has relied on rule-based systems. Still, recently, a variety of deep learning approaches have been employed, including recurrent neural networks (RNNs), convolutional neural networks (CNNs), and bidirectional encoder representations from transformers (BERT). This review aims to provide a comprehensive overview of relation extraction, focusing on deep learning models. Given the complexity of the RE problem, we will present it from a multi-dimensional perspective, covering model steps, relation types, method types, benchmark datasets, and applications. We will also highlight both historical and current research in the field, identifying promising research areas for further development and emerging directions. Specifically, we will focus on potential enhancements for relation extraction from poorly labeled data and provide a detailed assessment of current shortcomings in handling complex real-world situations.

深层挖掘关系提取中的文本黄金
关系提取(RE)是自然语言处理(NLP)中的一项基本任务,旨在识别和分类文本中引用的实体之间的关系。传统上,可再生能源依赖于基于规则的系统。尽管如此,最近已经采用了各种深度学习方法,包括循环神经网络(rnn),卷积神经网络(cnn)和双向编码器表示从变压器(BERT)。这篇综述旨在提供关系提取的全面概述,重点是深度学习模型。考虑到可重构问题的复杂性,我们将从多维的角度来介绍它,包括模型步骤、关系类型、方法类型、基准数据集和应用程序。我们还将重点介绍该领域的历史和当前研究,确定有希望进一步发展的研究领域和新兴方向。具体来说,我们将重点关注从标记不佳的数据中提取关系的潜在增强,并详细评估当前处理复杂现实情况的缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
×
引用
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学术官方微信