EPT-X: An Expression-Pointer Transformer model that generates eXplanations for numbers
In this paper, we propose a neural model EPT-X (Expression-Pointer Transformer with Explanations), which utilizes natural language explanations to solve an algebraic word problem. To enhance the explainability of the encoding process of a neural model, EPT-X adopts the concepts of plausibility and faithfulness which are drawn from math word problem solving strategies by humans. A plausible explanation is one that includes contextual information for the numbers and variables that appear in a given math word problem. A faithful explanation is one that accurately represents the reasoning process behind the model’s solution equation. The EPT-X model yields an average baseline performance of 69.59% on our PEN dataset and produces explanations with quality that is comparable to human output. The contribution of this work is two-fold. (1) EPT-X model: An explainable neural model that sets a baseline for algebraic word problem solving task, in terms of model’s correctness, plausibility, and faithfulness. (2) New dataset: We release a novel dataset PEN (Problems with Explanations for Numbers), which expands the existing datasets by attaching explanations to each number/variable.
Code (1)
Tasks
MathMath Word Problem SolvingSimilar Papers 제목 키워드 기반
Image-to-image Neural Network for Addition and Subtraction of a Pair of Not Very Large Numbers
Looking back at the history of calculators, one can see that they become less functional and more computationally expensive over time. A modern calculator runs on a personal computer and is drawn at 60 fps only to help u…
Point to the Expression: Solving Algebraic Word Problems using the Expression-Pointer Transformer Model
Solving algebraic word problems has recently emerged as an important natural language processing task. To solve algebraic word problems, recent studies suggested neural models that generate solution equations by using {`…
Math Word Problem SolvingGlobal-to-local Memory Pointer Networks for Task-Oriented Dialogue
End-to-end task-oriented dialogue is challenging since knowledge bases are usually large, dynamic and hard to incorporate into a learning framework. We propose the global-to-local memory pointer (GLMP) networks to addres…
DecoderTask-Oriented Dialogue SystemsContext Transformer with Stacked Pointer Networks for Conversational Question Answering over Knowledge Graphs
Neural semantic parsing approaches have been widely used for Question Answering (QA) systems over knowledge graphs. Such methods provide the flexibility to handle QA datasets with complex queries and a large number of en…
Conversational Question AnsweringKnowledge GraphsLogical ReasoningQuestion Answering+1Noun-MWP: Math Word Problems Meet Noun Answers
We introduce a new type of problems for math word problem (MWP) solvers, named Noun-MWPs, whose answer is a non-numerical string containing a noun from the problem text. We present a novel method to empower existing MWP …
MathQuestion Answering