<  Back to the Polytechnique Montréal portal

Levenshtein edit distance-based type III clone detection using metric trees

Thierry M. Lavoie and Ettore Merlo

Technical Report (2011)

Open Acess document in PolyPublie and at official publisher
[img]
Preview
Open Access to the full text of this document
Published Version
Terms of Use: Tous droits réservés
Download (468kB)
Show abstract
Hide abstract

Abstract

This paper presents an original technique for clone detection with metric trees using Levenshtein distance as the metric defined between two code fragments. This approach achieves a faster empirical performance. The resulting clones may be found with varying thresholds allowing type 3 clone detection. Experimental results of metric trees performance as well as clone detection statistics on an open source system are presented and give promising perspectives.

Subjects: 2700 Information technology > 2705 Software and development
2700 Information technology > 2706 Software engineering
Department: Department of Computer Engineering and Software Engineering
Funders: CRSNG/NSERC
PolyPublie URL: https://publications.polymtl.ca/2638/
Report number: EPM-RT-2011-01
Date Deposited: 06 Oct 2017 13:37
Last Modified: 16 Apr 2024 07:14
Cite in APA 7: Lavoie, T. M., & Merlo, E. (2011). Levenshtein edit distance-based type III clone detection using metric trees. (Technical Report n° EPM-RT-2011-01). https://publications.polymtl.ca/2638/

Statistics

Total downloads

Downloads per month in the last year

Origin of downloads

Repository Staff Only

View Item View Item