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