{"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/an-expression-tree-decoding-strategy-for","title":"An Expression Tree Decoding Strategy for Mathematical Equation Generation","arxiv_id":"2310.09619","date":"2023-10-14","proceeding":null,"authors":["Wenqi Zhang","Yongliang Shen","Qingpeng Nong","Zeqi Tan","Yanna Ma","Weiming Lu"],"abstract":"Generating mathematical equations from natural language requires an accurate understanding of the relations among math expressions. Existing approaches can be broadly categorized into token-level and expression-level generation. The former treats equations as a mathematical language, sequentially generating math tokens. Expression-level methods generate each expression one by one. However, each expression represents a solving step, and there naturally exist parallel or dependent relations between these steps, which are ignored by current sequential methods. Therefore, we integrate tree structure into the expression-level generation and advocate an expression tree decoding strategy. To generate a tree with expression as its node, we employ a layer-wise parallel decoding strategy: we decode multiple independent expressions (leaf nodes) in parallel at each layer and repeat parallel decoding layer by layer to sequentially generate these parent node expressions that depend on others. Besides, a bipartite matching algorithm is adopted to align multiple predictions with annotations for each layer. Experiments show our method outperforms other baselines, especially for these equations with complex structures.","url_abs":"https://arxiv.org/abs/2310.09619v3","url_pdf":"https://arxiv.org/pdf/2310.09619v3.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":"an-expression-tree-decoding-strategy-for","repo_url":"https://github.com/zwq2018/multi-view-consistency-for-mwp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"math","task_name":"Math"},{"task_slug":"math-word-problem-solving","task_name":"Math Word Problem Solving"},{"task_slug":"mathematical-reasoning","task_name":"Mathematical Reasoning"},{"task_slug":"structured-prediction","task_name":"Structured Prediction"}],"methods":[{"method_slug":"align","method_name":"ALIGN"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/math-word-problem-solving-on-mawps","task":"Math Word Problem Solving","dataset":"MAWPS","model":"Exp-Tree","rank_in_archive_order":5,"of":25,"metrics":{"Accuracy (%)":"92.3"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-math23k","task":"Math Word Problem Solving","dataset":"Math23K","model":"Exp-Tree","rank_in_archive_order":4,"of":19,"metrics":{"Accuracy (5-fold)":"84.1","Accuracy (training-test)":"86.2"},"uses_additional_data":false},{"leaderboard":"/sota/math-word-problem-solving-on-mathqa","task":"Math Word Problem Solving","dataset":"MathQA","model":"Exp-Tree","rank_in_archive_order":2,"of":5,"metrics":{"Answer Accuracy":"81.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2310.09619","atlas_url":"https://app.syntology.ai/?focus=2310.09619","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":"2310.09619"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2310.09619\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2310.09619"},"call":"get_concepts_for_paper(arxiv_id=\"2310.09619\")"}],"by_repo":[{"repo":"zwq2018/multi-view-consistency-for-mwp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.11694"],"harvested_for_calls":[{"arxiv_id":"2210.11694","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.11694"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.11694\")"}]}],"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":"e57f48fd3f7ec3c7706618bbdc2195eea03f4cccc71b90084ebfc7203e826394","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}