| Challenge: | Existing models for solving math word problems rely on predefined rules or feature engineering. |
| Approach: | They propose to incorporate copy and alignment mechanism into the sequence-to-sequence model to address two shortcomings . they use model output as a feature and incorporate it into the feature-based model to explore the effectiveness . |
| Outcome: | The proposed model outperforms the state-of-the-art models on the problem solving task. |
Similar Papers
MathQA: Towards Interpretable Math Word Problem Solving with Operation-Based Formalisms (N19-1)
Copied to clipboard
| Challenge: | Existing datasets in this domain do not offer precise operational annotations over diverse problem types due to noise and lack of formal operation-based representations. |
| Approach: | They propose a representation language to map problems to their operation programs . they also introduce an interpretable neural math problem solver . |
| Outcome: | The proposed model outperforms baseline models and the AQUA-RAT dataset on the AQuA-rat dataset. |
Recall and Learn: A Memory-augmented Solver for Math Word Problems (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for solving math word problems are based on template-based generation which results in limited generalization capability. |
| Approach: | They propose a human-like analogical learning method for the math word problem . it uses modules of memory, representation, analogy, and reasoning to make a new exercise . |
| Outcome: | The proposed method outperforms state-of-the-art models on two well-known datasets. |
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. |
Semantically-Aligned Equation Generation for Solving and Reasoning Math Word Problems (N19-1)
Copied to clipboard
| Challenge: | Existing methods to solve math word problems require accurate natural language understanding to bridge texts and math expressions. |
| Approach: | They propose a neural approach to automatically solve math word problems by operating symbols according to their semantic meanings in texts. |
| Outcome: | The proposed model outperforms state-of-the-art models and the best non-retrieval-based models over 10% accuracy in a Math23K dataset. |
ATHENA: Mathematical Reasoning with Thought Expansion (2023.emnlp-main)
Copied to clipboard
| Challenge: | a mathematical word problem requires a method that articulates the problem, the lens through which models view human lexical expressions. |
| Approach: | They propose a method to mimic human thought expansion mechanisms to generate thought expansions . they show ATHENA can be used to generate reasonable thoughts by selecting valid pathways . |
| Outcome: | The proposed model is compelling in variant questions even when the informativeness in training examples is restricted. |
Solving Math Word Problems with Multi-Encoders and Multi-Decoders (2020.coling-main)
Copied to clipboard
| Challenge: | Existing models that transform text descriptions into equation expressions only consider input/output objects as sequences, ignoring important structural information contained in text descriptions and equation expression. |
| Approach: | They propose a model that uses sequence-based encoders and graph-based decoders to enhance the representation of text descriptions and generate different equation expressions. |
| Outcome: | The proposed model outperforms existing state-of-the-art methods on a dataset with a n-word problem. |
Learning to Reason Deductively: Math Word Problem Solving as Complex Relation Extraction (2022.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to solve math word problems do not provide explanations for generated expressions. |
| Approach: | They propose a deductive approach that presents explainable deductive reasoning steps to iteratively construct target expressions. |
| Outcome: | The proposed model significantly outperforms existing strong baselines on four benchmark datasets. |
Mapping probability word problems to executable representations (2021.emnlp-main)
Copied to clipboard
Simon Suster, Pieter Fivez, Pietro Totis, Angelika Kimmig, Jesse Davis, Luc de Raedt, Walter Daelemans
| Challenge: | a recent paper addresses the problem of solving math word problems automatically . a number of approaches have been proposed for solving word problems . |
| Approach: | They employ a sequence-to-sequence model to generate intermediate representations for word problems . they then use a probabilistic programming system to provide the answer . their best performing model incorporates general-domain contextualised word representations . |
| Outcome: | The proposed model is the best performing on a declarative language and a probabilistic programming system. |
Learning Multi-Step Reasoning by Solving Arithmetic Tasks (2023.acl-short)
Copied to clipboard
| Challenge: | Recent studies have demonstrated large LMs’ impressive performance in solving math problems, but such ability seems only to emerge from models with abundant parameters. |
| Approach: | They propose to continuously pre-train LMs with the capabilities of multi-step reasoning by continuously pretraining them on a synthetic dataset MsAT. |
| Outcome: | The proposed method improves LMs' multi-step reasoning abilities on four math word problem datasets. |
Textual Enhanced Contrastive Learning for Solving Math Word Problems (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent studies show that current models rely on shallow heuristics to predict solutions . a textual Enhanced Contrastive Learning framework enforces the models to distinguish semantically similar examples while holding different mathematical logic. |
| Approach: | They propose a textual Enhanced Contrastive Learning framework which enforces models to distinguish semantically similar examples while holding different mathematical logic. |
| Outcome: | The proposed framework improves on benchmark and challenge datasets in English and Chinese. |