K-Gram As A Determinant Of Plagiarism Level In Rabin-Karp Algorithm

Rabin-Karp is one of the algorithms used to detect the similarity levels of two strings. In this case, the string can be either a short sentence or a document containing complex words. In this algorithm, the plagiarism level determination is based on the same hash value on both documents examined. Each word will form K-Gram of a certain length. The K-Gram will then be converted into a hash value. Each hash value in the source document will be compared to the hash value in the target document. The same number of hashes is the level of plagiarism created. The length of K-Gram is the determinant of the plagiarism level. By determining the proper length of K-Gram, it produces the accurate result. The results will vary for each K-Gram value.

REFERENCES

[1]. S. K. Shivaji and P. S., "Plagiarism Detection by using Karp-Rabin and String Matching Algorithm Together," International Journal of Computer Applications, vol. 116, no. 23, pp. 37-41, 2015.

[2]. M. Cebri�n, M. Alfonseca and A. Ortega, "Towards the Validation of Plagiarism Detection Tools by Means of Grammar Evolution," IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, pp. 71-77, 2009.

[3]. A. Parker and J. O. Hamblen, "Computer Algorithm for Plagiarism Detection," IEEE Trans. Education, vol. 32, no. 2, pp. 94-99, 1989.

[4]. A. Apostolico, String editing and Longest Common Subsequences, vol. 3, Germany: Springer-Verlag, 1997, pp. 1-10.

[5]. Sunita, R. Malik and M. Gulia, "Rabin-Karp Algorithm with Hashing a String Matching Tool," International Journal of Advanced Research in Computer Science and Software Engineering, vol. 4, no. 3, pp. 389-392, 2014.

[6]. A. P. Gope and R. N. Behera, "A Novel Pattern Matching Algorithm in Genome," International Journal of Computer Science and Information Technologies, vol. 5, no. 4, pp. 5450-5457, 2014.