| Login
dc.contributor.author | Raiyan, Syed Rifat | |
dc.contributor.author | Faiyaz, Md. Nafis | |
dc.contributor.author | Kabir, Shah Md. Jawad | |
dc.date.accessioned | 2024-04-19T10:30:56Z | |
dc.date.available | 2024-04-19T10:30:56Z | |
dc.date.issued | 2023-05-30 | |
dc.identifier.uri | http://hdl.handle.net/123456789/2092 | |
dc.description | Supervised by Mr. Md. Mohsinul Kabir, Assistant Professor, Systems and Software Lab (SSL), Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Dr. Hasan Mahmud, Associate Professor, Systems and Software Lab (SSL), Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Dr. Md. Kamrul Hasan, Professor, Systems and Software Lab (SSL), Department of Computer Science and Engineering (CSE), Islamic University of Technology (IUT), Board Bazar, Gazipur-1704, Bangladesh | en_US |
dc.description.abstract | The art of mathematical reasoning stands as one of the most fundamental pillars of intellectual and scientific advancement, being a central catalyst in the cultivation of human ingenuity. Researchers have recently published a plethora of research works centered around the task of solving Math Word Problems (MWP). These existing models are susceptible to dependency on shallow heuristics and spurious correlations to derive the solution expressions. In order to ameliorate this issue, in this paper, we propose a framework for MWP solvers based on the generation of linguistic variants of the problem text. The approach involves solving each of the variant problems and electing the predicted expression with the majority of the votes. We use DeBERTa (Decoding-enhanced BERT with disentangled attention) as the encoder to leverage its rich textual representations and enhanced mask decoder to construct the solution expressions. Furthermore, we introduce a challenging dataset, ParaMAWPS, consisting of paraphrased, adversarial, and inverse variants of selectively sampled MWPs from the benchmark Mawps dataset. We extensively experiment on this dataset along with other benchmark datasets using some baseline MWP solver models. We show that training on linguistic variants of problem statements and voting on candidate predictions improve the mathematical reasoning and robustness of the model. We make our code and data publicly available at — https://github. com/Starscream-11813/Variational-Mathematical-Reasoning | en_US |
dc.language.iso | en | en_US |
dc.publisher | Department of Computer Science and Engineering(CSE), Islamic University of Technology(IUT), Board Bazar, Gazipur-1704, Bangladesh | en_US |
dc.subject | math word problem, natural language processing, paraphrasing, challenge dataset, DeBERTa, GPT-3, mathematical reasoning, linguistic varia | en_US |
dc.title | Variational Mathematical Reasoning: Enhancing Math Word Problem Solvers with Linguistic Variants and Disentangled Attention | en_US |
dc.type | Thesis | en_US |