All Projects → maxbachmann → Levenshtein

maxbachmann / Levenshtein

Licence: GPL-2.0 license
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

Programming Languages

C++
36643 projects - #6 most used programming language
python
139335 projects - #7 most used programming language
cython
566 projects
CMake
9771 projects
Batchfile
5799 projects
Makefile
30231 projects
shell
77523 projects

Projects that are alternatives of or similar to Levenshtein

levenshtein.c
Levenshtein algorithm in C
Stars: ✭ 77 (+102.63%)
Mutual labels:  levenshtein, levenshtein-distance, string-matching
strsim
string similarity based on Dice's coefficient in go
Stars: ✭ 39 (+2.63%)
Mutual labels:  string-matching, string-similarity, string-comparison
stringdistance
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..
Stars: ✭ 60 (+57.89%)
Mutual labels:  levenshtein, levenshtein-distance, string-similarity
strutil
Golang metrics for calculating string similarity and other string utility functions
Stars: ✭ 114 (+200%)
Mutual labels:  levenshtein, string-matching, string-similarity
eddie
No description or website provided.
Stars: ✭ 18 (-52.63%)
Mutual labels:  levenshtein, string-similarity
LinSpell
Fast approximate strings search & spelling correction
Stars: ✭ 52 (+36.84%)
Mutual labels:  levenshtein, levenshtein-distance
spellchecker-wasm
SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
Stars: ✭ 46 (+21.05%)
Mutual labels:  levenshtein, levenshtein-distance
beda
Beda is a golang library for detecting how similar a two string
Stars: ✭ 34 (-10.53%)
Mutual labels:  string-matching, string-similarity
String Similarity
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Stars: ✭ 2,254 (+5831.58%)
Mutual labels:  string-similarity, string-comparison
stance
Learned string similarity for entity names using optimal transport.
Stars: ✭ 27 (-28.95%)
Mutual labels:  string-matching, string-similarity
Symspell
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Stars: ✭ 1,976 (+5100%)
Mutual labels:  levenshtein, levenshtein-distance
Textdistance
Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Stars: ✭ 2,575 (+6676.32%)
Mutual labels:  levenshtein, levenshtein-distance
FastFuzzyStringMatcherDotNet
A BK tree implementation for fast fuzzy string matching
Stars: ✭ 23 (-39.47%)
Mutual labels:  levenshtein-distance, string-matching
Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Stars: ✭ 204 (+436.84%)
Mutual labels:  levenshtein, levenshtein-distance
vbml
Way to check, match and resist.
Stars: ✭ 27 (-28.95%)
Mutual labels:  string-matching
fuzzywuzzy
Fuzzy string matching for PHP
Stars: ✭ 60 (+57.89%)
Mutual labels:  string-matching
edits.cr
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
Stars: ✭ 16 (-57.89%)
Mutual labels:  levenshtein
NaturalSort.Extension
🔀 Extension method for StringComparison that adds support for natural sorting (e.g. "abc1", "abc2", "abc10" instead of "abc1", "abc10", "abc2").
Stars: ✭ 94 (+147.37%)
Mutual labels:  string-comparison
ATGValidator
iOS validation framework with form validation support
Stars: ✭ 51 (+34.21%)
Mutual labels:  string-matching
seqalign pathing
Rust implementation of sequence alignment / Levenshtein distance by A* acceleration of the DP algorithm
Stars: ✭ 17 (-55.26%)
Mutual labels:  levenshtein-distance

Levenshtein

Continous Integration PyPI package version Python versions Documentation GitHub license

Introduction

The Levenshtein Python C extension module contains functions for fast computation of:

  • Levenshtein (edit) distance, and edit operations
  • string similarity
  • approximate median strings, and generally string averaging
  • string sequence and set similarity

This is a fork of ztane/python-Levenshtein, since the original project is no longer actively maintained.

Requirements

  • Python 3.6 or later

Installation

pip install levenshtein

Documentation

The documentation for the current version can be found at https://maxbachmann.github.io/Levenshtein/

Support the project

If you are using Levenshtein for your work and feel like giving a bit of your own benefit back to support the project, consider sending us money through GitHub Sponsors or PayPal that we can use to buy us free time for the maintenance of this great library, to fix bugs in the software, review and integrate code contributions, to improve its features and documentation, or to just take a deep breath and have a cup of tea every once in a while. Thank you for your support.

Support the project through GitHub Sponsors or via PayPal:

.

License

Levenshtein is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.

See the file COPYING for the full text of GNU General Public License version 2.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].