Solving Arithmetic Word Problems of Entailing Deep Implicit Relations by Qualia Syntax-Semantic Model

Hao Meng, Xinguo Yu, Bin He, Litian Huang, Liang Xue, Zongyou Qiu
{"title":"Solving Arithmetic Word Problems of Entailing Deep Implicit Relations by Qualia Syntax-Semantic Model","authors":"Hao Meng, Xinguo Yu, Bin He, Litian Huang, Liang Xue, Zongyou Qiu","doi":"10.32604/cmc.2023.041508","DOIUrl":null,"url":null,"abstract":"Solving arithmetic word problems that entail deep implicit relations is still a challenging problem. However, significant progress has been made in solving Arithmetic Word Problems (AWP) over the past six decades. This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations (DIR-AWP), such as entailing commonsense or subject-domain knowledge involved in the problem-solving process. This paper proposes to take three steps to solve DIR-AWPs, in which the first three steps are used to conduct the qualia inference process. The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic (S<sup>2</sup>) method from the given problem. The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models, respectively. The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations. The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities. The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.","PeriodicalId":93535,"journal":{"name":"Computers, materials & continua","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers, materials & continua","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.32604/cmc.2023.041508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Solving arithmetic word problems that entail deep implicit relations is still a challenging problem. However, significant progress has been made in solving Arithmetic Word Problems (AWP) over the past six decades. This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations (DIR-AWP), such as entailing commonsense or subject-domain knowledge involved in the problem-solving process. This paper proposes to take three steps to solve DIR-AWPs, in which the first three steps are used to conduct the qualia inference process. The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic (S2) method from the given problem. The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models, respectively. The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations. The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities. The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用Qualia语法语义模型求解深层隐含关系的算术词问题
求解包含深层隐式关系的算术问题仍然是一个具有挑战性的问题。然而,在过去的六十年里,在解决算术字问题(AWP)方面取得了重大进展。本文提出通过类推理来发现深度隐式关系,以解决涉及深度隐式关系(DIR-AWP)的算术词问题,例如问题解决过程中涉及的常识或学科领域知识。本文提出了三个步骤来解决dir - awp,其中前三个步骤用于进行质性推理过程。第一步使用准备好的质量-数量模型集,从语法-语义(S2)方法从给定问题中提取的显式关系中识别质量场景。第二步,分别使用识别出的质场景和质量模型,依次添加缺失实体和深层隐含关系。第三步,通过对所有获得的关系的等价依赖图的多余分支进行剪枝,提取出解决给定问题的关系。该研究提出了一种结合显性和隐性知识来提高推理能力的综合方法,为该领域做出了贡献。在Math23K上的实验结果表明,该算法在求解需要深度隐式关系的awp时优于基线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Smart Heart Disease Diagnostic System Using Deep Vanilla LSTM Retraction:A Hybrid Modified Sine CosineAlgorithm Using Inverse Filtering andClipping Methods forLow AutocorrelationBinary Sequences A Review of Smart Contract Blockchain Based on Multi-Criteria Analysis: Challenges and Motivations BLECA: A Blockchain-Based Lightweight and Efficient Cross-Domain Authentication Scheme for Smart Parks Internet of Things (IoT) Security Enhancement Using XGboost Machine Learning Techniques
×
引用
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