Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem

Plagiarism Detection Algorithm for Source Code in Computer Science Education

International Journal of Distance Education Technologies ◽

10.4018/ijdet.2015100102 ◽

2015 ◽

Vol 13 (4) ◽

pp. 29-39 ◽

Cited By ~ 5

Author(s):

Xin Liu ◽

Chan Xu ◽

Boyu Ouyang

Keyword(s):

Hash Function ◽

Source Code ◽

College Education ◽

Detection Algorithm ◽

Longest Common Subsequence ◽

The Other ◽

Plagiarism Detection ◽

Detection Algorithms ◽

Common Subsequence ◽

Basic Concepts

Nowadays, computer programming is getting more necessary in the course of program design in college education. However, the trick of plagiarizing plus a little modification exists among some students' home works. It's not easy for teachers to judge if there's plagiarizing in source code or not. Traditional detection algorithms cannot fit this condition. The author designed an effective and complete method to detect source code plagiarizing according to the popular way of students' plagiarizing. There are two basic concepts of the algorithm. One is to standardize the source code via filtration against to remove the majority noises intentionally blended by plagiarists. The other one is an improved Longest Common Subsequence algorithm for text matching, using statement as the unit for matching. The authors also designed an appropriate HASH function to increase the efficiency of matching. Based on the algorithm, a system was designed and proved to be practical and sufficient, which runs well and meet the practical requirement in application.

Download Full-text

Plagiarism Detection Algorithm for Source Code in Computer Science Education

Scholarly Ethics and Publishing ◽

10.4018/978-1-5225-8057-7.ch017 ◽

2019 ◽

pp. 354-365

Author(s):

Xin Liu ◽

Chan Xu ◽

Boyu Ouyang

Keyword(s):

Hash Function ◽

Source Code ◽

College Education ◽

Detection Algorithm ◽

Longest Common Subsequence ◽

The Other ◽

Plagiarism Detection ◽

Detection Algorithms ◽

Common Subsequence ◽

Basic Concepts

Nowadays, computer programming is getting more necessary in the course of program design in college education. However, the trick of plagiarizing plus a little modification exists among some students' home works. It's not easy for teachers to judge if there's plagiarizing in source code or not. Traditional detection algorithms cannot fit this condition. The author designed an effective and complete method to detect source code plagiarizing according to the popular way of students' plagiarizing. There are two basic concepts of the algorithm. One is to standardize the source code via filtration against to remove the majority noises intentionally blended by plagiarists. The other one is an improved Longest Common Subsequence algorithm for text matching, using statement as the unit for matching. The authors also designed an appropriate HASH function to increase the efficiency of matching. Based on the algorithm, a system was designed and proved to be practical and sufficient, which runs well and meet the practical requirement in application.

Download Full-text