Parsing Algebraic Word Problems into Equations

By Rik Koncel-Kedziorski, Hannaneh Hajishirzi, Ashish Sabharwal, Oren Etzioni, Siena Dumas Ang. 2015

366 citations recorded by the source corpus.

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 previous work and show that it covers the full gamut of arithmetic operations whereas Hosseini et al. (2014) only handle addition and subtraction. In addition, Alges overcomes the brittleness of the Kushman et al. (2014) approach on single-equation problems, yielding a 15% to 50% reduction in error.

Subfields: Artificial Intelligence, Information Systems, Natural Language Processing

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Hannaneh Hajishirzi
  3. Luke S. Zettlemoyer
  4. Jianfeng Gao
  5. Jonathan Berant
  6. Percy Liang
  7. Yejin Choi
  8. Matt Gardner

In Information Systems

  1. Lei Wang
  2. Hannaneh Hajishirzi
  3. Peter Clark
  4. Dongxiang Zhang
  5. Chitta Baral
  6. Ashish Sabharwal
  7. Matt Gardner
  8. Bing Tian Dai

In Natural Language Processing

  1. Hannaneh Hajishirzi
  2. Mohit Bansal
  3. Jonathan Berant
  4. Matt Gardner
  5. Ashish Sabharwal
  6. Peter Clark
  7. Luke S. Zettlemoyer
  8. Yejin Choi

Citations in the corpus