Abstract

AbstractWith the increasing popularity of programming courses, the cases of plagiarism also rises rapidly as well. Plagiarism detection methods and verifying the originality of student’s work program has become particularly important nowadays. By studying similar measurement techniques of existing code, this document focuses on the forward maximum matching algorithm proposed to improve an existing and efficient segmentation method while proposing effective marker string replacement rules in order to shorten the length of the string tag. At the same time, this paper proposes a new marker string generation method – generating tag strings in accordance with each function execution sequence, in order to eliminate redundant functions of the test results. Finally, the system would take the RKR-GST algorithm as a token string matching algorithm. The experimental tests have shown that the improvement over plagiarism detection program code has a significant effect in the long run.Keywordsplagiarism detectiongenerating tag strings by the function sequenceRKR-GST algorithmforward maximum matching algorithm

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.