The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Learning to Solve Arithmetic Word Problems with Verb Categorization
Open accessAbstract
This paper presents a novel approach to learning to solve simple arithmetic word problems.Our system, ARIS, analyzes each of the sentences in the problem statement to identify the relevant variables and their values.ARIS then maps this information into an equation that represents the problem, and enables its (trivial) solution as shown in Figure 1.The paper analyzes the arithmetic-word problems "genre", identifying seven categories of verbs used in such problems.ARIS learns to categorize verbs with 81.2% accuracy, and is able to solve 77.7% of the problems in a corpus of standard primary school test questions.We report the first learning results on this task without reliance on predefined templates and make our data publicly available.
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
WordNet: a lexical database for English
Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015
An Information-Theoretic Definition of Similarity
Lin, D. (1998) · International Conference on Machine Learning · Cited by 3,790
Using Information Content to Evaluate Semantic Similarity in a Taxonomy
Resnik, P. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9511007 · Cited by 3,193
Incorporating non-local information into information extraction systems by Gibbs sampling
Finkel, J. R., Grenager, T., & Manning, C. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219885 · Cited by 3,008
Generating Typed Dependency Parses from Phrase Structure Parses
de Marneffe, M.-C., MacCartney, B., & Manning, C. D. (2006) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/3wtkaidk6ea8 · Cited by 2,258
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
5.7 The WORDNET lexical database of English
(2019) · Computer Corpus Lexicography · doi:10.1515/9781474471459-050 · Cited by 1,865
Feigenbaum, E. A., & Feldman, J. (1963) · Cited by 943
L 1-Regularization Path Algorithm for Generalized Linear Models
Park, M. Y., & Hastie, T. (2007) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00607.x · Cited by 838
Zettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
Weka: Practical machine learning tools and techniques with Java implementations
Witten, I. H., Frank, E., Trigg, L. E., Hall, M. A., Holmes, G., & Cunningham, S. J. (1999) · Research Commons (University of Waikato) · Cited by 629
Unsupervised learning of narrative schemas and their participants
Chambers, N., & Jurafsky, D. (2009) · Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - ACL-IJCNLP '09 · doi:10.3115/1690219.1690231 · Cited by 389
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
Self-citationA Multi-Pass Sieve for Coreference Resolution
Raghunathan, K., Lee, H., Rangarajan, S., Chambers, N., Surdeanu, M., Jurafsky, D., & Manning, C. D. (2010) · Cited by 335
Learning semantic correspondences with less supervision
Liang, P., Jordan, M. I., & Klein, D. (2009) · Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - ACL-IJCNLP '09 · doi:10.3115/1687878.1687893 · Cited by 297
Poon, H., & Domingos, P. (2009) · Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 1 - EMNLP '09 · doi:10.3115/1699510.1699512 · Cited by 253
Reinforcement learning for mapping instructions to actions
Branavan, S. R. K., Chen, H., Zettlemoyer, L. S., & Barzilay, R. (2009) · Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - ACL-IJCNLP '09 · doi:10.3115/1687878.1687892 · Cited by 243
Circumscription - A Form of Non-Monotonic Reasoning
McCarthy, J. (1980) · doi:10.21236/ada086574 · Cited by 199
Learning to Follow Navigational Directions
Vogel, A. P., & Jurafsky, D. S. (2010) · Cited by 160
Training a Multilingual Sportscaster: Using Perceptual Context to Learn Language
Chen, D. L., Kim, J., & Mooney, R. J. (2010) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2962 · Cited by 95
Using Semantic Unification to Generate Regular Expressions from Natural Language
Kushman, N., & Barzilay, R. (2013) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 89
Self-citationConfidence Driven Unsupervised Semantic Parsing
Goldwasser, D., Reichart, R., Clarke, J., & Roth, D. (2011) · Cited by 82
Joint Coreference Resolution and Named-Entity Linking with Multi-Pass Sieves
Hajishirzi, H., Zilles, L., Weld, D. S., & Zettlemoyer, L. (2013) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d13-1029 · Cited by 63
Self-citationL1 Regularization Path Algorithm for Generalized Linear Models
Jing, Y. (2008) · Journal of Jiamusi University · Cited by 60
Discriminative reranking for semantic parsing
Raymond, R. G., & Mooney, J. (2006) · International Conference on Computational Linguistics and Annual Meeting of the Association for Computational Linguistics (COLING/ACL) · doi:10.3115/1273073.1273107 · Cited by 51
Fellbaum, C. (2013) · Computational Linguistics · doi:10.1162/coli_a_00131 · Cited by 42
Learning from natural instructions
Goldwasser, D., & Roth, D. (2011) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · doi:10.5591/978-1-57735-516-8/ijcai11-301 · Cited by 40
Database-text alignment via structured multilabel classification
Snyder, B., & Barzilay, R. (2007) · Cited by 38
Reading to learn: constructing features from semantic abstracts
Eisenstein, J., Clarke, J., Goldwasser, D., & Roth, D. (2009) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/1699571.1699637 · Cited by 31
Semantic Understanding of Professional Soccer CommentariesPreprint
Hajishirzi, H., Rastegari, M., Farhadi, A., & Hodgins, J. K. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1210.4854 · Cited by 8
Self-citation
Cited by
SQuAD: 100,000+ Questions for Machine Comprehension of Text
Rajpurkar, P., Zhang, J., Lopyrev, K., & Liang, P. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1264 · Cited by 6,208
“Algebra word problems require understanding a story well enough to turn it into a system of equations, which can be easily solved to produce the answer (Kushman et al., 2014; Hosseini et al., 2014).”
BackgroundChain-Of-Thought Prompting Elicits Reasoning in Large Language Models
Wei, J., Wang, X., Schuurmans, D., Bosma, M., Ichter, B., Xia, F., Chi, E., Le, Q. V., & Zhou, D. (2022) · Advances in Neural Information Processing Systems 35 · doi:10.52202/068431-1800 · Cited by 4,505
“√ √ √ √ √ Answer Choices: (a) 5 MAWPS: AddSub 395 There were 6 roses in the vase.”
InfluentialSelf-Consistency Improves Chain of Thought Reasoning in Language Models
Wang, X., Wei, J., Schuurmans, D., Le, Q., Chi, E., Narang, S., Chowdhery, A., & Zhou, D. (2022) · arXiv · doi:10.48550/arxiv.2203.11171 · Cited by 829
“For these tasks, we used the Math Word Problem Repository (Koncel-Kedziorski et al., 2016), including AddSub (Hosseini et al., 2014), MultiArith (Roy & Roth, 2015), and ASDiv (Miao et al., 2020).”
BackgroundMethodSQuAD: 100,000+ Questions for Machine Comprehension of Text
Rajpurkar, P., Zhang, J., Lopyrev, K., & Liang, P. (2016) · arXiv · doi:10.48550/arxiv.1606.05250 · Cited by 678
Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models
Srivastava, A., Rastogi, A., Rao, A., Shoeb, A. A. M., Abid, A., Fisch, A., Brown, A. R., Santoro, A., Gupta, A., Garriga-Alonso, A., et al. (2022) · arXiv · doi:10.48550/arxiv.2206.04615 · Cited by 569
Self-citation
Metadata
- Authors
- Hosseini, M. J., Hajishirzi, H., Etzioni, O., & Kushman, N.
- Venue
- Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)
- Published
- 2014
- Pages
- 523-533
- OpenAlex
- W2105717194
- Cited by
- 291
- References
- 30
- FWCI
- 13.04
- 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.