{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/are-nlp-models-really-able-to-solve-simple","title":"Are NLP Models really able to Solve Simple Math Word Problems?","arxiv_id":"2103.07191","date":"2021-03-12","proceeding":"NAACL 2021 4","authors":["Arkil Patel","Satwik Bhattamishra","Navin Goyal"],"abstract":"The problem of designing NLP solvers for math word problems (MWP) has seen sustained research activity and steady gains in the test accuracy. Since existing solvers achieve high performance on the benchmark datasets for elementary level MWPs containing one-unknown arithmetic word problems, such problems are often considered \"solved\" with the bulk of research attention moving to more complex MWPs. In this paper, we restrict our attention to English MWPs taught in grades four and lower. We provide strong evidence that the existing MWP solvers rely on shallow heuristics to achieve high performance on the benchmark datasets. To this end, we show that MWP solvers that do not have access to the question asked in the MWP can still solve a large fraction of MWPs. Similarly, models that treat MWPs as bag-of-words can also achieve surprisingly high accuracy. Further, we introduce a challenge dataset, SVAMP, created by applying carefully chosen variations over examples sampled from existing datasets. The best accuracy achieved by state-of-the-art models is substantially lower on SVAMP, thus showing that much remains to be done even for the simplest of the MWPs.","url_abs":"https://arxiv.org/abs/2103.07191v2","url_pdf":"https://arxiv.org/pdf/2103.07191v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"are-nlp-models-really-able-to-solve-simple","repo_url":"https://github.com/arkilpatel/SVAMP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"are-nlp-models-really-able-to-solve-simple","repo_url":"https://github.com/debjitpaul/refiner","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"are-nlp-models-really-able-to-solve-simple","repo_url":"https://github.com/vedantgaur/symbolic-mwp-reasoning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"math","task_name":"Math"},{"task_slug":"math-word-problem-solving","task_name":"Math Word Problem Solving"},{"task_slug":"math-word-problem-solvingo","task_name":"Math Word Problem SolvingΩ"}],"methods":[{"method_slug":"gts","method_name":"GTS"},{"method_slug":"graph2tree","method_name":"Graph2Tree"}],"datasets_introduced":[{"slug":"svamp","name":"SVAMP","full_name":"Simple Variations on Arithmetic Math word Problems"}],"methods_introduced":[],"results":[{"leaderboard":"/sota/math-word-problem-solving-on-asdiv-a","task":"Math Word Problem Solving","dataset":"ASDiv-A","model":"Graph2Tree with RoBERTa","rank_in_archive_order":6,"of":9,"metrics":{"Execution Accuracy":"82.2"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-asdiv-a","task":"Math Word Problem Solving","dataset":"ASDiv-A","model":"GTS with RoBERTa","rank_in_archive_order":7,"of":9,"metrics":{"Execution Accuracy":"81.2"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-asdiv-a","task":"Math Word Problem Solving","dataset":"ASDiv-A","model":"LSTM Seq2Seq with RoBERTa","rank_in_archive_order":9,"of":9,"metrics":{"Execution Accuracy":"76.9"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-mawps","task":"Math Word Problem Solving","dataset":"MAWPS","model":"Graph2Tree with RoBERTa","rank_in_archive_order":10,"of":25,"metrics":{"Accuracy (%)":"88.7"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-mawps","task":"Math Word Problem Solving","dataset":"MAWPS","model":"GTS with RoBERTa","rank_in_archive_order":11,"of":25,"metrics":{"Accuracy (%)":"88.5"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-svamp","task":"Math Word Problem Solving","dataset":"SVAMP","model":"Graph2Tree with RoBERTa","rank_in_archive_order":21,"of":26,"metrics":{"Accuracy":"43.8","Execution Accuracy":"43.8"},"uses_additional_data":true},{"leaderboard":"/sota/math-word-problem-solving-on-svamp","task":"Math Word Problem Solving","dataset":"SVAMP","model":"GTS with RoBERTa","rank_in_archive_order":22,"of":26,"metrics":{"Accuracy":"41.0","Execution Accuracy":"41.0"},"uses_additional_data":true},{"leaderboard":"/sota/math-word-problem-solving-on-svamp","task":"Math Word Problem Solving","dataset":"SVAMP","model":"LSTM Seq2Seq with RoBERTa","rank_in_archive_order":23,"of":26,"metrics":{"Accuracy":"40.3","Execution Accuracy":"40.3"},"uses_additional_data":true},{"leaderboard":"/sota/math-word-problem-solving-on-svamp","task":"Math Word Problem Solving","dataset":"SVAMP","model":"Transformer with RoBERTa","rank_in_archive_order":25,"of":26,"metrics":{"Accuracy":"38.9","Execution Accuracy":"38.9"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2103.07191","atlas_url":"https://app.syntology.ai/?focus=2103.07191","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2103.07191"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2103.07191\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2103.07191"},"call":"get_concepts_for_paper(arxiv_id=\"2103.07191\")"}],"by_repo":[{"repo":"arkilpatel/SVAMP","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"debjitpaul/refiner","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2304.01904"],"harvested_for_calls":[{"arxiv_id":"2304.01904","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.01904"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.01904\")"}]},{"repo":"vedantgaur/symbolic-mwp-reasoning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"89f93af493a603fe6e45c0cc4f59bbcd40cdefa343b6494b66690311b88684b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}