73 Open source projects that are alternatives of or similar to Levenshtein

A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..

Levenshtein algorithm in C

Golang metrics for calculating string similarity and other string utility functions

string similarity based on Dice's coefficient in go

No description or website provided.

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Learned string similarity for entity names using optimal transport.

Fast approximate strings search & spelling correction

SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell

Beda is a golang library for detecting how similar a two string

A BK tree implementation for fast fuzzy string matching

Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

Go implementation to calculate Levenshtein Distance.

Fuzzy string matching for PHP

The fastest .Net Levenshtein around

Abydos NLP/IR library for Python

Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.

🔀 Extension method for StringComparison that adds support for natural sorting (e.g. "abc1", "abc2", "abc10" instead of "abc1", "abc10", "abc2").

Ruby gem (native extension in Rust) providing implementations of various string metrics

SymSpellCompound: compound aware automatic spelling correction

Rust implementation of sequence alignment / Levenshtein distance by A* acceleration of the DP algorithm

Damerau - Levenstein distance function for node

🎯 String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein).

一些常用的java sdk和工具类（日期工具类，分布式锁，redis缓存，二叉树，反射工具类，线程池，对称/非对称/分段加解密，json序列化，http工具，雪花算法，字符串相似度，集合操作工具，xml解析，重试Retry工具类，Jvm监控等）

Provides a string manipulation node with a chainable UI based on the concise and lightweight stringjs.com.

PFAC is an open library for exact string matching performed on NVIDIA GPUs

Golang library for fuzzy matching within a set of strings 📃

Way to check, match and resist.

Finite state dictionaries in Java

🎐 a python library for doing approximate and phonetic matching of strings.

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment

Golang string comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

Python library for computing edit distance between arbitrary Python sequences.

iOS validation framework with form validation support

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

Levenshtein edit distance

Bot for checking reposts on reddit

Rapid fuzzy string matching in Python using the Levenshtein Distance

📐 A Cython implementation of the affine gap string distance

Python port of SymSpell

Levenshtein algorithm in Rust

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

SIMDized check which bytes are in a set

Give me a word and I’ll give you an array of words that differ by a single letter.

A curated list of papers dedicated to edit-distance as objective function

Suggest hubot commands when not found

String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...

String similarity metrics for Elixir

A collection of algorithms in rust

Minimal, super readable string pattern matching for python.

Similar string search in Levenshtein distance

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

Calculate similarity of sentences & Cluster the result.

set of functions and operators for executing similarity queries

Text2Text: Cross-lingual natural language processing and generation toolkit

Python Modules of Variable Markov Oracle

Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.

Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm