compute the Levenshtein distance between two strings in Go
-
Updated
Nov 29, 2022 - Go
compute the Levenshtein distance between two strings in Go
program that prints the longest substring in which the letters occur in alphabetical order
A Mata-based Stata command to calculate Levenshtein edit distance.
Implementations of common string similarity algorithms.
Get the degree of resemblance between two strings
Levenshtein distance based string suggestion lib
Example programs for the JavaPermutationTools (JPT) library
Created a search engine with functionalities such as counting the frequency of words using Boyer Moore, Brute Force Algorithm, Web Page Ranking using Quicksort Algorithm, spell checking and suggestion using Edit Distance algorithm and Java, HTML to TEXT converter using Jsoup converter
C# version of calculating the Damerau Levenshtein Distance. Code is based on the Wikipedia article.
🐍 Python implementations of common string distance and similarity algorithms
levenstein string distance
Python wrapper for Rust's strsim library
A C library of miscellaneous utility functions
A go-kit based microservice for the Levenshtein distance algorithm
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
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."