CKEMI: Concept knowledge enhanced metaphor identification framework

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-11-04 DOI:10.1016/j.ipm.2024.103946
Dian Wang , Yang Li , Suge Wang , Xin Chen , Jian Liao , Deyu Li , Xiaoli Li
{"title":"CKEMI: Concept knowledge enhanced metaphor identification framework","authors":"Dian Wang ,&nbsp;Yang Li ,&nbsp;Suge Wang ,&nbsp;Xin Chen ,&nbsp;Jian Liao ,&nbsp;Deyu Li ,&nbsp;Xiaoli Li","doi":"10.1016/j.ipm.2024.103946","DOIUrl":null,"url":null,"abstract":"<div><div>Metaphor is pervasive in our life, there is roughly one metaphor every three sentences on average in our daily conversations. Previous metaphor identification researches in NLP have rarely focused on similarity between concepts from different domains. In this paper, we propose a Concept Knowledge Enhanced Metaphor Identification Framework (CKEMI) to model similarity between concepts from different domains. First, we construct the descriptive concept word set and the inter-word relation concept word set by selecting knowledge from the ConceptNet knowledge base. Then, we devise two hierarchical relation concept graph networks to refine inter-word relation concept knowledge. Next, we design the concept consistency mapping function to constrain the representation of inter-word relation concept and learn similarity information between concepts. Finally, we construct the target domain semantic scene by integrating the representation of inter-word relation concept knowledge for metaphor identification. Specifically, the F1 score of CKEMI is superior to the state-of-the-art (SOTA) methods, achieving improvements of over 0.5%, 1.0%, and 1.2% on the VUA-18(10k), VUA-20(16k), and MOH-X(0.6k) datasets, respectively.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 1","pages":"Article 103946"},"PeriodicalIF":7.4000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324003054","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Metaphor is pervasive in our life, there is roughly one metaphor every three sentences on average in our daily conversations. Previous metaphor identification researches in NLP have rarely focused on similarity between concepts from different domains. In this paper, we propose a Concept Knowledge Enhanced Metaphor Identification Framework (CKEMI) to model similarity between concepts from different domains. First, we construct the descriptive concept word set and the inter-word relation concept word set by selecting knowledge from the ConceptNet knowledge base. Then, we devise two hierarchical relation concept graph networks to refine inter-word relation concept knowledge. Next, we design the concept consistency mapping function to constrain the representation of inter-word relation concept and learn similarity information between concepts. Finally, we construct the target domain semantic scene by integrating the representation of inter-word relation concept knowledge for metaphor identification. Specifically, the F1 score of CKEMI is superior to the state-of-the-art (SOTA) methods, achieving improvements of over 0.5%, 1.0%, and 1.2% on the VUA-18(10k), VUA-20(16k), and MOH-X(0.6k) datasets, respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CKEMI:概念知识增强隐喻识别框架
隐喻在我们的生活中无处不在,在我们的日常对话中,平均每三句话就有一个隐喻。以往的 NLP 隐喻识别研究很少关注不同领域概念之间的相似性。在本文中,我们提出了一个概念知识增强隐喻识别框架(CKEMI)来模拟不同领域概念之间的相似性。首先,我们从 ConceptNet 知识库中选取知识,构建描述性概念词集和词间关系概念词集。然后,我们设计了两个分层关系概念图网络来提炼词间关系概念知识。接着,我们设计了概念一致性映射函数来约束词间关系概念的表示,并学习概念间的相似性信息。最后,我们通过整合词间关系概念知识表征来构建目标域语义场景,从而实现隐喻识别。具体来说,CKEMI的F1得分优于最先进的(SOTA)方法,在VUA-18(10k)、VUA-20(16k)和MOH-X(0.6k)数据集上分别提高了0.5%、1.0%和1.2%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Unsupervised Adaptive Hypergraph Correlation Hashing for multimedia retrieval Enhancing robustness in implicit feedback recommender systems with subgraph contrastive learning Domain disentanglement and fusion based on hyperbolic neural networks for zero-shot sketch-based image retrieval Patients' cognitive and behavioral paradoxes in the process of adopting conflicting health information: A dynamic perspective Study of technology communities and dominant technology lock-in in the Internet of Things domain - Based on social network analysis of patent network
×
引用
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