Non-Autoregressive Math Word Problem Solver with Unified Tree Structure (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing MWP solvers do not handle variants that can be derived via mathematical manipulation. |
| Approach: | They propose a non-autoregressive solver to present a solution expression and decode it from a given problem description. |
| Outcome: | The proposed solver is able to decode multiple expression variants and correct them . it is based on a unified tree structure and is available on Math23K and MAWPS. |
Similar Papers
Structure-Unified M-Tree Coding Solver for Math Word Problem (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing models that take into account the binary tree structure of mathematical expressions have achieved better performance, but the output space is non-deterministic. |
| Approach: | They propose a Structure-Unified M-Tree Coding Solver which applies a tree with any M branches to unify the output structures. |
| Outcome: | The proposed model outperforms several state-of-the-art models under similar experimental conditions and performs much better under low-resource conditions. |
Semantically-Aligned Universal Tree-Structured Solver for Math Word Problems (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models focus on one-unknown linear MWPs. |
| Approach: | They propose a universal expression tree-structured solver that integrates multiple expression trees underlying a MWP into a single expression tree. |
| Outcome: | The proposed method outperforms state-of-the-art models on a MWPs dataset and generates a universal expression tree explicitly by deciding which symbol to generate . |
Noun-MWP: Math Word Problems Meet Noun Answers (2022.coling-1)
Copied to clipboard
| Challenge: | Existing MWP solvers can handle Noun-MWPs, but they are not as efficient as other models. |
| Approach: | They propose a method to empower existing MWP solvers to handle Noun-MWPs. |
| Outcome: | The proposed model solves Noun-MWPs significantly better than other models and solves conventional MWP problems as well. |
Sequence to General Tree: Knowledge-Guided Geometry Word Problem Solving (2021.acl-short)
Copied to clipboard
| Challenge: | Existing neural solvers only generate binary expression trees that contain basic arithmetic operators and do not explicitly use the math formulas. |
| Approach: | They propose a sequence-to-general tree that generates interpretable and executable operation trees where nodes can be formulas with an arbitrary number of arguments. |
| Outcome: | The proposed tree generates interpretable and executable operation trees with formulas with an arbitrary number of arguments. |
Tree-structured Decoding for Solving Math Word Problems (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to solve math word problems do not consider an abstract syntax tree. |
| Approach: | They propose a tree-structured decoding method that generates an abstract syntax tree of an equation in a top-down manner and can stop during decoding without a redundant stop token. |
| Outcome: | The proposed method achieves state-of-the-art performance on the largest dataset on this task. |
Math Word Problem Solving by Generating Linguistic Variants of Problem Statements (2023.acl-srw)
Copied to clipboard
Syed Rifat Raiyan, Md Nafis Faiyaz, Shah Md. Jawad Kabir, Mohsinul Kabir, Hasan Mahmud, Md Kamrul Hasan
| Challenge: | Existing models for solving Math Word Problems depend on shallow heuristics and spurious correlations to derive the solution expressions. |
| Approach: | They propose a framework for MWP solvers based on generation of linguistic variants of problem text. |
| Outcome: | The proposed framework improves the mathematical reasoning and robustness of the proposed model. |
Graph-to-Tree Learning for Solving Math Word Problems (2020.acl-main)
Copied to clipboard
| Challenge: | Existing tree-based neural models do not capture the relationships and order information among the quantities well. |
| Approach: | They propose a novel deep learning architecture that combines the merits of the graph-based encoder and tree-based decoder to generate better solution expressions. |
| Outcome: | The proposed framework outperforms the state-of-the-art on two available datasets significantly. |
Are NLP Models really able to Solve Simple Math Word Problems? (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing solvers for math word problems often achieve high performance on benchmark datasets . existing models rely on shallow heuristics to achieve high accuracy . |
| Approach: | They restrict their attention to English MWPs taught in grades four and lower . they propose a challenge dataset to test the accuracy of MWp solvers . |
| Outcome: | The proposed model can solve a large fraction of MWPs even with shallow heuristics . the proposed model is much lower on the challenge dataset SVAMP . |
Translating a Math Word Problem to a Expression Tree (D18-1)
Copied to clipboard
| Challenge: | Sequence-to-sequence (SEQ2SEQ) models have been successfully applied to automatic math word problem solving. |
| Approach: | They propose an equation normalization method to normalize duplicated equations and propose an ensemble model to combine their advantages. |
| Outcome: | The proposed model outperforms the previous state-of-the-art models on the math word problem solving. |
Generate & Rank: A Multi-task Framework for Math Word Problems (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies formalize MWP as a generation task but mathematical expressions are prone to minor mistakes. |
| Approach: | They propose a ranking task for math word problem (MWP) that learns from its own mistakes and distinguishes between correct and incorrect expressions. |
| Outcome: | The proposed model outperforms baselines on the classical Math23k dataset and is 7% higher than the state-of-the-art. |