{"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":"/dataset/paramawps","name":"ParaMAWPS","full_name":"Paraphrased Math Word Problem Solving Repository","description_markdown":"This repository contains the code, data, and models of the paper titled **\"Math Word Problem Solving by Generating Linguistic Variants of Problem Statements\"** published in the ***Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop)***.\r\n\r\nThe work is outlined in a more detailed and expository manner in our Bachelor of Science (B.Sc.) thesis titled **\"Variational Mathematical Reasoning: Enhancing Math Word Problem Solvers with Linguistic Variants and Disentangled Attention\"** which can be accessed from the [Islamic University of Technology (IUT) Institutional Repository](http://103.82.172.44:8080/xmlui/).\r\n\r\n[![arXiv](https://img.shields.io/badge/arXiv-2306.13899-b31b1b.svg?logo=arxiv)](https://arxiv.org/abs/2306.13899)\r\n[![anthology](https://img.shields.io/badge/ACL%20Anthology-2023.acl--srw.49-EE161F.svg)](https://aclanthology.org/2023.acl-srw.49/)\r\n[![GoogleScholar](https://img.shields.io/badge/Google%20Scholar-4285F4?style=flat&logo=Google+Scholar&logoColor=white&color=gray&labelColor=4285F4)](https://scholar.google.com/citations?view_op=view_citation&hl=en&user=4L_7vaoAAAAJ&citation_for_view=4L_7vaoAAAAJ:d1gkVwhDpl0C)\r\n[![ResearchGate](https://img.shields.io/badge/ResearchGate-00CCBB?style=flat&logo=ResearchGate&logoColor=white&color=gray&labelColor=00CCBB)](https://www.researchgate.net/publication/372918265_Math_Word_Problem_Solving_by_Generating_Linguistic_Variants_of_Problem_Statements)\r\n[![HuggingFace](https://img.shields.io/badge/Hugging%20Face-yellow?style=flat&logo=HuggingFace&logoColor=black&color=gray&labelColor=yellow)](https://huggingface.co/datasets/Starscream-11813/ParaMAWPS)\r\n\r\n[![PDF](https://img.shields.io/badge/Paper%20PDF-EF3939?style=flat&logo=adobeacrobatreader&logoColor=white&color=gray&labelColor=ec1c24)](https://aclanthology.org/2023.acl-srw.49.pdf)\r\n[![Slides](https://img.shields.io/badge/Slides%20PDF-EF3939?style=flat&logo=Microsoft+PowerPoint&logoColor=white&color=gray&labelColor=B7472A)](https://drive.google.com/file/d/1R-lB53BeaM-7XE0EoBZ5qfy-BSc61gup/view?usp=sharing)\r\n[![Video](https://img.shields.io/badge/Video%20Presentation-4285F4?style=flat&logo=data:image/svg%2bxml;base64,PHN2ZyB4bWxucz0iaHR0cDovL3d3dy53My5vcmcvMjAwMC9zdmciIHZpZXdCb3g9IjAgMCA1NzYgNTEyIj48IS0tIUZvbnQgQXdlc29tZSBGcmVlIDYuNS4yIGJ5IEBmb250YXdlc29tZSAtIGh0dHBzOi8vZm9udGF3ZXNvbWUuY29tIExpY2Vuc2UgLSBodHRwczovL2ZvbnRhd2Vzb21lLmNvbS9saWNlbnNlL2ZyZWUgQ29weXJpZ2h0IDIwMjQgRm9udGljb25zLCBJbmMuLS0+PHBhdGggZmlsbD0iI2ZmZmZmZiIgZD0iTTAgMTI4QzAgOTIuNyAyOC43IDY0IDY0IDY0SDMyMGMzNS4zIDAgNjQgMjguNyA2NCA2NFYzODRjMCAzNS4zLTI4LjcgNjQtNjQgNjRINjRjLTM1LjMgMC02NC0yOC43LTY0LTY0VjEyOHpNNTU5LjEgOTkuOGMxMC40IDUuNiAxNi45IDE2LjQgMTYuOSAyOC4yVjM4NGMwIDExLjgtNi41IDIyLjYtMTYuOSAyOC4ycy0yMyA1LTMyLjktMS42bC05Ni02NEw0MTYgMzM3LjFWMzIwIDE5MiAxNzQuOWwxNC4yLTkuNSA5Ni02NGM5LjgtNi41IDIyLjQtNy4yIDMyLjktMS42eiIvPjwvc3ZnPg==&logoColor=white&color=gray&labelColor=B197FC)](https://aclanthology.org/2023.acl-srw.49.mp4)\r\n[![Poster](https://img.shields.io/badge/Poster-4285F4?style=flat&logo=Google+Drive&logoColor=white&color=gray&labelColor=74C0FC)](https://drive.google.com/file/d/1FfexZxsKqL0mw2cUy7hTr4vhp7WBjhRW/view?usp=sharing)\r\n[![Thesis](https://img.shields.io/badge/Thesis-189A38?style=flat&logo=bookstack&logoColor=white&color=gray&labelColor=189A38)](http://103.82.172.44:8080/xmlui/handle/123456789/2092)\r\n\r\n**License:** Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International\r\n\r\n[![license](https://arxiv.org/icons/licenses/by-nc-sa-4.0.png)](http://creativecommons.org/licenses/by-nc-sa/4.0/)\r\n\r\n## Dataset\r\nIn order to download our dataset **PᴀʀᴀMAWPS**, please navigate to the [ParaMAWPS](https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/tree/main/ParaMAWPS) folder. We use an $80:10:10$ train-validation-test split for our **PᴀʀᴀMAWPS** dataset. The splits are available in `.json` format in the aforementioned folder.\r\n\r\n### Data Format\r\nEach row consists of a Math Word Problem (MWP). The table below describes what each column signifies.\r\n\r\nColumn Title | Description\r\n------------ | -------------\r\n`id` | The unique identification number of the sample. Seed problems have `id` size of $\\leq 4$, whereas, variant problems have `id` size of $> 4$. The last variant of a seed problem (generally with the `id` \"$16000i$\", where $i$ is the `id` of the seed problem) is the inverse variant of the seed problem.\r\n`original_text` | The problem statement of the MWP. The seed problems have the same problem statement as present in the Mᴀᴡᴘs dataset.\r\n`equation` | The equation with a variable \\\\(x\\\\) which solves the MWP\r\n`quantity_tagged_text` | The problem statement of the MWP, where each quantity is replaced with a unique tag \\\\([Q_i]\\\\)\r\n`quantity_tagged_equation` | The equation with a variable \\\\(x\\\\) which solves the MWP, but each quantity is replaced with its unique tag \\\\([Q_i]\\\\) in the problem statement\r\n`have_constant` | Whether the use of a constant value is required to solve the MWP <br> For an MWP sample \\\\(i\\\\) with `have_constant` label \\\\(C_i\\\\), the boolean label is,<br>$C_i =\\begin{cases} \\text{FALSE}, & \\text{if $i$ requires $0$ constant values}\\\\\\ \\text{TRUE}, & \\text{if $i$ requires $\\geq 1$ constant values}\\end{cases}$\r\n\r\n## Types of Variations\r\n<img src=\"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/raw/main/images/ACLMWP_variationtypes.png\" alt=\"drawing\" style=\"width:1000px;\"/>\r\n\r\n## Dataset Statistics\r\n<img src=\"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/raw/main/images/ACLMWP_datasetcomparisontable.png\" alt=\"drawing\" style=\"width:500px;\"/>\r\n<img src=\"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/raw/main/images/ACLMWP_datasetcomparisongraph.png\" alt=\"drawing\" style=\"width:500px;\"/>\r\n\r\n# Methodology\r\n<img src=\"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/raw/main/images/ACLMWP_architecture2.png\" alt=\"drawing\" style=\"width:1000px;\"/>\r\n\r\n# Results\r\nTo reproduce the results, please refer to the documentation of [MWPToolkit](https://github.com/LYH-YF/MWPToolkit) created by **Yihuai Lan _et al_**.\r\n<img src=\"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/raw/main/images/ACLMWP_results.png\" alt=\"drawing\" style=\"width:500px;\"/>\r\n<img src=\"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/raw/main/images/ACLMWP_ablation.png\" alt=\"drawing\" style=\"width:500px;\"/>\r\n\r\n## Citation\r\nIf you find this work useful, please cite our paper:\r\n```bib\r\n@inproceedings{raiyan-etal-2023-math,\r\n    title = \"Math Word Problem Solving by Generating Linguistic Variants of Problem Statements\",\r\n    author = \"Raiyan, Syed Rifat  and\r\n      Faiyaz, Md Nafis  and\r\n      Kabir, Shah Md. Jawad  and\r\n      Kabir, Mohsinul  and\r\n      Mahmud, Hasan  and\r\n      Hasan, Md Kamrul\",\r\n    booktitle = \"Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 4: Student Research Workshop)\",\r\n    month = jul,\r\n    year = \"2023\",\r\n    address = \"Toronto, Canada\",\r\n    publisher = \"Association for Computational Linguistics\",\r\n    url = \"https://aclanthology.org/2023.acl-srw.49\",\r\n    doi = \"10.18653/v1/2023.acl-srw.49\",\r\n    pages = \"362--378\",\r\n    abstract = \"The art of mathematical reasoning stands as a fundamental pillar of intellectual progress and is a central catalyst in cultivating human ingenuity. Researchers have recently published a plethora of works centered around the task of solving Math Word Problems (MWP) {---} a crucial stride towards general AI. These existing models are susceptible to dependency on shallow heuristics and spurious correlations to derive the solution expressions. In order to ameliorate this issue, in this paper, we propose a framework for MWP solvers based on the generation of linguistic variants of the problem text. The approach involves solving each of the variant problems and electing the predicted expression with the majority of the votes. We use DeBERTa (Decoding-enhanced BERT with disentangled attention) as the encoder to leverage its rich textual representations and enhanced mask decoder to construct the solution expressions. Furthermore, we introduce a challenging dataset, ParaMAWPS, consisting of paraphrased, adversarial, and inverse variants of selectively sampled MWPs from the benchmark Mawps dataset. We extensively experiment on this dataset along with other benchmark datasets using some baseline MWP solver models. We show that training on linguistic variants of problem statements and voting on candidate predictions improve the mathematical reasoning and robustness of the model. We make our code and data publicly available.\",\r\n}\r\n```\r\n\r\nYou can also cite our thesis:\r\n```bib\r\n@phdthesis{raiyan2023variational,\r\n  type={Bachelor's Thesis},\r\n  title={Variational Mathematical Reasoning: Enhancing Math Word Problem Solvers with Linguistic Variants and Disentangled Attention},\r\n  author={Raiyan, Syed Rifat and Faiyaz, Md Nafis and Kabir, Shah Md Jawad},\r\n  year={2023},\r\n  school={Department of Computer Science and Engineering (CSE), Islamic University of Technology},\r\n  address={Board Bazar, Gazipur-1704, Dhaka, Bangladesh},\r\n  note={Available at \\url{http://103.82.172.44:8080/xmlui/handle/123456789/2092}}\r\n}\r\n```","description_withheld":null,"homepage":"https://github.com/Starscream-11813/Variational-Mathematical-Reasoning/","introduced_date":"2023-06-24","introduced_date_note":null,"introduced_by":{"paper":"/paper/math-word-problem-solving-by-generating","title":"Math Word Problem Solving by Generating Linguistic Variants of Problem Statements","first_author":"Syed Rifat Raiyan","url":null},"license":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International","url":"http://creativecommons.org/licenses/by-nc-sa/4.0/"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Mathematical Reasoning","url":"/task/mathematical-reasoning","datasets_with_task":"/datasets/task/mathematical-reasoning"},{"name":"Mathematical Question Answering","url":"/task/mathematical-question-answering","datasets_with_task":"/datasets/task/mathematical-question-answering"},{"name":"Math Word Problem Solving","url":"/task/math-word-problem-solving","datasets_with_task":"/datasets/task/math-word-problem-solving"},{"name":"Math Word Problem SolvingΩ","url":"/task/math-word-problem-solvingo","datasets_with_task":"/datasets/task/math-word-problem-solvingo"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["ParaMAWPS"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/Starscream-11813/ParaMAWPS","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":2,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/math-word-problem-solving-on-paramawps","task":"Math Word Problem Solving","dataset_variant":"ParaMAWPS","rows":6,"metrics":["Accuracy (%)"],"first_row_in_archive_order":{"model":"DeBERTa (VM)","paper":"/paper/math-word-problem-solving-by-generating","metrics":{"Accuracy (%)":"79.1"},"code_links":[{"title":"starscream-11813/variational-mathematical-reasoning","url":"https://github.com/starscream-11813/variational-mathematical-reasoning"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":2,"of":2,"counts":{"papers_with_a_benchmark_row":2,"with_a_code_link":2,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":2,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/math-word-problem-solving-by-generating","slug":"math-word-problem-solving-by-generating","title":"Math Word Problem Solving by Generating Linguistic Variants of Problem Statements","date":"2023-06-24","arxiv_id":"2306.13899","rows_on_this_dataset":5,"code_links":1,"syntology":null},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/math-word-problem-solving-by-generating","slug":"math-word-problem-solving-by-generating","title":"Math Word Problem Solving by Generating Linguistic Variants of Problem Statements","date":"2023-06-24","arxiv_id":"2306.13899","rows_on_this_dataset":5,"code_links":1,"syntology":null},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}}],"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/dataset/paramawps/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/paramawps/papers/ran/1","json":"/dataset/paramawps/papers/ran/1.json","rows":1}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":1,"samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":1,"papers_with_a_run_with_no_instrument_failure":1,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"0a7a49569c26c69912d0baacae51d483b10d64c3f45491d8f5dfae8bf7a80fb5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}