Results 11 to 20 of about 2,255,682 (232)
Levenshtein Distances Fail to Identify Language Relationships Accurately [PDF]
Computational Linguistics, 2011 The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one string into another. This metric has received recent attention as a means of automatically classifying languages into genealogical subgroups.
Simon J Greenhill
exaly +4 more sources
Designing a word recommendation application using the Levenshtein Distance algorithm
Matrix: Jurnal Manajemen Teknologi dan Informatika, 2021 Good scriptwriting or reporting requires a high level of accuracy. The basic problem is that the level of accuracy of the authors is not the same. The low level of accuracy allows for mistyping of words in a sentence.
Nadhia Nurin Syarafina +2 more
doaj +2 more sources
Certified Robustness Under Bounded Levenshtein Distance
International Conference on Learning RepresentationsText classifiers suffer from small perturbations, that if chosen adversarially, can dramatically change the output of the model. Verification methods can provide robustness certificates against such adversarial perturbations, by computing a sound lower ...
Elías Abad-Rocamora +2 more
semanticscholar +3 more sources
A Hybrid Approach to Typo Correction in Indonesian Documents Using Levenshtein Distance
Journal of Technology Informatics and EngineeringThis study developed a typo correction system for the Indonesian language by integrating the Levenshtein Distance algorithm with empirical methods. The system is designed to improve the accuracy of typo detection and correction in Indonesian texts, which
Joseph Teguh Santoso, Song Yan
doaj +2 more sources
Spheres of Strings Under the Levenshtein Distance
AxiomsLet Σ be a nonempty set of characters, called an alphabet. The run-length encoding (RLE) algorithm processes any nonempty string u over Σ and produces two outputs: a k-tuple (b1,b2,…,bk), where each bi is a character and bi+1≠bi; and a corresponding k ...
Said Algarni, Othman Echi
doaj +2 more sources
Identifying document similarity using a fast estimation of the Levenshtein Distance based on compression and signatures [PDF]
arXiv.org, 2023 Identifying document similarity has many applications, e.g., source code analysis or plagiarism detection. However, identifying similarities is not trivial and can be time complex.
P. Coates, F. Breitinger
semanticscholar +1 more source
Levenshtein Distance Embedding with Poisson Regression for DNA Storage [PDF]
AAAI Conference on Artificial Intelligence, 2023 Efficient computation or approximation of Levenshtein distance, a widely-used metric for evaluating sequence similarity, has attracted significant attention with the emergence of DNA storage and other biological applications.
Xiang Wei +4 more
semanticscholar +1 more source
Adapting Off-the-Shelf Speech Recognition Systems for Novel Words
Information, 2023 Current speech recognition systems with fixed vocabularies have difficulties recognizing Out-of-Vocabulary words (OOVs) such as proper nouns and new words. This leads to misunderstandings or even failures in dialog systems.
Wiam Fadel +3 more
doaj +1 more source
A New String Edit Distance and Applications
Algorithms, 2022 String edit distances have been used for decades in applications ranging from spelling correction and web search suggestions to DNA analysis. Most string edit distances are variations of the Levenshtein distance and consider only single-character edits ...
Taylor Petty +3 more
doaj +1 more source