The DOI matches its Crossref record.
Text Documents Plagiarism Detection using Rabin-Karp and Jaro-Winkler Distance Algorithms
Open accessAbstract
Plagiarism is an act that is considered by the university as a fraud by taking someone ideas or writings without mentioning the references and claimed as his own. Plagiarism detection system is generally implement string matching algorithm in a text document to search for common words between documents. There are some algorithms used for string matching, two of them are Rabin-Karp and Jaro-Winkler Distance algorithms. Rabin-Karp algorithm is one of compatible algorithms to solve the problem of multiple string patterns, while, Jaro-Winkler Distance algorithm has advantages in terms of time. A plagiarism detection application is developed and tested on different types of documents, i.e. doc, docx, pdf and txt. From the experimental results, we obtained that both of these algorithms can be used to perform plagiarism detection of those documents, but in terms of their effectiveness, Rabin-Karp algorithm is much more effective and faster in the process of detecting the document with the size more than 1000 KB.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
Rabin-Karp demonstrates superior performance in plagiarism detection compared to Brute Force and Boyer-Moore algorithms, despite limitations in accurately distinguishing similar words.
“Although the Rabin-Karp algorithm exhibits limitations in accurately distinguishing between similar words, it demonstrates superior performance in plagiarism detection when compared to the Brute Force and Boyer-Moore algorithms [23].”
From Comparison of Cosine Similarity, Rabin-Karp, and Levenshtein Distance Algorithms for Plagiarism Detection in Document (2025) · cites this paper as [23]
Citations
Cited by
Sorted by citations
Astuti, Y., & Wulandari, I. R. (2022) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v26.i3.pp1388-1394 · Cited by 4
Pardede, J., Yudistira, A., & Yudistira, A. (2025) · Ultimatics: Jurnal Teknik Informatika · doi:10.31937/ti.v17i1.3867
Metadata
- Authors
- Leonardo, B., & Hansun, S.
- Affiliations
- Multimedia Nusantara University (ID)
- ORCID
- Hansun, Seng
- Venue
- Indonesian Journal of Electrical Engineering and Computer Science
- Published
- 2017-02-01
- Volume
- 5
- Issue
- 2
- Pages
- 462
- ISSN
- 2502-4752 (ISSN-L)
- 2502-4760
- OpenAlex
- W2595847594
- Cited by
- 33
- References
- 0
- Citations by year
- 2025: 1 · 2024: 4 · 2023: 4 · 2022: 10 · 2021: 5 · 2020: 3 · 2019: 2 · 2018: 4
- FWCI
- 5.64
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- Indonesian Journal of Electrical Engineering and Computer Science (publishedVersion, cc-by-nc-nd)
- 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, Jaro-Winkler distance, string matching, multiple pattern matching, document similarity
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