Comparison of Levenshtein and Jaro Winkler Algorithms in Information System for Searching Legislative Dokument (Case Study : Diskominfo Lahat)
##plugins.themes.bootstrap3.article.main##
Abstract
This study can measure the comparison of the Levenshtein Distance calculation and Jaro Winkler's calculation in recognizing sentence similarity. The test information used in this review consists of two test information, namely test information to measure calculation closeness and test information to measure calculation handling time. The calculation test is completed by using a counterfeit identification application to calculate the level of comparability and handling time made by the two calculations. After testing, the data from the results of the two tests is calculated on average to calculate the comparison results. The result of the similarity comparison obtained from Jaro Winkler's calculation is 76%, while the Levensthein Distance calculation is 57%. Then the average result of Jaro Winkler's calculation is 0.0052 seconds, while the Levensthein Distance calculation is 0.00028 seconds. Based on the results of the comparison, Jaro Winkler's calculation proved to have a higher level of word similarity and a faster handling time than the calculation using Levenshtein Distance in identifying sentence similarity.
##plugins.themes.bootstrap3.article.details##
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
The writer agreed that the article copyright by Smatika journal and the writer has the right to disseminate the paper published without permission in advance.
[2] Rachmania Nur Dwitiyastuti, Adharul Muttaqin, Muhammad Aswin, “Pengoreksi Kesalahan Ejaan Bahasa Indonesia Menggunakan Metode Levenshtein Distance,” J. Mhs. TEUB, vol. 1, 2013.
[3] Oktamal, F. Saptono, R dan Sulistyo, M., “Jaro-Winkler Distance dan Steaming untuk Deteksi Dini Hama Dan Penyakit Padi,” Semin. Nas. Sist. Inf. Indones. SESINDO, 2015.
[4] Sugiyono, Metode Penelitian Kuantitatif, Kualitatif, dan R&D. Bandung: Alphabet, 2019.
[5] Michael Julian Tannga, “Analisis Perbandingan Algoritma Levenshtein Distance Dan Jaro Winkler Untuk Aplikasi Deteksi Plagiarisme Dokumen Teks,” JTRISTE, vol. 4, 2017.
[6] Yulianingsih, “Implementasi Algoritma Jaro-Winkler Dan Levenstein Distance Dalam Pencarian Data Pada Database,” J. String, vol. Vol. 2 No. 1, 2017.
[7] Panji Novantara,Opin Pasruli, “Implementasi Algoritma Jaro-Winkler Distance Untuk Sistem Pendeteksi Plagiarisme Pada Dokumen Skripsi,” J. Buffer Inform., 2018.
[8] Usman Ependi,Yesi Novaria Kunang,Seva Novifika, “Implementasi Metode Rational Unified Process Pada Mobile Digital LibrarY,” J. Ilm. MATRIK, vol. 16, 2015.