Experiments in fuzzy text searching
-
Updated
Jul 6, 2022 - C
Experiments in fuzzy text searching
Calculate the Damerau–Levenshtein distance between strings.
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Calculation of Levenshtein and Damerau Levenshtein distances in C++
ML's radishal Universal Levenshtein Automata library.
Strdiff is a library for calculating string differences. It leverages efficient algorithms such as the Levenshtein distance and the Damerau-Levenshtein distance.
Represent large sets and maps compactly with finite state transducers.
Fuzzy string algorithms for Roblox
React webapp made during an OpenClassrooms bootcamp. "Raw React" project (React libs disallowed).
Just another Damerau Levenshtein distance implementation, made in TypeScript
A parameterizable Damerau Levenshtein aligner in Java.
This repo contains the Python 3 compatible code for SymSpell algorithm
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
strcompare is a library for comparing strings using Hamming, Levenshtein, and Damerau-Levenshtein metrics.
Add a description, image, and links to the damerau-levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the damerau-levenshtein topic, visit your repo's landing page and select "manage topics."