Damerau levenshtain distance - Open Access .click

Results 1 to 10 of about 24 (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 +3 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

2022
Shuche Wang, Van Khu Vu, Vincent Y F Tan +2 more
exaly

A Comparison Between SymSpell and a Combination of Damerau-Levenshtein Distance with the Trie Data Structure

2023
Ika Alfina
exaly

Codes in the Damerau Distance for Deletion and Adjacent Transposition Correction

IEEE Transactions on Information Theory, 2018
Ryan Gabrys, Eitan Yaakobi, Olgica Milenkovic +2 more
exaly

Dictionary Distribution Based on Number of Characters for Damerau-Levenshtein Distance Spell Checker Optimization

2020
Utomo Pujianto
exaly

Linear space string correction algorithm using the Damerau-Levenshtein distance

BMC Bioinformatics, 2020
Chunchun Zhao, Sartaj Sahni
exaly

Methodology for Analyzing Bitstreams Based on the Use of the Damerau–Levenshtein Distance and Other Metrics