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

Siahaan, Andysah Putera Utama; Rahim, Robbi; Mesran, Mesran; Siregar, Dodi

doi:10.31227/osf.io/trfkh

Cited by 5 publications

(6 citation statements)

References 4 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Selain itu, peneliti lain fokus pada tipe dokumen fingerprint yang digunakan untuk mendeteksi keakuratan salinan dokumen baik semua teks maupun sebagian. Algoritma yang termasuk dalam kelompok ini adalah algoritma Rabin-Karp [12,13,14] dan algoritma Winnowing [15,16,17].…”

Section: Title Of Manuscript Is Short and Clear Implies Research Resunclassified

Aplikasi Pendeteksi Tingkat Kesamaan Dokumen Teks: Algoritma Rabin Karp Vs. Winnowing

Sugiono¹,

Herwin²,

Hamdani³

et al. 2018

Digitalzone

View full text Add to dashboard Cite

Tindakan copy paste dokumen teks sering terjadi dalam penulisan karya ilmiah tanpa memberikan kredit kepada yang mempunyai dokumen teks tersebut. Tindakan melanggar kode etik ini disebabkan karena tersedianya fasilitas menyalin dan menempel teks pada aplikasi pengolah kata. Tujuan dari penelitian ini adalah untuk membangun sebuah aplikasi yang mampu mendeteksi tingkat kesamaan dokumen teks dengan terlebih dahulu membandingkan tingkat kehandalan dari dua algoritma pendeteksi kesamaan teks yaitu algoritma rabin-karp dan algoritma winnowing. Perbandingan dilakukan terhadap dua variabel yaitu tingkat kemampuan mendeteksi dan waktu pemrosesan. Hasil menunjukkan bawah algoritma winnowing lebih unggul dibandingkan algoritma rabin-karp dari sisi tingkat akurasi maupun dari sisi waktu pemrosesan. Abstract The behavior of copy pastes the text document often occurs in scientific writing without giving credit to those who have the text document. The behavior of this missing code of conduct due to the availability of facility to copy and paste the text in a word processing application. The purpose of this study is to build an application that can detect the index of similarity of text documents by first comparing the level of reliability of the two text similarity algorithms, i.e., Rabin-Karp and Winnowing. The comparison is measured based on two variables; the level of capability of detecting and processing time. The result shows that Winnowing algorithm outperforms Rabin-Karp in term of both accuracy and processing time. Keywords: Rabin-Karp, Winnowing, Plagiarism Detection, Text Similarity

show abstract

Section: Title Of Manuscript Is Short and Clear Implies Research Resunclassified

Aplikasi Pendeteksi Tingkat Kesamaan Dokumen Teks: Algoritma Rabin Karp Vs. Winnowing

Sugiono¹,

Herwin²,

Hamdani³

et al. 2018

Digitalzone

View full text Add to dashboard Cite

show abstract

“…This algorithm has the principle that if two strings are the same, then the hash value of the two strings must be the same, so the algorithm will only look for strings that have the same hash value as the value of the string being searched. The algorithm has a weakness caused by the principle that all strings to look for are considered to have the same hash value as the obtained string [9]. It only compares the hash value of both then it will often happen the case where the string obtained is not a search string but hash value the same one.…”

Section: Rabin-karpmentioning

confidence: 99%

“…Rabin-Karp method is used to detect the level of similarity of documents that occur [8]. This method will calculate the relationship values of each word in the comparable documents [9]. In the process of detecting plagiarism using the Rabin-Karp method, this should be supported by pre-processing to do word mining.…”

Section: Introductionmentioning

confidence: 99%

Combination of levenshtein distance and rabin-karp to improve the accuracy of document equivalence level

Siahaan¹,

Aryza²,

Hariyanto³

et al. 2018

IJET

View full text Add to dashboard Cite

Rabin Karp algorithm is a search algorithm that searches for a substring pattern in a text using hashing. It is beneficial for matching words with many patterns. One of the practical applications of Rabin Karp's algorithm is in the detection of plagiarism. Michael O. Rabin and Richard M. Karp invented the algorithm. This algorithm performs string search by using a hash function. A hash function is the values that are compared between two documents to determine the level of similarity of the document. Rabin-Karp algorithm is not very good for single pattern text search. This algorithm is perfect for multiple pattern search. The Levenshtein algorithm can be used to replace the hash calculation on the Rabin-Karp algorithm. The hash calculation on Rabin-Karp only counts the number of hashes that have the same value in both documents. Using the Levenshtein algorithm, the calculation of the hash distance in both documents will result in better accuracy.

show abstract

“…The image will be divided into two types, training and testing. Rabin-Karp is a string matching method that utilizes the word pieces in each string [7] [8]. This algorithm has hash value to determine the feature value of each piece of the word [4][5] [12].…”

Section: Introductionmentioning

confidence: 99%

Rabin-Karp Elaboration in Comparing Pattern Based on Hash Data

Siahaan¹

2018

IJSIA

Self Cite

View full text Add to dashboard Cite

show abstract

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

Abstract: Rabin-Karp is one of the algorithms used to detect the similarity levels of two strings.

Cited by 5 publications

References 4 publications

Aplikasi Pendeteksi Tingkat Kesamaan Dokumen Teks: Algoritma Rabin Karp Vs. Winnowing

Aplikasi Pendeteksi Tingkat Kesamaan Dokumen Teks: Algoritma Rabin Karp Vs. Winnowing

Combination of levenshtein distance and rabin-karp to improve the accuracy of document equivalence level

Rabin-Karp Elaboration in Comparing Pattern Based on Hash Data

Contact Info

Product

Resources

About