A study on fast plagiarism checking algorithm - II

Abstract

With increasing concern of intellectual property, different plagiarism check systems have been developed. The aim of this project is attempting a new approach to achieve less time consuming in plagiarism checking. The new approach is using hash table to construct the data structure, so that plagiarism checking can be speeded up when performing hash table look up. A pool of reference documents is needed to be constructed. Before setting up the pool of reference documents, preprocessing is necessary to be done which is dividing the reference documents into short segments. The short segments are used to construct a hash table after finishing preprocessing. When finishing setting up the pool of reference documents, the plagiarism check can be performed. A paper, which is gonging to be plagiarism checked, is also needed to be divided into short segments. After that, the segment of the paper will be hash table looked up in the pool of reference documents; and if the matching is found, system would record it and continue looking up next segment of the paper. A plagiarism report will be generated after finishing all the segments looking up.