Abstract
This paper describes our participation in SemEval-2019 shared task “Math Question Answering”, where the aim is to create a program that could solve the Math SAT questions automatically as accurately as possible. We went with a dual-pronged approach, building a Sequence-to-Sequence Neural Network pre-trained with augmented data that could answer all categories of questions and a Tree system, which can only answer a certain type of questions. The systems did not perform well on the entire test data given in the task, but did decently on the questions they were actually capable of answering. The Sequence-to-Sequence Neural Network model managed to get slightly better than our baseline of guessing “A” for every question, while the Tree system additionally improved the results.- Anthology ID:
- S19-2227
- Volume:
- Proceedings of the 13th International Workshop on Semantic Evaluation
- Month:
- June
- Year:
- 2019
- Address:
- Minneapolis, Minnesota, USA
- Editors:
- Jonathan May, Ekaterina Shutova, Aurelie Herbelot, Xiaodan Zhu, Marianna Apidianaki, Saif M. Mohammad
- Venue:
- SemEval
- SIG:
- SIGLEX
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 1292–1296
- Language:
- URL:
- https://aclanthology.org/S19-2227
- DOI:
- 10.18653/v1/S19-2227
- Cite (ACL):
- Xuefeng Luo, Alina Baranova, and Jonas Biegert. 2019. ProblemSolver at SemEval-2019 Task 10: Sequence-to-Sequence Learning and Expression Trees. In Proceedings of the 13th International Workshop on Semantic Evaluation, pages 1292–1296, Minneapolis, Minnesota, USA. Association for Computational Linguistics.
- Cite (Informal):
- ProblemSolver at SemEval-2019 Task 10: Sequence-to-Sequence Learning and Expression Trees (Luo et al., SemEval 2019)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-1/S19-2227.pdf