Comparison of Carp Rabin Algorithm and Jaro-Winkler Distance to Determine The Equality of Sunda Languages
Khaerul Manaf, SW Pitara, Beki Subaeki, Rudy Gunawan, Rodiah Rodiah, Bakhtiar · 2019
In modern times Information Technology (IT) can make it easier for users to create, store and disseminate information to other users who need it. With this, IT also can make a problem with plagiarism. Where plagiarism is a topic that is often discussed, especially on campus. Because it needs attention to avoid this plagiarism. One way to reduce plagiarism is to detect the similarity of sentence texts in a document. There are several similarity detection programs including Turnitin, Eve2, CopyCatchGold, WodCheck, Glatt. One algorithm used to detect text similarity is Jaro Winkler Distance. This algorithm has a good accuracy in matching a relatively short string and can accurately check copies of documents after the tokenizing process. Another algorithm for detecting text similarities is the Rabin Karp algorithm. Rabin-Karp algorithm perform string matching hash value based on the text and the pattern hash value. Although slow in matching single patterns, this algorithm is suitable for long pattern searches. Then knowing the performance of each algorithm is carried out a comparison between these two algorithms.