The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
An arrangement of the number of K-grams in the performance of Rabin Karp algorithm in text adjustment
Open accessAbstract
Rabin Karp algorithm is frequently used to determine the similarity between texts, using the hash function to compare the string identified and the substring in the text. The choice of the k value in the K-gram is often unrestricted. The number of k values used when cutting some terms will take longer if tried one by one. This research will perform a word cutting test on a script using K-gram 0 to 8. The results will cover the effect of the value of each K used on the similarity percentage produced. This research aims to determine the effect of the number of K-grams on the performance of Rabin Karp in text matching. The test underwent 20 sentences and 10 times using the dice coefficient for text similarity testing. The conclusion of this research should not use the K-gram 0 to 2 due to the K-gram basic principle: character deduction. Subsequently, if the character is 0,1,2, it does not have a meaning yet; thus, it gets a high similarity percentage. Based on trials by taking samples of K-gram 0 to 8 from 10 test data sets; the K-gram 3 is the best among K-grams 0 to 8.
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
“Responding to the study [12], it is observed that the same sentence with different word order can yield different similarity scores.”
From Comparison of Cosine Similarity, Rabin-Karp, and Levenshtein Distance Algorithms for Plagiarism Detection in Document (2025) · cites this paper as [12]
Citations
Cites
Cai, C., Rodet, T., & Lambert, M. (2014) · Journal of Physics Conference Series · doi:10.1088/1742-6596/542/1/012009 · Cited by 12,162
Text Mining: Techniques, Applications and Issues
Talib, R., Kashif, M., Ayesha, S., & Fatima, F. (2016) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2016.071153 · Cited by 219
Intrinsic Plagiarism Detection Using Character n-gram Profiles
Stamatatos, E. (2009) · Cited by 153
An analysis of the Karp-Rabin string matching algorithm
Gonnet, G. H., & Baeza-Yates, R. A. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90135-k · Cited by 45
Text Documents Plagiarism Detection using Rabin-Karp and Jaro-Winkler Distance Algorithms
Leonardo, B., & Hansun, S. (2017) · Indonesian Journal of Electrical Engineering and Computer Science · doi:10.11591/ijeecs.v5.i2.pp462-471 · Cited by 33
Recursive n-gram hashing is pairwise independent, at best
Lemire, D., & Kaser, O. (2009) · Computer Speech & Language · doi:10.1016/j.csl.2009.12.001 · Cited by 21
Rabin-Karp Elaboration in Comparing Pattern Based on Hash Data
Siahaan, A. P. U. (2018) · International Journal of Security and Its Applications · doi:10.14257/ijsia.2018.12.2.06 · Cited by 18
Recursive n-gram hashing is pairwise independent, at bestPreprint
Daniel Lemire, A., & Owen Kaser, B. (2012) · Cited by 17
Rabin Karp And Winnowing Algorithm For Statistics Of Text Document Plagiarism Detection
Leman, D., Rahman, M., Ikorasaki, F., Riza, B. S., & Akbar, M. B. (2019) · International Conference on Cyber and IT Service Management (CITSM) · doi:10.1109/citsm47753.2019.8965422 · Cited by 16
Removal of Modulo as Hashing Modification Process in Essay Scoring System Using Rabin-Karp
Rasywir, E., Pratama, Y., Hendrawan, & Istoningtyas, M. (2018) · doi:10.1109/icecos.2018.8605211 · Cited by 14
Flagged first, then by citations
Cited by
Sorted by citations
Habeeb, F. A., Saber, S. M., Abdulameer, S. M., Gheni, H. M., & Radhi, A. D. (2022) · Bulletin of Electrical Engineering and Informatics · doi:10.11591/eei.v11i6.4346 · Cited by 1
Modeling Plagiarism Prevention in Scientific Publication Using Enhanced Blockchain
Wong, N. P., Juliandy, C., & Darwin (2024) · International Conference on Technology Innovation and Its Applications (ICTIIA) · doi:10.1109/ictiia61827.2024.10761924 · Cited by 1
Pardede, J., Yudistira, A., & Yudistira, A. (2025) · Ultimatics: Jurnal Teknik Informatika · doi:10.31937/ti.v17i1.3867
Sari, L. A. D. F., Sastra, N. P., & Hartati, R. S. (2024) · Majalah Ilmiah Teknologi Elektro · doi:10.24843/mite.2023.v22i02.p15
Advancing Automatic Essay Scoring using Synonym-Aware Rabin-Karp Algorithm
Cahyani, A. D., Basuki, A., Khotimah, B. K., Yusuf, M., Oktavianti, I. S., & Mufarroha, F. A. (2025) · International Conference on Cybernetics and Intelligent System (ICORIS) · doi:10.1109/icoris67789.2025.11296037
Metadata
- Authors
- Astuti, Y., & Wulandari, I. R.
- Affiliations
- Universitas Amikom Yogyakarta (ID)
- ORCID
- Astuti, Yuli
- Venue
- Indonesian Journal of Electrical Engineering and Computer Science
- Published
- 2022-06-01
- Volume
- 26
- Issue
- 3
- Pages
- 1388
- ISSN
- 2502-4752 (ISSN-L)
- 2502-4760
- OpenAlex
- W4281656008
- Cited by
- 4
- References
- 23
- Citations by year
- 2025: 1 · 2024: 2 · 2022: 1
- FWCI
- 0.33
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- Locations
- Indonesian Journal of Electrical Engineering and Computer Science (publishedVersion, cc-by-nc)
- Zenodo (CERN European Organization for Nuclear Research) (submittedVersion, cc-by)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Information Systems › Data Quality and Management
- Physical Sciences › Computer Science › Information Systems › Software Engineering Research
- Keywords
- Rabin-Karp algorithm, k-gram, text similarity, text matching, word segmentation, Dice coefficient, hash functions, substring search
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
