2015
DOI: 10.1162/tacl_a_00160
|View full text |Cite
|
Sign up to set email alerts
|

Parsing Algebraic Word Problems into Equations

Abstract: This paper formalizes the problem of solving multi-sentence algebraic word problems as that of generating and scoring equation trees. We use integer linear programming to generate equation trees and score their likelihood by learning local and global discriminative models. These models are trained on a small set of word problems and their answers, without any manual annotation, in order to choose the equation that best matches the problem text. We refer to the overall system as Alges. We compare Alges with pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
197
0
12

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 169 publications
(210 citation statements)
references
References 20 publications
1
197
0
12
Order By: Relevance
“…After that, Roy and Roth (2015) proposed an algorithmic approach which could handle arithmetic word problems with multiple steps and operations. Koncel-Kedziorski et al (2015) further Figure 1: The framework of our NumNet model. Our model consists of an encoding module, a reasoning module and a prediction module.…”
Section: Arithmetic Word Problem Solvingmentioning
confidence: 99%
“…After that, Roy and Roth (2015) proposed an algorithmic approach which could handle arithmetic word problems with multiple steps and operations. Koncel-Kedziorski et al (2015) further Figure 1: The framework of our NumNet model. Our model consists of an encoding module, a reasoning module and a prediction module.…”
Section: Arithmetic Word Problem Solvingmentioning
confidence: 99%
“…In contrast, our work is concerned with general-purpose textual entailment which considers if a given sentence can be inferred from another. Our work also relates to solving arithmetic word problems (Hosseini et al, 2014;Mitra and Baral, 2016;Zhou et al, 2015;Upadhyay et al, 2016;Huang et al, 2017;Kushman et al, 2014a;Koncel-Kedziorski et al, 2015;? ;Roy, 2017;.…”
Section: Related Workmentioning
confidence: 99%
“…Thus, our framework uses integer linear programming (ILP) to constrain the equation space. It is inspired by prior work on algebra word problems (Koncel-Kedziorski et al, 2015), with some key differences:…”
Section: Quantity Compositionmentioning
confidence: 99%
“…Semi-Markov Variant: Our first variant, namely QT(S), employs the semi-Markov assumption (Sarawagi and Cohen, 2005), where N nodes are removed. Different from QT which makes the first-order Markov assumption, QT(S) assumes L Model AddSub AS CN Hosseini et al (2014) 77.70 - 64.00 -Koncel- Kedziorski et al (2015) 77.00 - Roy and Roth (2015) 78.00 47.57 Zhou et al (2015) 53.14 51.48 Mitra and Baral (2016) 86.07 - Roy and Roth (2017) 60 . Figure 2, the token "There" in t may not belong to any spans.…”
Section: Model Variantsmentioning
confidence: 99%