Fetching the paper…
Reading the bibliography…
Constructing accurate and automatic solvers of math word problems has proven to be quite challenging.
D. G. Bobrow, “Natural language input for a computer problem solving system,” Ph.D. dissertation, Massachusetts Institute Of Technology, 1964
1964
Earlier work this paper cites.
K. Papineni, S. Roukos, T. Ward, and W.-J. Zhu, “Bleu: A method for automatic evaluation of machine translation,” in Proceedings of the 40th annual meeting on association for computational linguistics . Association for Computational Linguistics, 2002, pp. 311–318
2002
Earlier work this paper cites.
P.-T. De Boer, D. P. Kroese, S. Mannor, and R. Y. Rubinstein, “A tutorial on the cross-entropy method,” Annals of operations research , vol. 134, no. 1, pp. 19–67, 2005
2005
Earlier work this paper cites.
Y. Bakman, “Robust understanding of word problems with extraneous information,” arXiv preprint math/0701393 , 2007
2007
Earlier work this paper cites.
A. L. Maas, R. E. Daly, P. T. Pham, D. Huang, A. Y. Ng, and C. Potts, “Learning word vectors for sentiment analysis,” in Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies . Portland, Oregon, USA: Association for Computational Linguistics, June 2011, pp. 142–150. [Online]. Available: http://www.aclweb.org/anthology/P11-1015
2011
Earlier work this paper cites.
C. Liguda and T. Pfeiffer, “Modeling math word problems with augmented semantic networks,” in International Conference on Application of Natural Language to Information Systems . Springer, 2012, pp. 247–252
2012
Earlier work this paper cites.
M. J. Hosseini, H. Hajishirzi, O. Etzioni, and N. Kushman, “Learning to solve arithmetic word problems with verb categorization,” in Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) , 2014, pp. 523–533
2014
Earlier work this paper cites.
N. Kushman, Y. Artzi, L. Zettlemoyer, and R. Barzilay, “Learning to automatically solve algebra word problems,” in Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , 2014, pp. 271–281
2014
Earlier work this paper cites.
S. Roy, T. Vieira, and D. Roth, “Reasoning about quantities in natural language,” Transactions of the Association for Computational Linguistics , vol. 3, pp. 1–13, 2015
2015
Earlier work this paper cites.
S. Shi, Y. Wang, C.-Y. Lin, X. Liu, and Y. Rui, “Automatically solving number word problems by semantic parsing and reasoning,” in Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing , 2015, pp. 1132–1142
2015
Cited alongside, same era.
R. Koncel-Kedziorski, H. Hajishirzi, A. Sabharwal, O. Etzioni, and S. D. Ang, “Parsing algebraic word problems into equations,” Transactions of the Association for Computational Linguistics , vol. 3, pp. 585–597, 2015
2015
Cited alongside, same era.
S. Roy and D. Roth, “Solving general arithmetic word problems,” pp. 1743–1752, 2015
2015
Cited alongside, same era.
A. Mitra and C. Baral, “Learning to use formulas to solve simple arithmetic problems,” in Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , 2016, pp. 2144–2153
2016
Cited alongside, same era.
L. Wang, D. Zhang, L. Gao, J. Song, L. Guo, and H. T. Shen, “Mathdqn: Solving arithmetic word problems via deep reinforcement learning,” in Thirty-Second AAAI Conference on Artificial Intelligence , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
D. Huang, J. Liu, C.-Y. Lin, and J. Yin, “Neural math word problem solver with reinforcement learning,” in Proceedings of the 27th International Conference on Computational Linguistics . Santa Fe, New Mexico, USA: Association for Computational Linguistics, Aug. 2018, pp. 213–223. [Online]. Available: https://www.aclweb.org/anthology/C18-1018
2018
Later among the works it cites.
M. Peters, M. Neumann, M. Iyyer, M. Gardner, C. Clark, K. Lee, and L. Zettlemoyer, “Deep contextualized word representations,” pp. 2227–2237, 2018
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Koncel-Kedziorski, S. Roy, A. Amini, N. Kushman, and H. Hajishirzi, “Mawps: A math word problem repository,” in Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies , 2016, pp. 1152–1157
2016
Cited alongside, same era.
D. Huang, S. Shi, C.-Y. Lin, J. Yin, and W.-Y. Ma, “How well do computers solve math word problems? large-scale dataset construction and evaluation,” in Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) , 2016, pp. 887–896
2016
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in Advances in neural information processing systems , 2017, pp. 5998–6008
2017
Cited alongside, same era.
S. Roy and D. Roth, “Unit dependency graph and its application to arithmetic word problem solving,” in Thirty-First AAAI Conference on Artificial Intelligence , 2017
2017
Cited alongside, same era.
J. D. M.-W. C. Kenton and L. K. Toutanova, “Bert: Pre-training of deep bidirectional transformers for language understanding.”
Cited in the paper.
Later among the works it cites.
R. Sun, Y. Zhao, Q. Zhang, K. Ding, S. Wang, and C. Wei, “A neural semantic parser for math problems incorporating multi-sentence information,” ACM Transactions on Asian and Low-Resource Language Information Processing (TALLIP) , vol. 18, no. 4, p. 37, 2019
2019
Closest in time.
T. Rehman, S. Khan, G.-J. Hwang, and M. A. Abbas, “Automatically solving two-variable linear algebraic word problems using text mining,” Expert Systems , vol. 36, no. 2, p. e12358, 2019
2019
Closest in time.
P. Budzianowski and I. Vulić, “Hello, it’s GPT-2 - how can I help you? towards the use of pretrained language models for task-oriented dialogue systems,” in Proceedings of the 3rd Workshop on Neural Generation and Translation . Hong Kong: Association for Computational Linguistics, Nov. 2019, pp. 15–22. [Online]. Available: https://www.aclweb.org/anthology/D19-5602
2019
Closest in time.
A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, and I. Sutskever, “Language models are unsupervised multitask learners,” OpenAI Blog , vol. 1, no. 8, 2019
2019
Closest in time.