Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal RESOLUSI : REKAYASA TEKNIK INFORMATIKA DAN INFORMASI
Hyasinta Oktavia Nahampun
Universitas Budi Darma, Medan
Computer Science & IT

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Penerapan Algoritma Levenstein Distance Untuk Pencarian Judul Pada Aplikasi Lagu-Lagu Nasional Hyasinta Oktavia Nahampun
Resolusi : Rekayasa Teknik Informatika dan Informasi Vol. 3 No. 4 (2023): RESOLUSI Maret 2023
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/resolusi.v3i4.370

Abstract

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.
Co-Authors