Pith. sign in

REVIEW 3 cited by

A Transformer-based Approach for Source Code Summarization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.00653 v1 pith:XTVDO3FR submitted 2020-05-01 cs.SE cs.AIcs.LGstat.ML

classification cs.SEcs.AIcs.LGstat.ML
keywords codesummarizationsourceapproachdependenciesencodinglong-rangerepresentation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimizing Datasets for Code Summarization: Is Code-Comment Coherence Enough?

    cs.SE 2025-02 conditional novelty 6.0 of 10

    Filtering code summarization training data by code-comment coherence gives no better results than random selection, and halving the training set does not hurt performance.

  2. Seamlessly Integrating Tree-Based Positional Embeddings into Transformer Models for Source Code Representation

    cs.LG 2025-07 conditional novelty 4.0 of 10

    Adding depth and sibling-index embeddings from abstract syntax trees to CodeBERTa yields small gains on masked language modeling and clone detection, mainly with a weighted-sum integration.

  3. Resource-Efficient & Effective Code Summarization

    cs.SE 2025-02 conditional novelty 4.0 of 10

    QLoRA fine-tuning outperforms full fine-tuning for code summarization on CodeXGLUE while cutting GPU memory by roughly two-thirds.

Pith tools