Learning To Use Formulas To Solve Simple Arithmetic Problems
Summary
The paper splits solving addition/subtraction word problems into two steps: recognise which abstract formula describes the story, then turn the filled-in formula into an equation mechanically. Three formulas suffice for this class: part-whole, change (start, end, gains, losses) and comparison (more, less, difference). Each formula is a template with slots; the system enumerates all assignments of the problem's numbers and the unknown to the slots and scores them with a log-linear model trained on formula-plus-variable annotations. Features are hand-crafted logical cues about agreement of type, verb, subject and tense between quantities, plus hyponymy and antonymy from ConceptNet and WordNet. On the AddSub dataset it outperforms the earlier systems it compares against. Limitations include one formula application per problem, modal verbs, missing world knowledge and parser errors.
How Mova uses it
- Rates and units — the comparison formula is the source of a first-level link "compare → subtract": questions of the form "how many more / fewer" are explained as a difference, i.e. subtraction.
- The link sits next to other concept links (rate → multiply/divide, total → add, share → divide) used by the math solver in
mathto explain its steps in words ("comparison → subtraction") rather than to force a search decision.
Effectiveness in Mova
Not measured separately. The link was added as part of a batch of concepts from the solver's "teach me" reports (noun categories, comparison → subtraction, share equally → division, rate → division); together they raised step-explanation coverage on SVAMP from 38% to 62% (214 of 344) with accuracy unchanged at 57.3%. The individual contribution of the comparison link is not isolated.
👨🔬💥
Cite
@inproceedings{mitra2016learning,
title = {{Learning To Use Formulas To Solve Simple Arithmetic Problems}},
author = {Mitra, Arindam and Baral, Chitta},
booktitle = {Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)},
year = {2016},
doi = {10.18653/v1/p16-1202},
url = {https://doi.org/10.18653/v1/p16-1202}
}References
- Eneko Agirre, Mona Diab, Daniel Cer, and Aitor Gonzalez-Agirre. 2012. Semeval-2012 task 6: A pilot on semantic textual similarity. In Proceedings of the First Joint Conference on Lexical and Computational Semantics-Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proce… find
- Daniel G Bobrow. 1964a. Natural language input for a computer problem solving system. find
- Daniel G. Bobrow. 1964b. A question-answering system for high school algebra word problems. In Proceedings of the October 27-29, 1964, Fall Joint Computer Conference, Part I, AFIPS ’64 (Fall, part I), pages 591–614, New York, NY, USA. ACM. find
- Walter Kintsch and James G Greeno. 1985. Understanding and solving word arithmetic problems. Psychological review, 92(1):109. find
- Rik Koncel-Kedziorski, Hannaneh Hajishirzi, Ashish Sabharwal, Oren Etzioni, and Siena Dumas Ang. 2015. Parsing algebraic word problems into equations. Transactions of the Association for Computational Linguistics, 3:585–597. find
- Nate Kushman, Yoav Artzi, Luke Zettlemoyer, and Regina Barzilay. 2014. Learning to automatically solve algebra word problems. Association for Computational Linguistics. find
- Hector J Levesque. 2011. The winograd schema challenge. find
- Hugo Liu and Push Singh. 2004. Conceptneta practical commonsense reasoning tool-kit. BT technology journal, 22(4):211–226. find
- Samuel R Bowman, Gabor Angeli, Christopher Potts, and Christopher D Manning. 2015. A large annotated corpus for learning natural language inference. arXiv preprint arXiv:1508.05326. find
- Christopher D Manning, Mihai Surdeanu, John Bauer, Jenny Rose Finkel, Steven Bethard, and David Mc-Closky. 2014. The stanford corenlp natural language processing toolkit. In ACL (System Demonstrations), pages 55–60. find
- Peter Clark and Oren Etzioni. 2016. My computer is an honor student but how intelligent is it? standardized tests as a measure of ai. AI Magazine.(To appear). find
- George A Miller. 1995. Wordnet: a lexical database for english. Communications of the ACM, 38(11):39–41. find our card
- Peter Clark. 2015. Elementary school science and math tests as a driver for ai: Take the aristo challenge! In AAAI, pages 4019–4021. find
- Anirban Mukherjee and Utpal Garain. 2008. A review of methods for automatic understanding of natural language mathematical problems. Artificial Intelligence Review, 29(2):93–122. find
- Ido Dagan, Bill Dolan, Bernardo Magnini, and Dan Roth. 2010. Recognizing textual entailment: Rational, evaluation and approaches–erratum. Natural Language Engineering, 16(01):105–105. find
- Matthew Richardson, Christopher JC Burges, and Erin Renshaw. 2013. Mctest: A challenge dataset for the open-domain machine comprehension of text. In EMNLP, volume 1, page 2. find our card
- Marie-Catherine De Marneffe and Christopher D Manning. 2008. Stanford typed dependencies manual. Technical report, Technical report, Stanford University. find
- Edward A Feigenbaum and Julian Feldman. Computers and thought. 1963. find
- Charles R Fletcher. 1985. Understanding and solving arithmetic word problems: A computer simulation. Behavior Research Methods, Instruments, & Computers, 17(5):565–571. find
- Dan A Hinsley, John R Hayes, and Herbert A Simon. 1977. From words to equations: Meaning and representation in algebra word problems. Cognitive processes in comprehension, 329. find
- Mohammad Javad Hosseini, Hannaneh Hajishirzi, Oren Etzioni, and Nate Kushman. 2014. Learning to solve arithmetic word problems with verb categorization. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 523–533. find our card
- Subhro Roy and Dan Roth. 2015. Solving general arithmetic word problems. EMNLP. find our card
- Shuming Shi, Yuehui Wang, Chin-Yew Lin, Xiaojiang Liu, and Yong Rui. 2015. Automatically solving number word problems by semantic parsing and reasoning. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), Lisbon, Portugal. find
- Robert Speer and Catherine Havasi. 2013. Conceptnet 5: A large semantic network for relational knowledge. In The Peoples Web Meets NLP, pages 161– 176. Springer. find
- Jason Weston, Antoine Bordes, Sumit Chopra, and Tomas Mikolov. 2015. Towards ai-complete question answering: A set of prerequisite toy tasks. arXiv preprint arXiv:1502.05698. find our card
- Lipu Zhou, Shuaixiang Dai, and Liwei Chen. 2015. Learn to solve algebra word problems using quadratic programming. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 817–822. find
This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/mitra-2016-learning-use-formulas-solve-simple/