Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conferen 2019
DOI: 10.18653/v1/d19-1241
|View full text |Cite
|
Sign up to set email alerts
|

Tree-structured Decoding for Solving Math Word Problems

Abstract: Automatically solving math word problems is an interesting research topic that needs to bridge natural language descriptions and formal math equations. Previous studies introduced end-to-end neural network methods, but these approaches did not efficiently consider an important characteristic of the equation, i.e., an abstract syntax tree. To address this problem, we propose a tree-structured decoding method that generates the abstract syntax tree of the equation in a top-down manner. In addition, our approach … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
45
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 63 publications
(60 citation statements)
references
References 21 publications
0
45
0
Order By: Relevance
“…S2S (Wang et al, 2018a) is a standard bidirectional LSTM-based seq2seq model with an attention mechanism. RecursiveNN uses a recursive neural network on the predicted tree structure templates Tree-Decoder (Liu et al, 2019) is a seq2tree model with a tree structured decoder. The decoder generates each node based on its parent node and its sibling node.…”
Section: Baselinesmentioning
confidence: 99%
See 1 more Smart Citation
“…S2S (Wang et al, 2018a) is a standard bidirectional LSTM-based seq2seq model with an attention mechanism. RecursiveNN uses a recursive neural network on the predicted tree structure templates Tree-Decoder (Liu et al, 2019) is a seq2tree model with a tree structured decoder. The decoder generates each node based on its parent node and its sibling node.…”
Section: Baselinesmentioning
confidence: 99%
“…Math Word Problem Solving: In recent years, Seq2Seq has been widely used in math word problem solving tasks (Ling et al, 2017;Wang et al, 2017bWang et al, , 2018a. To better utilize expression structure information, recent studies have used Seq2Tree models (Liu et al, 2019;Zhang et al, 2020a). Xie and Sun (2019) proposed a tree structured decoder that uses a goal-driven approach to generate expression trees.…”
Section: Related Workmentioning
confidence: 99%
“…The idea of the tree-based decoder was proposed in (Liu et al, 2019;Xie and Sun, 2019). They changed the pattern of sequence generation from left to right and followed the top-down decoding process.…”
Section: Related Workmentioning
confidence: 99%
“…Group-ATT added different functional multi-head attentions to the Seq2Seq framework. AST-Dec (Liu et al, 2019) used TreeLSTM to realize top-down decoding process. GTS (Xie and Sun, 2019) followed goal-driven tree structure.…”
Section: Baselinesmentioning
confidence: 99%
See 1 more Smart Citation