Results 1 to 10 of about 1,609,509 (142)

String correction using the Damerau-Levenshtein distance [PDF]

BMC Bioinformatics, 2019
Background In the string correction problem, we are to transform one string into another using a set of prescribed edit operations. In string correction using the Damerau-Levenshtein (DL) distance, the permissible edit operations are: substitution ...
Chunchun Zhao, Sartaj Sahni
doaj   +25 more sources

Linear space string correction algorithm using the Damerau-Levenshtein distance [PDF]

BMC Bioinformatics, 2020
Background The Damerau-Levenshtein (DL) distance metric has been widely used in the biological science. It tries to identify the similar region of DNA,RNA and protein sequences by transforming one sequence to the another using the substitution, insertion,
Chunchun Zhao, Sartaj Sahni
doaj   +8 more sources

Kombinasi Damerau Levenshtein dan Jaro-Winkler Distance Untuk Koreksi Kata Bahasa Inggris [PDF]

JuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2020
Writing is one of the efforts made by the writer to express ideas and ideas to others. But sometimes when writing, there are many errors in typing spelling, especially English spelling, resulting in errors in capturing the meaning and meaning of the ...
Bonifacius Vicky Indriyono
doaj   +9 more sources

Spelling Correction Application with Damerau-Levenshtein Distance to Help Teachers Examine Typographical Error in Exam Test Scripts [PDF]

E3S Web of Conferences, 2020
This research was intended to create Spelling Correction Application to help teachers examine questions scripts with the capability to found typographical error and give suggestion for non-real word error.
Christanti Mawardi Viny, Augusfian Fendy, Pragantha Jeanny, Bressan Stéphane   +3 more
doaj   +6 more sources

U-Tapis: A Hybrid Approach to Melting Word Error Detection and Correction with Damerau-Levenshtein Distance and RoBERTa

Engineering Proceedings
In the current digital era, the demand for rapid news delivery increases the risk of linguistic errors, including inaccuracies in the usage of melting words. This research introduces the U-Tapis application, a platform designed to detect and correct such
Prudence Tendy, Marlinda Vasty Overbeek
doaj   +5 more sources

Improving Computational Efficiency and Accuracy of Damerau-Levenshtein Distance for Indonesian Spelling Correction using Cosine Similarity [PDF]

Journal of Innovation Information Technology and Application
Spelling correction is an automatic correction feature useful in detecting spelling errors and providing word suggestions if necessary. Spelling correction is one of the crucial preprocessing phases in text mining. The Damerau-Levenshtein Distance method
husni husni, Yoga Dwitya Pramudita, Mohammad Syarief, Army Justitia, Ika Oktavia Suzanti   +4 more
doaj   +3 more sources

Analisis Penerapan Algoritma Damerau Levenshtein Distance dengan Ekpansi Sinonim pada Platform PUSDATA [PDF]

Techno.Com
Pencarian data pada platform PUSDATA masih terkendala kesalahan pengetikan (typo) dan perbedaan istilah yang digunakan pengguna. Hal ini menyebabkan pencarian gagal menemukan data yang relevan jika terjadi kesalahan kecil dalam penulisan kata kunci ...
Taslim Taslim, Nuralamsah Zulkarnaim, Wawan Firgiawan   +2 more
doaj   +3 more sources

Linking Biomedical Data Warehouse Records With the National Mortality Database in France: Large-scale Matching Algorithm [PDF]

JMIR Medical Informatics, 2022
BackgroundOften missing from or uncertain in a biomedical data warehouse (BDW), vital status after discharge is central to the value of a BDW in medical research.
Vianney Guardiolle, Adrien Bazoge, Emmanuel Morin, Béatrice Daille, Delphine Toublant, Guillaume Bouzillé, Youenn Merel, Morgane Pierre-Jean, Alexandre Filiot, Marc Cuggia, Matthieu Wargny, Antoine Lamer, Pierre-Antoine Gourraud   +12 more
doaj   +2 more sources

How similar are species names and why does this matter for biodiversity data [PDF]

Biodiversity Data Journal
Standardising taxonomic names is an essential step in biodiversity studies to ensure robust data aggregation under the most recent accepted species nomenclature.
André Menegotto, Cristina Ronquillo, Joaquín Hortal, Thomas Webb   +3 more
doaj   +4 more sources

Faster Algorithm for Bounded Damerau–Levenshtein Distance

Lecture Notes in Computer Science
Abstract The Damerau–Levenshtein distance between two strings is the minimum number of insertions, deletions, substitutions, and adjacent transpositions required to transform one string into the other. Unlike the standard Levenshtein distance, it accounts for the common typing error of adjacent character swaps. When edits are restricted
Tetsuo Shibuya
exaly   +2 more sources