{"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/a-retrieve-and-edit-framework-for-predicting","title":"A Retrieve-and-Edit Framework for Predicting Structured Outputs","arxiv_id":"1812.01194","date":"2018-12-04","proceeding":"NeurIPS 2018 12","authors":["Tatsunori B. Hashimoto","Kelvin Guu","Yonatan Oren","Percy Liang"],"abstract":"For the task of generating complex outputs such as source code, editing\nexisting outputs can be easier than generating complex outputs from scratch.\nWith this motivation, we propose an approach that first retrieves a training\nexample based on the input (e.g., natural language description) and then edits\nit to the desired output (e.g., code). Our contribution is a computationally\nefficient method for learning a retrieval model that embeds the input in a\ntask-dependent way without relying on a hand-crafted metric or incurring the\nexpense of jointly training the retriever with the editor. Our\nretrieve-and-edit framework can be applied on top of any base model. We show\nthat on a new autocomplete task for GitHub Python code and the Hearthstone\ncards benchmark, retrieve-and-edit significantly boosts the performance of a\nvanilla sequence-to-sequence model on both tasks.","url_abs":"http://arxiv.org/abs/1812.01194v1","url_pdf":"http://arxiv.org/pdf/1812.01194v1.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":"a-retrieve-and-edit-framework-for-predicting","repo_url":"https://worksheets.codalab.org/worksheets/0x1ad3f387005c492ea913cf0f20c9bb89","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.01194","atlas_url":"https://app.syntology.ai/?focus=1812.01194","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":"1812.01194"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.01194\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.01194"},"call":"get_concepts_for_paper(arxiv_id=\"1812.01194\")"}],"by_repo":[{"repo":"worksheets.codalab.org/worksheets/0x1ad3f387005c492ea913cf0f20c9bb89","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"2306651af49182200eba8682a41fd073b035c4c83097c8999dee967a0353bfd7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}