Results 11 to 20 of about 1,709,754 (204)
Damerau Levenshtein Distance for Indonesian Spelling Correction [PDF]
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 +2 more sources
Levenshtein Distance Embedding with Poisson Regression for DNA Storage [PDF]
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. Sequence embedding, which maps Levenshtein distance to a conventional distance between embedding vectors, has emerged as a ...
Xiang Wei +4 more
openaire +4 more sources
Spheres of Strings Under the Levenshtein Distance
Let Σ 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
Voice Control in Calorie Tracker Application using Levenshtein Distance Algorithm [PDF]
Each food consumed by people contains a number of calories needed by the body to perform an activity. Calories can be described as fuel of engine to move and carry out tasks.
Daniel Halim, Seng Hansun
doaj +2 more sources
Computing Hamming Distance and Levenshtein Distance Using ReLU Neural Networks
Measuring the similarity or difference of two strings is a fundamental task in computer science and engineering. Among the various measures, Hamming distance and Levenshtein distance have been widely utilized.
Masahiro Ohtomo +2 more
doaj +3 more sources
Certified Robustness Under Bounded Levenshtein Distance
Text 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 bound on the robust accuracy.
Elías Abad-Rocamora +2 more
openaire +4 more sources
One-Gapped q-Gram Filters for Levenshtein Distance [PDF]
We have recently shown that q- gram filters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming distance. In this paper, we extend the results for the Levenshtein distance, which is more problematic for gapped q-grams because an insertion or deletion in a
Burkhardt, S., Kärkkäinen, J.
openaire +4 more sources
Using adapted Levenshtein distance for on-line signature authentication
In this paper a new method for on-line signature authentication will be presented, which is based on a event-string modelling of features derived from pen-position and pressure signals of digitizer tablets.
Sascha Schimke +2 more
openaire +2 more sources
Surprises in approximating Levenshtein distances [PDF]
The Levenshtein distance is an important tool for the comparison of symbolic sequences, with many appearances in genome research, linguistics and other areas. For efficient applications, an approximation by a distance of smaller computational complexity is highly desirable.
Baake, Michael +2 more
openaire +3 more sources
Scientific reference style using rule-based machine learning
Regular Expressions (RegEx) can be employed as a technique for supervised learning to define and search for specific patterns inside text. This work devised a method that utilizes regular expressions to convert the reference style of academic papers into
Afrida Helen +2 more
doaj +1 more source

