{"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/neural-edit-completion","title":"A Structural Model for Contextual Code Changes","arxiv_id":"2005.13209","date":"2020-05-27","proceeding":null,"authors":["Shaked Brody","Uri Alon","Eran Yahav"],"abstract":"We address the problem of predicting edit completions based on a learned model that was trained on past edits. Given a code snippet that is partially edited, our goal is to predict a completion of the edit for the rest of the snippet. We refer to this task as the EditCompletion task and present a novel approach for tackling it. The main idea is to directly represent structural edits. This allows us to model the likelihood of the edit itself, rather than learning the likelihood of the edited code. We represent an edit operation as a path in the program's Abstract Syntax Tree (AST), originating from the source of the edit to the target of the edit. Using this representation, we present a powerful and lightweight neural model for the EditCompletion task. We conduct a thorough evaluation, comparing our approach to a variety of representation and modeling approaches that are driven by multiple strong models such as LSTMs, Transformers, and neural CRFs. Our experiments show that our model achieves a 28% relative gain over state-of-the-art sequential models and 2x higher accuracy than syntactic models that learn to generate the edited code, as opposed to modeling the edits directly. Our code, dataset, and trained models are publicly available at https://github.com/tech-srl/c3po/ .","url_abs":"https://arxiv.org/abs/2005.13209v2","url_pdf":"https://arxiv.org/pdf/2005.13209v2.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":"neural-edit-completion","repo_url":"https://github.com/tech-srl/c3po","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"editcompletion","task_name":"EditCompletion"},{"task_slug":"model","task_name":"model"}],"methods":[],"datasets_introduced":[{"slug":"c-editcompletion","name":"C# EditCompletion","full_name":""}],"methods_introduced":[],"results":[{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"C3PO","rank_in_archive_order":1,"of":7,"metrics":{"Accuracy":"53.2"},"uses_additional_data":false},{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"LaserTagger (Transformer)","rank_in_archive_order":2,"of":7,"metrics":{"Accuracy":"41.4"},"uses_additional_data":false},{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"LaserTagger (LSTM)","rank_in_archive_order":3,"of":7,"metrics":{"Accuracy":"40.9"},"uses_additional_data":false},{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"SequenceR (Transformer)","rank_in_archive_order":4,"of":7,"metrics":{"Accuracy":"32.6"},"uses_additional_data":false},{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"SequenceR","rank_in_archive_order":5,"of":7,"metrics":{"Accuracy":"30.7"},"uses_additional_data":false},{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"Path2Tree (Transformer)","rank_in_archive_order":6,"of":7,"metrics":{"Accuracy":"25.5"},"uses_additional_data":false},{"leaderboard":"/sota/editcompletion-on-c-editcompletion","task":"EditCompletion","dataset":"C# EditCompletion","model":"Path2Tree (LSTM)","rank_in_archive_order":7,"of":7,"metrics":{"Accuracy":"22.5"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"tech-srl/c3po","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":"fea7fec80e5780cda8e4103743280f4815975e7c2afc48bd570d3cdc750623c8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}