Improving a Graph-to-Tree Model for Solving Math Word Problems

In the area of Math Word Problem (MWP), various methods based on deep learning technology have been actively researched. Graph-to-Tree (Graph2Tree) is one of those methods which uses a graph-based encoder and a tree-based decoder to understand the word problem and to generate a valid equation. This method is proven to be well-performed by achieving state-of-the-art on several benchmarks. However, on the benchmark of SVAMP, recent methods including Sequence-to-Sequence (Seq2Seq), Goal-driven Tree-Structured MWP Solver (GTS), and Graph2Tree performs poorly, unable to cope with several variation types that requires natural language comprehension capability. In this paper, we propose an improved version of Graph2Tree which considers the characteristics of natural language to understand the word problems. On top of the original Graph2Tree model, we additionally build Dependency Graph and enhance the Quantity Cell Graph to Softly Expanded Quantity Cell Graph. This helps a graph-based encoder to capture the relationship among words. Also, we introduce question embedding for the tree-based decoder to generate equation based on the question given as input. We conduct experiments to evaluate our model against the original Graph2Tree model on three available datasets: MAWPS, ASDiv-A, and SVAMP. We also present case studies to qualitatively examine the effectiveness of the methods and showed that our methods have improved the original Graph2Tree model.