The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Deep Neural Solver for Math Word Problems
Open accessAbstract
This paper presents a deep neural solver to automatically solve math word problems.In contrast to previous statistical learning approaches, we directly translate math word problems to equation templates using a recurrent neural network (RNN) model, without sophisticated feature engineering.We further design a hybrid model that combines the RNN model and a similarity-based retrieval model to achieve additional performance improvement.Experiments conducted on a large dataset show that the RNN model and the hybrid model significantly outperform stateof-the-art statistical learning methods for math word problem solving. 1 We plan to make the dataset publicly available when the paper is published
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
(2014) · Cited by 33,419
Sequence to Sequence Learning with Neural Networks
Sutskever, I., Vinyals, O., & Le, Q. V. (2014) · arXiv · doi:10.48550/arxiv.1409.3215 · Cited by 17,766
Neural Machine Translation by Jointly Learning to Align and Translate
Bahdanau, D., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1409.0473 · Cited by 16,213
Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling
Chung, J., Gulcehre, C., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.3555 · Cited by 11,008
On the Properties of Neural Machine Translation: Encoder–Decoder Approaches
Cho, K., van Merrienboer, B., Bahdanau, D., & Bengio, Y. (2014) · Proceedings of SSST-8, Eighth Workshop on Syntax, Semantics and Structure in Statistical Translation · doi:10.3115/v1/w14-4012 · Cited by 7,099
Neural Responding Machine for Short-Text Conversation
Shang, L., Lu, Z., & Li, H. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1152 · Cited by 978
Feigenbaum, E. A., & Feldman, J. (1963) · Cited by 943
Sequence-to-Sequence Learning as Beam-Search Optimization
Wiseman, S., & Rush, A. M. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1137 · Cited by 481
Learning to Automatically Solve Algebra Word Problems
Kushman, N., Artzi, Y., Zettlemoyer, L., & Barzilay, R. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1026 · Cited by 343
Natural Language Input for a Computer Problem Solving System
Bobrow, D. G. (1964) · Defense Technical Information Center (DTIC) · Cited by 320
Learning to Solve Arithmetic Word Problems with Verb Categorization
Hosseini, M. J., Hajishirzi, H., Etzioni, O., & Kushman, N. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1058 · Cited by 291
An Integrated Model of Skill in Solving Elementary Word Problems
Briars, D. J., & Larkin, J. H. (1984) · Cognition and Instruction · doi:10.1207/s1532690xci0103_1 · Cited by 284
Solving General Arithmetic Word Problems
Roy, S., & Roth, D. (2016) · arXiv · doi:10.48550/arxiv.1608.01413 · Cited by 275 · cited 1×
“In addition, Roy and Roth Roy et al. (2015); Roy and Roth (2016) tries to handle arithmetic problems with multiple steps and operations without depending on additional annotations or predefined templates.”
BackgroundSolving General Arithmetic Word Problems
Roy, S., & Roth, D. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1202 · Cited by 267
Parsing Algebraic Word Problems into Equations
Koncel-Kedziorski, R., Hajishirzi, H., Sabharwal, A., Etzioni, O., & Ang, S. D. (2015) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00160 · Cited by 231
Automatically Solving Number Word Problems by Semantic Parsing and Reasoning
Shi, S., Wang, Y., Lin, C.-Y., Liu, X., & Rui, Y. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1135 · Cited by 200
Self-citationHow well do Computers Solve Math Word Problems? Large-Scale Dataset Construction and Evaluation
Huang, D.-Q., Shi, S., Lin, C.-Y., Yin, J., & Ma, W.-Y. (2016) · Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p16-1084 · Cited by 158
Self-citationLearning To Use Formulas To Solve Simple Arithmetic Problems
Mitra, A., & Baral, C. R. (2016) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p16-1202 · Cited by 148
Reasoning about Quantities in Natural Language
Roy, S., Vieira, T., & Roth, D. (2015) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00118 · Cited by 133
Understanding and solving arithmetic word problems: A computer simulation
Fletcher, C. R. (1985) · Behavior Research Methods, Instruments, & Computers · doi:10.3758/bf03207654 · Cited by 112
Learn to Solve Algebra Word Problems Using Quadratic Programming
Zhou, L., Dai, S., & Chen, L. (2015) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d15-1096 · Cited by 109
Neural Generation of Regular Expressions from Natural Language with Minimal Domain Knowledge
Locascio, N., Narasimhan, K., DeLeon, E., Kushman, N., & Barzilay, R. (2016) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d16-1197 · Cited by 87
Robust Understanding of Word Problems with Extraneous InformationPreprint
Bakman, Y. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0701393 · Cited by 77
Annotating Derivations: A New Evaluation Strategy and Dataset for Algebra Word Problems
Upadhyay, S., & Chang, M.-W. (2016) · Conference of the European Chapter of the Association for Computational Linguistics · doi:10.18653/v1/e17-1047 · Cited by 65
Cited by
A Comprehensive Overview of Large Language Models
Naveed, H., Khan, A. U., Qiu, S., Saqib, M., Anwar, S., Usman, M., Akhtar, N., Barnes, N., & Mian, A. (2023) · arXiv · doi:10.48550/arxiv.2307.06435 · Cited by 1,259
A Comprehensive Overview of Large Language Models
Naveed, H., Khan, A. U., Qiu, S., Saqib, M., Anwar, S., Usman, M., Akhtar, N., Barnes, N., & Mian, A. (2025) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3744746 · Cited by 1,257
Training Verifiers to Solve Math Word Problems
Cobbe, K., Kosaraju, V., Bavarian, M., Chen, M., Jun, H., Kaiser, L., Plappert, M., Tworek, J., Hilton, J., Nakano, R., et al. (2021) · arXiv · doi:10.48550/arxiv.2110.14168 · Cited by 575
“Previous work has attempted to solve classic math word problem benchmarks with recurrent seq2seq models (Sutskever et al., 2014) and closely related variants (Wang et al., 2017; Huang et al., 2018).”
BackgroundAre NLP Models really able to Solve Simple Math Word Problems?
Patel, A., Bhattamishra, S., & Goyal, N. (2021) · Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2021.naacl-main.168 · Cited by 307
Shaik, T., Tao, X., Li, Y., Dann, C., McDonald, J., Redmond, P., & Galligan, L. (2022) · IEEE Access · doi:10.1109/access.2022.3177752 · Cited by 286
Metadata
- Authors
- Wang, Y., Liu, X., & Shi, S.
- Venue
- Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing
- Published
- 2017
- Pages
- 845-854
- OpenAlex
- W2757276219
- Cited by
- 329
- References
- 25
- FWCI
- 7.62
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.