levenstein string distance
-
Updated
Feb 18, 2021 - Go
levenstein string distance
A small Julia library for calculating the normalized compression distance.
compute the Levenshtein distance between two strings in Go
Python wrapper for Rust's strsim library
Deduplicate data using fuzzy and deterministic matching rules.
Algorithm for the derivation of the top-K string alignments, based on the Levenshtein distance.
program that prints the longest substring in which the letters occur in alphabetical order
A Mata-based Stata command to calculate Levenshtein edit distance.
Common string similarity algorithm implementations.
Detects similarities between strings & generates similarity hash
This repository is a mirror. Do not post issues or PRs here.
Android library for string matching based on the JavaWuzzy Python algorithm. The algorithm uses Levenshtein distance to calculate similarity between strings.
Get the degree of resemblance between two strings
Levenshtein distance based string suggestion lib
A go-kit based microservice for the Levenshtein distance algorithm
Declaratively define rules for string equivalence so you can focus on the differences that matter.
Add a description, image, and links to the string-distance topic page so that developers can more easily learn about it.
To associate your repository with the string-distance topic, visit your repo's landing page and select "manage topics."