K-Gram As A Determinant Of Plagiarism Level in Rabin-Karp Algorithm

Siahaan, Andysah Putera Utama; Mesran, Mesran; Rahim, Robbi; Siregar, Dodi

doi:10.31219/osf.io/yxjnp

Cited by 2 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The value produced by the K-gram is not always an accurate representation of the document [21]. The selection of the k value on K-gram in word cutting is often done freely.…”

Section: Introductionmentioning

confidence: 99%

An arrangement of the number of K-grams in the performance of Rabin Karp algorithm in text adjustment

Astuti

Wulandari

2022

IJEECS

View full text Add to dashboard Cite

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.

show abstract

“…The value produced by the K-gram is not always an accurate representation of the document [21]. The selection of the k value on K-gram in word cutting is often done freely.…”

Section: Introductionmentioning

confidence: 99%

An arrangement of the number of K-grams in the performance of Rabin Karp algorithm in text adjustment

Astuti

Wulandari

2022

IJEECS

View full text Add to dashboard Cite

show abstract

“…This algorithm does not require particular circumstances or perform a multiplier operation, so efficiency and stability improvements occur significantly. Then Siahaan et al [21] Discusses the Rabin Karp algorithm to detect the similarity of two strings. In this algorithm, the plagiarism level is determined based on the same hash value on checking the two documents.…”

Section: Introductionmentioning

confidence: 99%

“…It must be in the coordinates of a predetermined location using the Point Inclusion in Polygon Test (PNPOLY) method [22]. While control the data consistency in the blockchain process using the Rabin Karp algorithm method [21] to limit the predetermined error tolerance in the process cryptospatial coordinate to support cultural heritage tourism has been done. This paper is arranged as follows: Section II briefly presents the material and methods of PNPOLY, Rabin Karp Algorithm, PBFT, and RPCA.…”

Section: Introductionmentioning

confidence: 99%

Enhanced PBFT Blockchain based on a Combination of Ripple and PBFT (R-PBFT) to Cryptospatial Coordinate

Wibowo¹,

Hariadi

Suhartono

et al. 2022

regist. j. ilm. teknol. sist. inf.

View full text Add to dashboard Cite

In this research, we introduce the combination of two Blockchain methods. Ripple Protocol Consensus Algorithm (RPCA) and Practical Byzantine Fault Tolerance (PBFT) are applied to cryptospatial coordinates to support cultural heritage tourism. The PBFT process is still used until the preparation process to ensure a maximum error of 33%, and every node would add a new chain in all nodes, so PBFT has a slower processing speed than other methods. This research cuts the PBFT process. After the preparation process in PBFT, the data was entered into the RPCA node and was calculated using an equation to minimize errors with a maximum limit of 20%. After this process, the was were sent to the commit process to store the data in all connected nodes in the Blockchain network; we call this combination of two methods R-PBFT. Combining the two methods can enhance data processing security and speed because it still uses the PBFT work combined with the speed of RPCA. Furthermore, this method uses a fault tolerance value from the RPCA of 20% to enhance data processing security and speed.

show abstract

K-Gram As A Determinant Of Plagiarism Level in Rabin-Karp Algorithm

Abstract: Rabin-Karp is one of the algorithms used to detect the similarity levels of two strings.

Cited by 2 publications

References 0 publications

An arrangement of the number of K-grams in the performance of Rabin Karp algorithm in text adjustment

An arrangement of the number of K-grams in the performance of Rabin Karp algorithm in text adjustment

Enhanced PBFT Blockchain based on a Combination of Ripple and PBFT (R-PBFT) to Cryptospatial Coordinate

Contact Info

Product

Resources

About