TY - JOUR
T1 - Calculating Similarity of Javadoc Comments
AU - Koznov, D. V.
AU - Ledeneva, E. Yu
AU - Luciv, D. V.
AU - Braslavski, P. I.
N1 - Publisher Copyright:
© Pleiades Publishing, Ltd. 2024. ISSN 0361-7688, Programming and Computer Software, 2024, Vol. 50, No. 1, pp. 85–89. Pleiades Publishing, Ltd., 2024. Russian Text The Author(s), 2023, published in Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS), 2023, Vol. 35, No. 4.
PY - 2024/2
Y1 - 2024/2
N2 - Abstract: Code comments are an essential part of software documentation. Many software projects suffer from the problem of low-quality comments that are often produced by copy-paste. In case of similar methods, classes, etc. copy-pasted comments with minor modifications are justified. However, in many cases this approach leads to degraded documentation quality and, subsequently, to problematic maintenance and development of the project. In this study, we address the problem of near-duplicate code comments detection, which can potentially improve software documentation. We have conducted a thorough evaluation of traditional string similarity metrics and modern machine learning methods. In our experiment, we use a collection of Javadoc comments from four industrial open-source Java projects. We have found out that LCS (Longest Common Subsequence) is the best similarity algorithm taking into account both quality (Precision 94%, Recall 74%) and performance.
AB - Abstract: Code comments are an essential part of software documentation. Many software projects suffer from the problem of low-quality comments that are often produced by copy-paste. In case of similar methods, classes, etc. copy-pasted comments with minor modifications are justified. However, in many cases this approach leads to degraded documentation quality and, subsequently, to problematic maintenance and development of the project. In this study, we address the problem of near-duplicate code comments detection, which can potentially improve software documentation. We have conducted a thorough evaluation of traditional string similarity metrics and modern machine learning methods. In our experiment, we use a collection of Javadoc comments from four industrial open-source Java projects. We have found out that LCS (Longest Common Subsequence) is the best similarity algorithm taking into account both quality (Precision 94%, Recall 74%) and performance.
KW - Javadoc comments
KW - similarity measure
KW - software documentation
UR - http://www.scopus.com/inward/record.url?scp=85194052278&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85194052278&partnerID=8YFLogxK
U2 - 10.1134/S0361768824010043
DO - 10.1134/S0361768824010043
M3 - Article
AN - SCOPUS:85194052278
SN - 0361-7688
VL - 50
SP - 85
EP - 89
JO - Programming and Computer Software
JF - Programming and Computer Software
IS - 1
ER -