Implementation of Levenstein distance in C with comparison between several languages.
-
Updated
Jul 17, 2017 - C
Implementation of Levenstein distance in C with comparison between several languages.
Analyze string similarity using Levenshtein's distance.
New spell(1) implementation for NetBSD
An implementation of String Searching Algorithm in C
Generalized edit distance command line tool
The Levenshtein Nim module contains functions for fast computation of Levenshtein distance and string similarity
in-memory key value server (based on radix-tree) with fuzzy search capabilities
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
Projet IN301 - Comparaisons de séquences ADN
INF103 Dönem Sonu Projesi
Levenshtein algorithm in C
Spell checker in C based on bk-tree and levenshtein distance
A C library for calculating Levenshtein distance
Possibly the fastest way of computing the Levenshtein distance between two fairly short ASCII strings in Python…
nxsearch: a full-text search engine
Simple, fast Levenshtein distance and similarity ratio for Ruby
Comparaison des graphes de cycles des molécules par calcul de la similarité par MCIS et par distance de Levenshtein
String comparison and string search optimisation repertoire, written in C++, Python3 and Typescript
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."