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.

Similar Papers

An Expression Tree Decoding Strategy for Mathematical Equation Generation (2023.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to generate mathematical equations from natural language ignore parallel or dependent relations between math expressions.
Approach: They propose to integrate tree structure into the expression-level generation and advocate an expression tree decoding strategy.
Outcome: The proposed method outperforms baseline methods for generating mathematical equations from natural language.
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.
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.
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 .
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.
Graph-to-Tree Neural Networks for Learning Structured Input-Output Translation with Applications to Semantic Parsing and Math Word Problem (2020.findings-emnlp)

Copied to clipboard

Challenge: Graph2Tree model encodes graph-structured input and decodes tree-structures output.
Approach: They propose a novel Graph-to-Tree Neural Network consisting of a graph encoder and a hierarchical tree decoder that encodes an augmented graph-structured input and decodes a tree-structure-output.
Outcome: The proposed model outperforms or matches the performance of other state-of-the-art models on two problems, neural semantic parsing and math word problem.
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.
Generating Equation by Utilizing Operators : GEO model (2020.coling-main)

Copied to clipboard

Challenge: Existing neural models that use hand-crafted features are expensive and lack domain-specific knowledge.
Approach: They propose a GEO model that uses operator-based features to generate equations using natural language sentences.
Outcome: The proposed model outperforms state-of-the-art models on two datasets and 82.1% in ALG514.
Seeking Diverse Reasoning Logic: Controlled Equation Expression Generation for Solving Math Word Problems (2022.aacl-short)

Copied to clipboard

Challenge: Existing methods to solve Math Word Problems rely on human annotation . empirical results suggest that our method universally improves the performance on single-unknown and multiple-un unknown benchmarks.
Approach: They propose a controlled equation generation solver by leveraging a set of control codes to guide the model to consider certain reasoning logic and decode the corresponding equations expressions transformed from the human reference.
Outcome: The proposed method improves performance on single-unknown and multiple-un unknown benchmarks with 13.2% accuracy on the challenging multiple-unequal datasets.
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.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations