| Autor: |
Sundaram, Sowmya S.1 (AUTHOR) sowmyassundaram@gmail.com, Gurajada, Sairam2 (AUTHOR), Padmanabhan, Deepak3 (AUTHOR), Abraham, Savitha Sam4 (AUTHOR), Fisichella, Marco1 (AUTHOR) |
| Předmět: |
|
| Zdroj: |
WIREs: Data Mining & Knowledge Discovery. Jul2024, Vol. 14 Issue 4, p1-27. 27p. |
| Abstrakt: |
From the latter half of the last decade, there has been a growing interest in developing algorithms for automatically solving mathematical word problems (MWP). It is a challenging and unique task that demands blending surface level text pattern recognition with mathematical reasoning. In spite of extensive research, we still have a lot to explore for building robust representations of elementary math word problems and effective solutions for the general task. In this paper, we critically examine the various models that have been developed for solving word problems, their pros and cons and the challenges ahead. In the last 2 years, a lot of deep learning models have recorded competing results on benchmark datasets, making a critical and conceptual analysis of literature highly useful at this juncture. We take a step back and analyze why, in spite of this abundance in scholarly interest, the predominantly used experiment and dataset designs continue to be a stumbling block. From the vantage point of having analyzed the literature closely, we also endeavor to provide a road‐map for future math word problem research. This article is categorized under:Technologies > Machine LearningTechnologies > Artificial IntelligenceFundamental Concepts of Data and Knowledge > Knowledge Representation [ABSTRACT FROM AUTHOR] |
| Databáze: |
Library, Information Science & Technology Abstracts |
| Externí odkaz: |
|
Plný text