33 best open source levenshtein projects.

We have collection of more than 1 Million open source products ranging from Enterprise product to small libraries in all platforms. We aggregate information from all open source repositories. Search and find the best for your needs. Check out projects section.

Displaying 1 to 20 from 33 results

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

Python

Jellyfish is a python library for doing approximate and phonetic matching of strings. Written by James Turk <james.p.turk@gmail.com> and Michael Stephens.

levenshtein soundex hamming metaphone jaro-winkler fuzzy-search

natural - general natural language facilities for node

Javascript

"Natural" is a general natural language facility for nodejs. Tokenizing, stemming, classification, phonetics, tf-idf, WordNet, string similarity, and some inflections are currently supported.

natural language porter lancaster stemmer bayes classifier phonetic metaphone inflector wordnet tf-idf logistic regression doublemetaphone double jaro-winkler levenshtein distance tagger

SymSpell - 1 million times faster through Symmetric Delete spelling correction algorithm

CSharp

Spelling correction & Fuzzy search: 1 million times faster through Symmetric Delete spelling correction algorithm The Symmetric Delete spelling correction algorithm reduces the complexity of edit candidate generation and dictionary lookup for a given Damerau-Levenshtein distance. It is six orders of magnitude faster (than the standard approach with deletes + transposes + replaces + inserts) and language independent.

levenshtein fuzzy-search approximate-string-matching edit-distance spellcheck spell-check levenshtein-distance damerau-levenshtein spelling fuzzy-matching word-segmentation chinese-text-segmentation chinese-word-segmentation text-segmentation spelling-correction symspell

talisman - A straightforward & modular NLP, machine learning & fuzzy matching library for JavaScript

Javascript

The library's full documentation can be found here. Be sure to lint & pass the unit tests before submitting your pull request.

natural-language-processing machine-learning fuzzy-matching clustering record-linkage bayes bloom-filter canberra caverphone chebyshev cologne cosine classifier daitch-mokotoff dice fingerprint fuzzy hamming k-means jaccard jaro lancaster levenshtein lig metaphone mra ngrams nlp nysiis perceptron phonetic porter punkt schinke sorensen soundex stats tfidf tokenizer tversky vectorizer winkler

Blind Shark

DotNet

Blind Shark is a musical game, where you have to find the music being played before your opponents.

game fmod fun levenshtein

open gaze and mouse analyzer

Ogama allows recording and analyzing eye- and mouse-tracking data from slideshow eyetracking experiments in parallel. It´s developed in C#.NET and provides attention maps, AOIS, saliency, replay, levensthein distances and many more visualization tools.

areas-of-interest eyetracking gaze gazetracking itu-gazetracker levenshtein mouse

leven - Measure the difference between two strings with the fastest JS implementation of the Levenshtein distance algorithm

Javascript

Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm

leven levenshtein distance algorithm algo string difference diff fast fuzzy similar similarity compare comparison edit text match matching

fast-levenshtein - Efficient Javascript implementation of Levenshtein algorithm with locale-specific collator support

Javascript

An efficient Javascript implementation of the Levenshtein algorithm with locale-specific collator support. If you are not using any module loader system then the API will then be accessible via the window.Levenshtein object.

levenshtein distance string

closestmatch - Golang library for fuzzy matching within a set of strings :page_with_curl:

closestmatch is a simple and fast Go library for fuzzy matching an input string to a list of target strings. closestmatch is useful for handling input from a user where the input (which could be mispelled or out of order) needs to match a key in a database. closestmatch uses a bag-of-words approach to precompute character n-grams to represent each possible target string. The closest matches have highest overlap between the sets of n-grams. The precomputation scales well and is much faster and more accurate than Levenshtein for long strings.closestmatch is more accurate than Levenshtein for long strings (like in the test corpus).

levenshtein fuzzy-matching string-matching golang-library

levenshtein - This is the Go implementation to calculate Levenshtein Distance.

The library is fully capable of working with non-ascii strings. But the strings are not normalized. That is left as a user-dependant use case. Please normalize the strings before passing it to the library if you have such a requirement.Words selected are - "levenshtein" and "frankenstein".

levenshtein levenshtein-distance data-structure collections go-collection

dictomaton - Finite state dictionaries in Java

Java

Finite state dictionaries and perfect hash automata.

finite state dictionary levenshtein compact collections

levenshtein.c - Levenshtein algorithm in C

Vladimir Levenshtein’s edit distance algorithm1 as a C library. There’s also a CLI: levenshtein(1), and a JavaScript version.Or clone the repo.

levenshtein fuzzy-search edit-distance fuzzy-matching string-matching similarity levenshtein-distance vladimir algorithm edit distance

tpyo - A small script that enables you to make typos in JavaScript property names

Javascript

Ever wanted to use Math.SQUIRTLE instead of Math.SQRT2? Think Function.prototype.apple looks shinier than apply? Or do you prefer Array.prototype.faReech over forEach? Look no further — tpyo’s got your back.tpyo (pronounced ‘typo’) is the result of combining the power of ES6 proxies with Levenshtein string distance. It’s a small script that enables you to make typos in JavaScript property names.

es6 proxy proxies levenshtein levenshtein-distance string property property-names properties typo typos

leven-cli - Measure the difference between two strings using the Levenshtein distance algorithm

Javascript

Measure the difference between two strings using the Levenshtein distance algorithm

cli-app cli leven levenshtein distance algorithm algo string difference diff fast fuzzy similar similarity compare comparison edit text match matching

ukkonen - Ukkonen's Approximate String Matching algorithm

Javascript

This project implements the Approximate String Matching algorithm by Esko Ukkonen extended with ideas from An Extension of Ukkonen's Enhanced Dynamic Programming ASM Algorith by Hal Berghel and David Roach. Ukkonen's algorithm is very competitive with the Levenshtein distance and for longer strings it is much more performant than Levenshtein distance.

ukkonen hal berghel aproximate string match asm ehd levenshtein

majinbuu - Morph an array into another via Levenshtein distance

HTML

Apply the Levenshtein distance to transform / morph an Array into another, performing the least amount of needed .splice(...) operations. It is also possible to intercept all splice calls using an aura, which augments the splice method of the list, delegating the interceptor one.

morph mutate transform array levenshtein

fuzzy-match-utils - A collection of string matching algorithms designed with React Select in mind.

Javascript

A collection of string matching algorithms built with React Select in mind. They're well documented in main.js.

distance filter fuzzy jaro-winkler levenshtein match options proximity search similar similarity string subsequence substitutions text typeahead variations

levenshtein-rs - Levenshtein algorithm in Rust

Rust

Vladimir Levenshtein’s edit distance algorithm as a Rust library. There’s also a C library, C user command, and JavaScript module. Given two strings, returns the edit distance between them.

levenshtein

clj-fuzzy - A handy collection of algorithms dealing with fuzzy strings and phonetics.

Clojure

clj-fuzzy is a native Clojure library providing a collection of famous algorithms dealing with fuzzy strings and phonetics. It can be used in Clojure, ClojureScript, client-side JavaScript and Node.js.