%0 Journal Article %1 WOS:000464129300009 %A Allyson, Franca B %A Danilo, Maciel L %A Jose, Soares M %A Giovanni, Barroso C %C 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1314 USA %D 2019 %I IEEE COMPUTER SOC %J IEEE TRANSACTIONS ON COMPUTERS %K code conformity} data detection; investigation method normalization; of preprocessing; similarity tool; {Source %N 5 %P 740-751 %R 10.1109/TC.2018.2881449 %T Sherlock N-overlap: Invasive Normalization and Overlap Coefficient for the Similarity Analysis Between Source Code %V 68 %X Some tools for detecting similarity, such as Sherlock, compare textual documents of any nature, but have limitations to compare source code files. The presence or absence of blank spaces between structure elements, variable names, among other actions interfere with the similarity index found. This paper evidences that the preprocessing of the source code improves Sherlock performance. The results are based on experiments conducted with 66 source code previously plagiarized, and a base formed by 2160 codes created by students of engineering courses in programming classes. In this last set, the situation of similarity was not previously known, so a method was created to calculate precision and recall, in a relative way, based on a set of reference tools, as a kind of oracle. Our approach, called Sherlock N-overlap obtained, in most of the cases tested, similarity indexes superior to other complex tools such as MOSS, JPlag and SIM.

@article{WOS:000464129300009, abstract = {Some tools for detecting similarity, such as Sherlock, compare textual documents of any nature, but have limitations to compare source code files. The presence or absence of blank spaces between structure elements, variable names, among other actions interfere with the similarity index found. This paper evidences that the preprocessing of the source code improves Sherlock performance. The results are based on experiments conducted with 66 source code previously plagiarized, and a base formed by 2160 codes created by students of engineering courses in programming classes. In this last set, the situation of similarity was not previously known, so a method was created to calculate precision and recall, in a relative way, based on a set of reference tools, as a kind of oracle. Our approach, called Sherlock N-overlap obtained, in most of the cases tested, similarity indexes superior to other complex tools such as MOSS, JPlag and SIM.}, added-at = {2022-05-23T20:00:14.000+0200}, address = {10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1314 USA}, author = {Allyson, Franca B and Danilo, Maciel L and Jose, Soares M and Giovanni, Barroso C}, biburl = {https://www.bibsonomy.org/bibtex/22dd7827378f975315f5ceb2755ca4add/ppgfis_ufc_br}, doi = {10.1109/TC.2018.2881449}, interhash = {3506038ee03427fa841e0cfae32eb48f}, intrahash = {2dd7827378f975315f5ceb2755ca4add}, issn = {0018-9340}, journal = {IEEE TRANSACTIONS ON COMPUTERS}, keywords = {code conformity} data detection; investigation method normalization; of preprocessing; similarity tool; {Source}, number = 5, pages = {740-751}, publisher = {IEEE COMPUTER SOC}, pubstate = {published}, timestamp = {2022-05-23T20:00:14.000+0200}, title = {Sherlock N-overlap: Invasive Normalization and Overlap Coefficient for the Similarity Analysis Between Source Code}, tppubtype = {article}, volume = 68, year = 2019 }