The DOI matches its Crossref record.
PENERAPAN ALGORITMA RABIN-KARP DENGAN PENDEKATAN SYNONYM RECOGNITION SEBAGAI ANTISIPASI PLAGIARISME PADA PENULISAN SKRIPSI
Open accessAbstract
Plagiarisme dalam penulisan karangan ilmiah saat ini sangat mudah dilakukan. Untuk mengatasinya, setiap karya ilmiah tersebut perlu diperiksa apakah hasil plagiarisme atau bukan dengan memeriksa setiap jengkal teks yang ada. Sistem ini dibangun dengan mengimplementasikan algoritma Rabin-Karp. Untuk mendeteksi adanya kemiripan, dua teks dibandingkan dengan mentransformasikan ke dalam bentuk deretan angka yang mengacu pada tabel ASCII, disebut juga dengan proses hashing. Algoritma ini dikombinasikan dengan metode Synonym Recognition sehingga dapat menemukan kata-kata yang benar-benar sama atau kata yang sudah dirubah kebentuk kata yang bermakna sama.
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.
Integrity signals
Registry
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Untuk menghindari plagiarisme dalam artikel ilmiah, seperti pada masalah penelitian ini, dapat digunakan metode string matching atau pencocokan string [3][4] [5].”
From Implementasi Algoritma Rabin-Karp pada Pendeteksian Plagiarisme (2023) · cites this paper as [5]
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: 1
- Thomas H. Cormen, et al. 2009. Introduction to Algorithms. 3rd edition. MIT Press.
Cited by
Sorted by citations
Implementasi Algoritma Rabin-Karp pada Pendeteksian Plagiarisme
Saputra, A. K., Endra, R. Y., Ariani, F., Tanjung, T., & Prakarsya, A. (2023) · EXPERT Jurnal Manajemen Sistem Informasi dan Teknologi · doi:10.36448/expert.v13i1.3161 · Cited by 1
Metadata
- Authors
- Prima Putra, N., & Sularno, S.
- Affiliations
- Universitas Dharma Andalas (ID)
- Venue
- Jurnal Teknologi Dan Sistem Informasi Bisnis
- Publisher
- Universitas Dharma Andalas
- Published
- 2019-07-31
- Volume
- 1
- Issue
- 2
- Pages
- 48-58
- ISSN
- 2655-8238 (ISSN-L)
- OpenAlex
- W2991942056
- Cited by
- 6
- References
- 0
- Citations by year
- 2024: 1 · 2023: 3 · 2022: 1 · 2021: 1
- FWCI
- 0.87
- Type
- journal article
- Language
- id
- Open access
- diamond
- doi.org
- Licence
- cc-by
- Locations
- Jurnal Teknologi Dan Sistem Informasi Bisnis (publishedVersion, cc-by)
- Topics
- Social Sciences › Education › Academic integrity and plagiarism
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- plagiarism detection, Rabin-Karp algorithm, synonym recognition, text similarity, thesis writing, plagiarism avoidance
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
