CLAIApr 16, 2023

Solving Math Word Problems by Combining Language Models With Symbolic Solvers

Stanford
arXiv:2304.09102v1154 citationsh-index: 75Has Code
Originality Incremental advance
AI Analysis

This work addresses the challenge of generating step-by-step solutions for complex math word problems, particularly in education, though it is incremental in improving existing methods.

The authors tackled the problem of solving math word problems by combining language models with symbolic solvers, achieving comparable accuracy to PAL on GSM8K and outperforming it by 20% on the ALGEBRA dataset.

Automatically generating high-quality step-by-step solutions to math word problems has many applications in education. Recently, combining large language models (LLMs) with external tools to perform complex reasoning and calculation has emerged as a promising direction for solving math word problems, but prior approaches such as Program-Aided Language model (PAL) are biased towards simple procedural problems and less effective for problems that require declarative reasoning. We propose an approach that combines an LLM that can incrementally formalize word problems as a set of variables and equations with an external symbolic solver that can solve the equations. Our approach achieves comparable accuracy to the original PAL on the GSM8K benchmark of math word problems and outperforms PAL by an absolute 20% on ALGEBRA, a new dataset of more challenging word problems extracted from Algebra textbooks. Our work highlights the benefits of using declarative and incremental representations when interfacing with an external tool for solving complex math word problems. Our data and prompts are publicly available at https://github.com/joyheyueya/declarative-math-word-problem.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes