Master of Science
Date of Defense
Uday K Chakraborty
The realm of automated problem solving is a relatively new field, even in the context of natural language processing. One area where this is often demonstrated is that of creating a program that can solve word problems. The program must understand the problem, perform some processing, and then convey this information to a user in a way that is accessible and understandable. There has been quite a lot of progress in this area with simpler problems. However, when it comes to understanding problems that involve a level of NLP, the results are not conclusive. In this paper, we would like to present a new approach to automated word problem solving that places great emphasis on problem translation through the use of pattern matching and POS tagging.
Prescott, Zach, "Translating Counting Problems into Computable Language Expressions" (2020). Theses. 367.