{"title":"Corpus-Based Task-Specific Relation Discovery","authors":"Karthik Ramanan","doi":"10.18653/v1/2023.matching-1.5","DOIUrl":null,"url":null,"abstract":"Relation extraction is a crucial language processing task for various downstream applications, including knowledge base completion, question answering, and summarization. Traditional relation-extraction techniques, however, rely on a predefined set of relations and model the extraction as a classification task. Consequently, such closed-world extraction methods are insufficient for inducing novel relations from a corpus. Unsupervised techniques like OpenIE, which extract triples, generate relations that are too general for practical information extraction applications. In this work, we contribute the following: 1) We motivate and introduce a new task, corpus-based task-specific relation discovery. 2) We adapt existing data sources to create Wiki-Art, a novel dataset for task-specific relation discovery. 3) We develop a novel framework for relation discovery using zero-shot entity linking, prompting, and type-specific clustering. Our approach effectively connects unstructured text spans to their shared underlying relations, bridging the data-representation gap and significantly outperforming baselines on both quantitative and qualitative metrics. Our code and data are available in our GitHub repository.","PeriodicalId":107861,"journal":{"name":"Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the First Workshop on Matching From Unstructured and Structured Data (MATCHING 2023)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/2023.matching-1.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Relation extraction is a crucial language processing task for various downstream applications, including knowledge base completion, question answering, and summarization. Traditional relation-extraction techniques, however, rely on a predefined set of relations and model the extraction as a classification task. Consequently, such closed-world extraction methods are insufficient for inducing novel relations from a corpus. Unsupervised techniques like OpenIE, which extract triples, generate relations that are too general for practical information extraction applications. In this work, we contribute the following: 1) We motivate and introduce a new task, corpus-based task-specific relation discovery. 2) We adapt existing data sources to create Wiki-Art, a novel dataset for task-specific relation discovery. 3) We develop a novel framework for relation discovery using zero-shot entity linking, prompting, and type-specific clustering. Our approach effectively connects unstructured text spans to their shared underlying relations, bridging the data-representation gap and significantly outperforming baselines on both quantitative and qualitative metrics. Our code and data are available in our GitHub repository.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于语料库的任务特定关系发现
关系提取是各种下游应用程序的关键语言处理任务,包括知识库补全、问题回答和摘要。然而,传统的关系提取技术依赖于预定义的关系集,并将提取建模为分类任务。因此,这种封闭世界提取方法不足以从语料库中诱导新的关系。像OpenIE这样提取三元组的无监督技术,生成的关系对于实际的信息提取应用程序来说过于笼统。在这项工作中,我们做出了以下贡献:1)我们激发并引入了一个新的任务,基于语料库的任务特定关系发现。2)我们改编现有的数据源来创建Wiki-Art,这是一个用于特定任务关系发现的新数据集。3)我们开发了一个新的框架,用于使用零采样实体链接、提示和特定类型的聚类来发现关系。我们的方法有效地将非结构化文本跨度与其共享的底层关系联系起来,弥合了数据表示差距,并在定量和定性指标上显著优于基线。我们的代码和数据可以在我们的GitHub存储库中获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Toward Consistent and Informative Event-Event Temporal Relation Extraction Identifying Quantifiably Verifiable Statements from Text Corpus-Based Task-Specific Relation Discovery On the Surprising Effectiveness of Name Matching Alone in Autoregressive Entity Linking Knowledge-Augmented Language Model Prompting for Zero-Shot Knowledge Graph Question Answering
×
引用
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