Results 31 to 40 of about 17,818 (198)
GPU acceleration of Levenshtein distance computation between long strings
Parallel Computing, 2022 Computing edit distance for very long strings has been hampered by quadratic time complexity with respect to string length. The WFA algorithm reduces the time complexity to a quadratic factor with respect to the edit distance between the strings. This work presents a GPU implementation of the WFA algorithm and a new optimization that can halve the ...
openaire +4 more sources
Jurnal Linguistik Komputasional, 2018 This research is to implement and analyze the search of Al-Quran verse from phonetic similarity using Soundex and Damerau Levenshtein Distance algorithm.
Puruhita Ananda Arsaningtyas +2 more
doaj +1 more source
Linear programming bounds for codes in Grassmannian spaces
, 2006 We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound.
Bachoc, Christine
core +4 more sources
International Journal of Population Data Science, 2017 Objectives To assess the match quality of a linkage strategy based on the combined use of a statistical linkage key and the Levenshtein distance to link birth to death records in Brazil.
Luis Carlos Guillen +4 more
doaj +1 more source
An efficient rank based approach for closest string and closest substring. [PDF]
PLoS ONE, 2012 This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings.
Liviu P Dinu, Radu Ionescu
doaj +1 more source
Scientific Journal of Informatics, 2018 Nowadays internet technology provide more convenience for searching information on a daily. Users are allowed to find and publish their resources on the internet using search engine.
Muhamad Maulana Yulianto +2 more
doaj +1 more source
Serial Computations of Levenshtein Distances [PDF]
, 1997 In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving similar but not necessarily exact pattern matches. There are a number of similarity or distance measures, and many of them are special cases or generalizations of the Levenshtein metric. The problem of evaluating the measure of
openaire +1 more source
Autocorrect pada Modul Pencarian Drugs e-Dictionary Menggunakan Algoritma Levenshtein Distance
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2020 The Dictionary of Medicine in the form of a physical book has many drawbacks, one of them is its thickness makes it impractical to be carried. This becomes a motivation to develop drug dictionary applications in the form of a Drugs e-Dictionary.
Halimah Tus Sadiah +2 more
doaj +1 more source
Lexical evolution rates by automated stability measure
, 2009 Phylogenetic trees can be reconstructed from the matrix which contains the distances between all pairs of languages in a family. Recently, we proposed a new method which uses normalized Levenshtein distances among words with same meaning and averages on ...
Bakker D +13 more
core +1 more source
Prediction of Sensor Ability Based on Chemical Formula: Possible Approaches and Pitfalls
Inorganics, 2023 This review presents an analysis of different algorithms for predicting the sensory ability of organic compounds towards metal ions based on their chemical formula.
Daniil N. Yarullin +6 more
doaj +1 more source