一种自动求解集合论词问题的新方法

Arushi Gupta, Medha Sagar, Rishabh Kaushal
{"title":"一种自动求解集合论词问题的新方法","authors":"Arushi Gupta, Medha Sagar, Rishabh Kaushal","doi":"10.1109/IC3.2018.8530494","DOIUrl":null,"url":null,"abstract":"Mathematical Word Problems (MWPs) are verbal formulations of real-world scenarios representing an abstract mathematical idea. They aid us in demonstrating the relevance of mathematics in extrapolating everyday tasks. Set Theory is a field of mathematics that is used to discern the nature of sets and the relations between them. Set-theory operations are binary in nature. They are used to depict the type of association between two sets. In the current scenario, the difference in the levels of abstraction of deriving regular expressions and interpreting natural language poses a challenging task. In this paper, we present a novel approach to solve set-theory based word problems automatically using the semantics of the language. Our system analyzes set-theory questions obtained from various sources of informal text that are crowd sourced such as online forums, social media and competitive examination portals and computes the result by discerning the language of the problem. Our algorithm mimics the paradigm through which humans attempt to solve set-theory MWPs. We discretized our approach into two sub-tasks, information extraction and problem solving, implementing separate evaluation for each stage and subsequently ensuring that the error propagation from one phase to the next is curbed and efficiency for each stage can be individually determined. Our system uses language semantics to identify the set entities in a word problem, and subsequently maps these entities in an expression that embodies the problem. In the problem solving phase, we obtain the final result of the word problem by inferring the relation that is to be determined and implementing the corresponding set-theory function to compute the solution. We corroborated our result for the two phases individually using supervised learning. In the information extraction phase, our system exhibited an accuracy of 83.5% and its performance in the problem solving phase is 60%, which though needs improvement but is a good beginning.","PeriodicalId":118388,"journal":{"name":"2018 Eleventh International Conference on Contemporary Computing (IC3)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Novel Approach to Solve Set-Theory Word Problems Automatically\",\"authors\":\"Arushi Gupta, Medha Sagar, Rishabh Kaushal\",\"doi\":\"10.1109/IC3.2018.8530494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mathematical Word Problems (MWPs) are verbal formulations of real-world scenarios representing an abstract mathematical idea. They aid us in demonstrating the relevance of mathematics in extrapolating everyday tasks. Set Theory is a field of mathematics that is used to discern the nature of sets and the relations between them. Set-theory operations are binary in nature. They are used to depict the type of association between two sets. In the current scenario, the difference in the levels of abstraction of deriving regular expressions and interpreting natural language poses a challenging task. In this paper, we present a novel approach to solve set-theory based word problems automatically using the semantics of the language. Our system analyzes set-theory questions obtained from various sources of informal text that are crowd sourced such as online forums, social media and competitive examination portals and computes the result by discerning the language of the problem. Our algorithm mimics the paradigm through which humans attempt to solve set-theory MWPs. We discretized our approach into two sub-tasks, information extraction and problem solving, implementing separate evaluation for each stage and subsequently ensuring that the error propagation from one phase to the next is curbed and efficiency for each stage can be individually determined. Our system uses language semantics to identify the set entities in a word problem, and subsequently maps these entities in an expression that embodies the problem. In the problem solving phase, we obtain the final result of the word problem by inferring the relation that is to be determined and implementing the corresponding set-theory function to compute the solution. We corroborated our result for the two phases individually using supervised learning. In the information extraction phase, our system exhibited an accuracy of 83.5% and its performance in the problem solving phase is 60%, which though needs improvement but is a good beginning.\",\"PeriodicalId\":118388,\"journal\":{\"name\":\"2018 Eleventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Eleventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2018.8530494\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Eleventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2018.8530494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

数学字词问题(mwp)是对现实世界场景的口头表述,表示抽象的数学概念。它们帮助我们展示了数学在推断日常任务中的相关性。集合论是数学的一个领域,用来辨别集合的性质和它们之间的关系。集合论运算本质上是二元的。它们用于描述两个集合之间的关联类型。在当前的场景中,派生正则表达式和解释自然语言的抽象层次的差异构成了一项具有挑战性的任务。在本文中,我们提出了一种利用语言语义自动解决基于集合论的词问题的新方法。我们的系统分析从各种非正式文本来源(如在线论坛、社交媒体和竞争性考试门户网站)获得的集合论问题,并通过识别问题的语言来计算结果。我们的算法模仿了人类试图解决集合论mwp的范例。我们将我们的方法离散为两个子任务,信息提取和问题解决,对每个阶段实施单独的评估,随后确保从一个阶段到下一个阶段的错误传播得到抑制,并且每个阶段的效率可以单独确定。我们的系统使用语言语义来识别单词问题中的一组实体,然后将这些实体映射到体现问题的表达式中。在问题求解阶段,我们通过推断待确定的关系,并实现相应的集合论函数来计算解,从而得到词问题的最终结果。我们使用监督学习分别验证了这两个阶段的结果。在信息提取阶段,系统的准确率为83.5%,在问题求解阶段的准确率为60%,虽然还需要改进,但这是一个良好的开端。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Novel Approach to Solve Set-Theory Word Problems Automatically
Mathematical Word Problems (MWPs) are verbal formulations of real-world scenarios representing an abstract mathematical idea. They aid us in demonstrating the relevance of mathematics in extrapolating everyday tasks. Set Theory is a field of mathematics that is used to discern the nature of sets and the relations between them. Set-theory operations are binary in nature. They are used to depict the type of association between two sets. In the current scenario, the difference in the levels of abstraction of deriving regular expressions and interpreting natural language poses a challenging task. In this paper, we present a novel approach to solve set-theory based word problems automatically using the semantics of the language. Our system analyzes set-theory questions obtained from various sources of informal text that are crowd sourced such as online forums, social media and competitive examination portals and computes the result by discerning the language of the problem. Our algorithm mimics the paradigm through which humans attempt to solve set-theory MWPs. We discretized our approach into two sub-tasks, information extraction and problem solving, implementing separate evaluation for each stage and subsequently ensuring that the error propagation from one phase to the next is curbed and efficiency for each stage can be individually determined. Our system uses language semantics to identify the set entities in a word problem, and subsequently maps these entities in an expression that embodies the problem. In the problem solving phase, we obtain the final result of the word problem by inferring the relation that is to be determined and implementing the corresponding set-theory function to compute the solution. We corroborated our result for the two phases individually using supervised learning. In the information extraction phase, our system exhibited an accuracy of 83.5% and its performance in the problem solving phase is 60%, which though needs improvement but is a good beginning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信