In this website, you will find all materials for a tutorial on machine learning for automatic word problem solving. This will be held at the premier conference for machine learning in Europe, ECML - PKDD, at Würzburg, Germany from September 16 - 20, 2019.
In the recent past, and more specifically over the last five years, there has been a growing interest in applying machine learning techniques for understanding and solving mathematical word problems. Advances in this rapidly evolving field that seek to address an interesting but sophisticated task is yet to receive more widespread attention within the broader ML community. This tutorial aims to summarize this flourishing and growing field, focusing on two major trends of approaching this problem; viz., building probabilistic models and designing sequence-to-sequence (seq2seq) architectures. We will start by providing a concrete specification of the task and historical context comprising early approaches to the problem. We then cover the recent research within this field using our categorization across the two major families as alluded to earlier, and then offer perspectives on general trends and future evolution of the area.
A word problem is a textual description of a situation, followed by a pertinent question. The answer is a numerical quantity obtained after analysing the word problem. An example of a simple mathematical word problem appears below.
Word Problem: Kevin had 5 books. Kristen took 2 books from Kevin. How many books does he have now?
Equation: x = 5 - 2
Answer: 3
The complexity of the task may be evident if one observes that small changes to the word problem can change the meaning of the word problem. If the second statement was changed to 'Kristen gave 2 books to Kevin', the equation will change to x = 5 + 2. This makes it challenging for ML paradigms to solve such word problems. Also, the interplay between linguistic and mathematical cues needs specific attention, offering interesting ML challenges.
The focus of this three and a half hour tutorial is to introduce the recent work done on automatically solving word problems using machine learning and deep learning techniques. Within the tutorial, we provide two primers on Probabilistic Modelling and Seq2Seq learning in this domain.
[ Slides ]
Sowmya S Sundaram is a senior Ph.D. research scholar at Indian Institute of Technology Madras (IITM), India. Her areas of interest include Natural Language Processing and Knowledge Representation and Reasoning. Her Ph.D. work is on solving elementary-level math word problems automatically.
Savitha Sam Abraham is a senior Ph.D. research scholar at Indian Institute of Technology Madras (IITM), India. Her areas of interest include Natural Language Processing and Knowledge Representation and Reasoning. Her Ph.D. work is on solving kinematics word problems automatically.
Deepak P is a lecturer (Assistant Professor) at Queen’s University Belfast, UK. His interests span various sub-fields within NLP, IR and ML with a recent focus on specific emerging NLP applications such as fake news identification, word problem solving and analytics for community question-answering. In particular, he has published his research in CQA analytics at CIKM 2011, CIKM 2012, ECIR 2013, ACL 2014, EMNLP 2016 and EMNLP 2017. Further, he has authored more than 50 papers in top-notch avenues in NLP, AI, IR and databases and is the inventor on twelve USPTO granted patents. He is a Senior Member of the ACM and the IEEE.
If you wish to cite this tutorial, please use the following citation styles.
Sowmya S. Sundaram, Savitha Sam Abraham, Deepak P. (2019). Tutorial on Machine Learning for Automatic Word Problem Solving [https://sites.google.com/view/nlp-word-problem-solving/].