Cited by 4Academic integrity and plagiarismAlgorithms and Data CompressionSoftware Engineering Research

The DOI matches its Crossref record.

Implementasi Algoritma Rabin-Karp Untuk Pendeteksian Plagiarisme Pada File Dokumen Berupa Text Berbasis Web

Open access
Aldian, Aldian, Mubarak, Mubarak·2022·Journal of Information System Research (JOSH)

Abstract

Plagiarism is always in the spotlight, not least in the academic sector both from school to college level. Therefore, prevention and early detection need to be done to minimize this plagiarism action. There are several methods that can be implemented, one of which uses the Rabin-Karp algorithm. Rabin-Karp algorithm is one of the string matching, algorithms that can be used to measure the level of similarity of text. The thesis aims to design and build an application using the Rabin-Karp algorithm to find the percentage of similarities in two document files in the form of tested text. According to the results of tests conducted by (Priambodo, 2018) between the original document and the document tested from the test results of 10 text documents using the Rabin-Karp algorithm, resulting in the largest accuracy rate of 47.58%. While the smallest accuracy rate is 19.28%. While the results of the analysis conducted from 10 documents tested with a value of k-gram 1, have obtained the largest percentage of similarity, which is 57.14% and the smallest at 28.57%. Where if the similarity value <30% is included in mild plagiarism, 30%-70% moderate plagiarism and >70% large plagiarism.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.47065/josh.v3i3.1404

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 5

  1. T. d. Safitri, "Perancangan Sistem Informasi Absensi Guru dan Staff Padasmik Pacakarya Tangerang Berbasis Web," Jurnal Sensi, vol. Iv, pp. 53-67, 2018:156.
  2. Priambodo, "Pendeteksi Plagiarisme Menggunakan Algoritma Rabin-Karp Dengan Metode Rolling Hash," Jurnal Informatika Universitas Pamulang, vol. III, pp. 39-45, 2018:39.
  3. Basyian. dkk, "Perancangan sistem Pendeteksi Plagiarisme Terhadap Topik Penelitian Menggunakan Metode K-Means Clustering dan Model Bayesian," Seminar Nasional Tekhnologi Informasi dan Multimedia, vol. II, pp. 209-222, 2018.
  4. A. d. Bangsa, "Aplikasi Pendeteksi Dugaan Awal Plagiarisme Pada Tugas Siswa dan Mahasiswa Berdasarkan Kemiripan Isi Teks Mengunakan Algoritma Levenshtein Distance," Jurnal Pinter, vol. IV, pp. 25-33, 2017.
  5. Z. d. Azhari, "Web Bassed Aplications In Calculation Of Family Heritage (Science Of Faroidh)," Sistem Informasi, vol. I, pp. 50-60, 2020.

Cited by

Sorted by citations

See all 4

Metadata

Authors
Aldian, A., & Mubarak, M.
Affiliations
Universitas Pamulang (ID)
Venue
Journal of Information System Research (JOSH)
Published
2022-04-27
Volume
3
Issue
3
Pages
150-154
ISSN
2686-228X (ISSN-L)
OpenAlex
W4368251664
Cited by
4
References
0
Citations by year
2024: 2 · 2023: 2
FWCI
1.16
Type
journal article
Language
en
Open access
Locations
Journal of Information System Research (JOSH) (publishedVersion, cc-by)
Topics
  • Social Sciences › Education › Academic integrity and plagiarism
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
Keywords
plagiarism detection, Rabin-Karp algorithm, string matching, text similarity, k-gram, academic integrity

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Implementasi Algoritma Rabin-Karp Untuk Pendeteksian Plagiarisme Pada File Dokumen Berupa Text Berbasis Web. https://app.cochat.ai/papers/10.47065/josh.v3i3.1404
The paper
Aldian, A., & Mubarak, M. (2022). Implementasi Algoritma Rabin-Karp Untuk Pendeteksian Plagiarisme Pada File Dokumen Berupa Text Berbasis Web. Journal of Information System Research (JOSH). https://doi.org/10.47065/josh.v3i3.1404