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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AST-Enhanced or AST-Overloaded? The Surprising Impact of Hybrid Graph Representations on Code Clone Detection
On the Use of Deep Learning Models for Semantic Clone Detection
The Struggles of LLMs in Cross-lingual Code Clone Detection
Advanced Detection of Source Code Clones via an Ensemble of Unsupervised Similarity Measures
Trained Without My Consent: Detecting Code Inclusion In Language Models Trained on Code
Investigating the Efficacy of Large Language Models for Code Clone Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.