fast fuzzy string matching for Python
-
Updated
May 3, 2022 - Rust
fast fuzzy string matching for Python
Collection of string metric algorithms in OCaml
Utilizes single-row version of Levenshtein Edit Distance to spell check.
A string metric that measures proximity between 2 words. The metric calculation is a formula that utilizes 3 existing String metric algorithms: Jaccard Distance, Edit Distance and Longest Common Substring Distance.
🐍 Python implementations of common string distance and similarity algorithms
This repository contains Ruby implementation of various algorithms.
String metrics and phonetic algorithms for Crystal
Fast string metric algorithms written in go
Go implementation of Simon White's String Similarity Algorithm
this is a module that you can use to manipulate strings
6809 assembly language routine to find the length of a C-style string (with test suite in Disk Extended Color BASIC and 6809 assembly) (Version 1.7, released 30 March 2019)
Calculate various string metrics efficiently in Common Lisp (Damerau-Levenshtein, Hamming, Jaro, Jaro-Winkler, Levenshtein, etc.)
Calculate various string metrics efficiently in Haskell
Ruby gem (native extension in Rust) providing implementations of various string metrics
String metric/similarity functions implemented in Swift.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). This library support multiple .NET versions including .NET Core (NETStandard 1.x)
Abydos NLP/IR library for Python
String metrics library written in Go.
Add a description, image, and links to the string-metrics topic page so that developers can more easily learn about it.
To associate your repository with the string-metrics topic, visit your repo's landing page and select "manage topics."