Penerapan Algoritma Levenstein Distance Untuk Pencarian Judul Pada Aplikasi Lagu-Lagu Nasional
DOI:
https://doi.org/10.30865/resolusi.v3i4.370Keywords:
String Matching; Search; Song; Levenshtein Distance AlgorithmAbstract
The Levenshtein Distance algorithm is a deletion, insertion and swap operation. Based on the test results that have been carried out, the levenshtein Distance algorithm is able to calculate the edit distance obtained from the matrix used to calculate the number of strings differences between two strings. The calculation of the distance between these two stings is determined from the minimum number of change operations to make string A into sting B. There are 3 main types of operations that can be performed by this algorithm: 1. change characters 2. add characters 3. delete characters This algorithm runs from the corner. top left of a two-dimensional array that has been filled with a number of characters from the initial string and the sting target and given the cost value. The cost value in the lower right corner becomes the edit distance value which represents the difference between the two strings.
Downloads
References
I. B. K. S. Arnawa, “Implementasi Algoritma Levenshtein Pada Sistem Pencarian Judul Skripsi/Tugas Akhir,” Sist. Dan Inform., 2017.
S. A. P. B.P.Pratama, “Analisi kinerja algoritma levenshtein distance dalam medeteksi kemiripan dokumen teks,” Sist. Dan Inform., vol. 6, 2016.
Situmorang, “Pengertian Skripsi,” Sist. dan Inform., vol. 3, 2013.
Gun Gun Maulana, “Pembelajaran Dasar Algoritma Dan Pemrograman Menggunakan EL-Goritma Berbasis Web,” Tek. Mesin, 2017.
R. L. B. Muhammad Bahari Ilmy, Nitia rahmi, “Penerapan Algoritma Levenshtein Distance untuk Mengoreksi Kesalahan Pengejaan Pada Editor Teks.”
M. K. Drs. Lamhot Sitorus, Pengertian Flowchart. 2015.
D. Anika, “Simbol-simbol Flowchart,” Www.It-jurnal.com, 2016.
E. Kusnadi, “Pengertian Unified Modeling Language (UML),” www.mypctutorel.co.id, 2013.
Andre, “Mengenai Personal Home Page (PHP),” Www.duniaikom.com, 2014.
Anisya, “Aplikasi sistem Database Rumah Sakit Terpusat Pada rumah Sakit Umum AISYIYAH,” 2013.
D. N. Sari and D. P. Utomo, “Implementasi Algoritma Rabin-Karp Pada Pencarian Quotes Tokoh Terkenal,” Pelita Inform. Inf. dan Inform., vol. 9, no. 1, pp. 43–55, 2020.
A. A. B. Ginting and D. P. Utomo, “PERANCANGAN APLIKASI CATALOG WISATA DI SUMATERA UTARA MENGGUNAKAN ALGORITMA RABIN-KARP,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 57–63, 2019.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Algoritma Levenstein Distance Untuk Pencarian Judul Pada Aplikasi Lagu-Lagu Nasional
ARTICLE HISTORY
Issue
Section
Copyright (c) 2023 Hyasinta Oktavia Nahampun
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
