Results 1 to 10 of about 23 (22)
Damerau Levenshtain Distance dengan Metode Empiris untuk Koreksi Ejaan Bahasa Indonesia [PDF]
Ilkom Jurnal Ilmiah, 2020 Damerau Levenshtein Distance (DLD) adalah algoritma untuk koreksi kesalahan penulisan. Kesalahan terjadi karena penyisipan, penghapusan, pertukaran, dan penggantian alfabet dalam sebuah kata. Ini mungkin terjadi karena hilangnya spasi di antara dua kata.
Aji Prasetya Wibawa +4 more
doaj +2 more sources
Damerau Levenshtein Distance for Indonesian Spelling Correction
Jurnal Informatika, 2019 Word correction used to find an incorrect word in writing. Levenshtein distance is one of algorithm to correcting typing error. It is an algorithm that calculates a difference between two strings.
Puji Santoso +3 more
doaj +1 more source
Some of the next articles are maybe not open access.
Codes for the Asymmetric Damerau–Levenshtein Distance
2022Van Khu Vu, Vincent Tan, Shuche Wang
exaly
Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction
IEEE Transactions on Information Theory, 2018Olgica Milenkovic +2 more
exaly
Spelling Correction Using Encoder-Decoder and Damerau-Levenshtein Distance
2023N Arivazhagan, A Revathi
exaly
Linear space string correction algorithm using the Damerau-Levenshtein distance
BMC Bioinformatics, 2020Chunchun Zhao, Sartaj Sahni
exaly
String correction using the Damerau-Levenshtein distance
BMC Bioinformatics, 2019Chunchun Zhao, Sartaj Sahni
exaly