Augmenting the Interpretability of GraphCodeBERT for Code Similarity Tasks
<|reference_start|>Augmenting the Interpretability of GraphCodeBERT for Code Similarity Tasks: Assessing the degree of similarity of code fragments is crucial for ensuring software quality, but it remains challenging due to the need to capture the deeper semantic aspects of code. Traditional syntactic methods often fail to identify these connections. Recent advancements have addressed this challenge, though they frequently sacrifice interpretability. To improve this, we present an approach aiming to improve the transparency of the similarity assessment by using GraphCodeBERT, which enables the identification of semantic relationships between code fragments. This approach identifies similar code fragments and clarifies the reasons behind that identification, helping developers better understand and trust the results. The source code for our implementation is available at https://www.github.com/jorge-martinez-gil/graphcodebert-interpretability.<|reference_end|>
@article{martinez-gil2024augmenting,
    title={Augmenting the Interpretability of GraphCodeBERT for Code Similarity
  Tasks},
    author={Jorge Martinez-Gil},
    journal={arXiv preprint arXiv:2410.05275},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.05275},
    primaryClass={cs.IR}
}