The DOI matches its Crossref record.
Best Parameter Selection Of Rabin-Karp Algorithm In Detecting Document Similarity
Abstract
Text mining is usually used to detect document similarities and plagiarism. The field of education is one area that is prone to plagiarism. Plagiarism can kill someone's creativity because this action does not require energy and does not have to think hard. Therefore, the act of plagiarism must be prevented from causing harm to various parties. By using matching strings on documents, it can be used to detect plagiarism. One method that can be used is Rabin-Karp Algorithm, but in several studies that have been done the researchers did not test the k-gram value and database value, in theory, this would affect the performance of the Rabin-Karp Algorithm. Therefore in this study, the selection of k-gram values and prime bases was conducted to determine the effect on the performance of the Rabin-Karp Algorithm. The results showed that the selection of gram values and prime bases affected the processing time in testing the data and the similarity values of the documents being tested. In this study the value of k = 5 on k-gram has the fastest time for the testing process, both testing with multiple data 25 and testing the data for all amounts of data the number is 300.
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?
In the citing paper
“Hence, 4-gram is more suitable for plagiarism detection.”
From Comparison of Cosine Similarity, Rabin-Karp, and Levenshtein Distance Algorithms for Plagiarism Detection in Document (2025) · cites this paper as [11]
In the citing paper
“Similarity values are highly influenced by the sentence structure in Rabin-Karp, whereas it has no impact at all on Ratcliff/Obershelp [11].”
From Comparison of Cosine Similarity, Rabin-Karp, and Levenshtein Distance Algorithms for Plagiarism Detection in Document (2025) · cites this paper as [11]
In the citing paper
“This study adds to the previous research [11] that besides sentence arrangement, the similarity score in the Rabin-Karp algorithm is also influenced by the word arrangement.”
From Comparison of Cosine Similarity, Rabin-Karp, and Levenshtein Distance Algorithms for Plagiarism Detection in Document (2025) · cites this paper as [11]
In the citing paper
“The Rabin-Karp algorithm can be used for searching long pattern strings but has a longer execution time compared to Ratcliff/Obershelp.”
From Comparison of Cosine Similarity, Rabin-Karp, and Levenshtein Distance Algorithms for Plagiarism Detection in Document (2025) · cites this paper as [11]
Citations
Cited by
Sorted by citations
Pardede, J., Yudistira, A., & Yudistira, A. (2025) · Ultimatics: Jurnal Teknik Informatika · doi:10.31937/ti.v17i1.3867
Metadata
- Authors
- Hartanto, A. D., Syaputra, A., & Pristyanto, Y.
- Affiliations
- Universitas Amikom Yogyakarta (ID)
- Venue
- 2019 International Conference on Information and Communications Technology (ICOIACT)
- Publisher
- IEEE
- Published
- 2019-07
- Pages
- 457-461
- OpenAlex
- W2998426037
- Cited by
- 15
- References
- 0
- Citations by year
- 2025: 1 · 2024: 4 · 2023: 2 · 2022: 4 · 2021: 4
- FWCI
- 0.77
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- International Conference on Information and Communications Technology (ICOIACT) (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Social Sciences › Education › Academic integrity and plagiarism
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Keywords
- Rabin-Karp algorithm, plagiarism detection, document similarity, string matching, text mining, processing time
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: Best Parameter Selection Of Rabin-Karp Algorithm In Detecting Document Similarity. https://app.cochat.ai/papers/10.1109/icoiact46704.2019.8938458
- The paper
- Hartanto, A. D., Syaputra, A., & Pristyanto, Y. (2019). Best Parameter Selection Of Rabin-Karp Algorithm In Detecting Document Similarity. 2019 International Conference on Information and Communications Technology (ICOIACT). https://doi.org/10.1109/icoiact46704.2019.8938458
