Perbandingan Algoritma N-gram dan Algoritma Knuth Morris Pratt untuk Mengukur Tingkat Akurasi Plagiarisme pada Dokumen Abstrak Skripsi Berbasis Website
Abstract
Plagiarism is a crime that often occurs in the academic world, plagiarism occurs because of theft of other people's work that is illegally recognized as if the work is his own. N-gram is an algorithm by cutting as many characters as N-characters in a sentence or word. While the Knuth Morris Pratt (KMP) algorithm is a string search algorithm, this algorithm is used to maintain information that is used to carry out the number of shifts whenever there is no matched patency in the text. The purpose of this study is to create a system to measure the comparison of the accuracy of the N-gram algorithm with a website-based KMP on a thesis abstract document. This research uses the waterfall system development method which has stages, namely analysis, design, coding, and testing. The KMP test results are better than N-gram where kmp has an average percentage of 3.8% while the N-gram 3.5% results are obtained from an average of 10 trials and 5 documents tested.
References
Asosiasi Penyelenggara Jasa Internet Indonesia, “Penetrasi & Profil Perilaku Pengguna Internet Indonesia,” 2018.
S. Sunardi, A. Yudhana, and I. A. Mukaromah, “Implementasi Deteksi Plagiarisme Menggunakan Metode N-Gram Dan Jaccard Similarity Terhadap Algoritma Winnowing,” Transmisi, vol. 20, no. 3, p. 105, 2018.
F. T. Waruwu and R. Mandala, “Perbandingan algoritma knuth morris pratt dan boyer moore dalam pencocokan string pada aplikasi kamus bahasa nias,” J. Ilm. INFOTEK, 2017.
R. D. Djati Pramono and S. Lorena, “Implementasi algoritma knuth-morris-pratt dalam aplikasi untuk penerjemahan idiom bahasa inggris 1),2),” pp. 1–6, 2015.
G. Booch, R. A. Maksimchuk, M. W. Engle, B. J. Young, J. Connallen, and K. A. Houston, “Object-oriented analysis and design with applications, third edition,” ACM SIGSOFT Softw. Eng. Notes, 2008.
Copyright (c) 2021 JITU : Journal Informatic Technology And Communication
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.