{"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-transformer-based-approach-for-source-code","title":"A Transformer-based Approach for Source Code Summarization","arxiv_id":"2005.00653","date":"2020-05-01","proceeding":"ACL 2020 6","authors":["Wasi Uddin Ahmad","Saikat Chakraborty","Baishakhi Ray","Kai-Wei Chang"],"abstract":"Generating a readable summary that describes the functionality of a program is known as source code summarization. In this task, learning code representation by modeling the pairwise relationship between code tokens to capture their long-range dependencies is crucial. To learn code representation for summarization, we explore the Transformer model that uses a self-attention mechanism and has shown to be effective in capturing long-range dependencies. In this work, we show that despite the approach is simple, it outperforms the state-of-the-art techniques by a significant margin. We perform extensive analysis and ablation studies that reveal several important findings, e.g., the absolute encoding of source code tokens' position hinders, while relative encoding significantly improves the summarization performance. We have made our code publicly available to facilitate future research.","url_abs":"https://arxiv.org/abs/2005.00653v1","url_pdf":"https://arxiv.org/pdf/2005.00653v1.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-transformer-based-approach-for-source-code","repo_url":"https://github.com/wasiahmad/NeuralCodeSum","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/CGCL-codes/naturalcc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/MaratSaidov/source-code-summarization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/Zhangxq-1/coderepository","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/code-desc/codesc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/csebuetnlp/CoDesc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/jadecxliu/codeqa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/sjj0403/GSCS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"a-transformer-based-approach-for-source-code","repo_url":"https://github.com/tmuttaqueen/NeuralCodeSum-smalltest","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"code-summarization-1","task_name":"Code Summarization"},{"task_slug":null,"task_name":"Position"},{"task_slug":"code-summarization","task_name":"Source Code Summarization"}],"methods":[{"method_slug":"absolute-position-encodings","method_name":"Absolute Position Encodings"},{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"label-smoothing","method_name":"Label Smoothing"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"position-wise-feed-forward-layer","method_name":"Position-Wise Feed-Forward Layer"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"transformer","method_name":"Transformer"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2005.00653","atlas_url":"https://app.syntology.ai/?focus=2005.00653","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":"2005.00653"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2005.00653\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2005.00653"},"call":"get_concepts_for_paper(arxiv_id=\"2005.00653\")"}],"by_repo":[{"repo":"wasiahmad/NeuralCodeSum","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CGCL-codes/naturalcc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MaratSaidov/source-code-summarization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Zhangxq-1/coderepository","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"code-desc/codesc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.03511"],"harvested_for_calls":[{"arxiv_id":"2006.03511","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.03511"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.03511\")"}]},{"repo":"csebuetnlp/CoDesc","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2105.14220"],"harvested_for_calls":[{"arxiv_id":"2105.14220","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2105.14220"},"call":"get_harvested_code_for_paper(arxiv_id=\"2105.14220\")"}]},{"repo":"jadecxliu/codeqa","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2109.08365"],"harvested_for_calls":[{"arxiv_id":"2109.08365","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.08365"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.08365\")"}]},{"repo":"sjj0403/GSCS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tmuttaqueen/NeuralCodeSum-smalltest","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":"2bbebdba618ed1dbe8a60a9bf01a4be7100a29e588d15c3b32d59c8f84cd04a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}