46 Open source projects that are alternatives of or similar to levenshtein_finder

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

Golang metrics for calculating string similarity and other string utility functions

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

set of functions and operators for executing similarity queries

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

🔤 Rust implementations of string similarity metrics

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

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

Go implementation to calculate Levenshtein Distance.

Finite state dictionaries in Java

The fastest .Net Levenshtein around

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

Abydos NLP/IR library for Python

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

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

Python library for computing edit distance between arbitrary Python sequences.

SymSpellCompound: compound aware automatic spelling correction

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

Damerau - Levenstein distance function for node

Rapid fuzzy string matching in Python using the Levenshtein Distance

🎯 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).

Python port of SymSpell

Golang library for fuzzy matching within a set of strings 📃

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

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

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

Bot for checking reposts on reddit

Suggest hubot commands when not found

String similarity metrics for Elixir

The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

Levenshtein algorithm in Rust

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

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

Fast approximate strings search & spelling correction

SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell

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..

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

No description or website provided.

Levenshtein edit distance

Levenshtein algorithm in C

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

Learned string similarity for entity names using optimal transport.

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

Collection of sequence alignment algorithms.

Fuzzy string matching for PHP

📐 A Cython implementation of the affine gap string distance