Damerau - Levenstein distance function for node
-
Updated
Jul 19, 2024 - JavaScript
#
damerau
Here are 9 public repositories matching this topic...
Library of tools for fuzzy matching.
-
Updated
Jun 25, 2020 - C#
This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein
-
Updated
Jul 21, 2023 - Go
Represent large sets and maps compactly with finite state transducers.
-
Updated
May 19, 2021 - Rust
Calculate the Damerau–Levenshtein distance between strings.
-
Updated
Feb 1, 2021 - TypeScript
Experiments in fuzzy text searching
-
Updated
Jul 6, 2022 - C
A Damerau Levenshtein Implementation in Kotlin
-
Updated
Nov 25, 2017 - Kotlin
Damerau–Levenshtein distance is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one …
cplusplus
levenshtein
transposition
substitutions
damerau
string-metric
adjacent-characters
damerau-levenshtein-distance
insertions
-
Updated
Jul 13, 2019 - C++
Improve this page
Add a description, image, and links to the damerau topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the damerau topic, visit your repo's landing page and select "manage topics."