A C library for calculating Levenshtein distance
-
Updated
Feb 4, 2023 - C
A C library for calculating Levenshtein distance
The Levenshtein Nim module contains functions for fast computation of Levenshtein distance and string similarity
An implementation of String Searching Algorithm in C
Analyze string similarity using Levenshtein's distance.
New spell(1) implementation for NetBSD
Comparaison des graphes de cycles des molécules par calcul de la similarité par MCIS et par distance de Levenshtein
Simple, fast Levenshtein distance and similarity ratio for Ruby
Levenshtein distance function as C Extension for Python 3
Spell checker in C based on bk-tree and levenshtein distance
Generalized edit distance command line tool
Projet IN301 - Comparaisons de séquences ADN
String comparison and string search optimisation repertoire, written in C++, Python3 and Typescript
in-memory key value server (based on radix-tree) with fuzzy search capabilities
Possibly the fastest way of computing the Levenshtein distance between two fairly short ASCII strings in Python…
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
nxsearch: a full-text search engine
Implementation of Levenstein distance in C with comparison between several languages.
INF103 Dönem Sonu Projesi
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."