-
Updated
Jul 9, 2020 - C#
#
edit-distance
Here are 109 public repositories matching this topic...
SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
spellcheck
fuzzy-search
fuzzy-matching
edit-distance
levenshtein
levenshtein-distance
spelling
spell-check
chinese-text-segmentation
word-segmentation
approximate-string-matching
spelling-correction
damerau-levenshtein
text-segmentation
chinese-word-segmentation
symspell
Python port of SymSpell
python
spellcheck
fuzzy-search
fuzzy-matching
edit-distance
levenshtein
levenshtein-distance
spelling
spell-check
chinese-text-segmentation
word-segmentation
approximate-string-matching
spelling-correction
damerau-levenshtein
text-segmentation
chinese-word-segmentation
symspell
-
Updated
Apr 28, 2020 - Python
Swift μ-framework for efficient array diffs and datasource adapters.
swift
ios
buffer
tableview
edit-distance
levenshtein-distance
swift-3
kvo
diffing
datasource
iglistkit
keypath
-
Updated
Oct 7, 2019 - Swift
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
-
Updated
Aug 2, 2020 - JavaScript
-
Updated
May 13, 2020 - Rust
Study group for algorithms in Ruby, hosted at App Academy
algorithm
compression
a-frame
strings
bloom-filter
bit-manipulation
computation
hash-map
edit-distance
lempel-ziv
huffman-coding
-
Updated
Jan 19, 2016 - Ruby
SymSpellCompound: compound aware automatic spelling correction
spellcheck
fuzzy-search
edit-distance
levenshtein
levenshtein-distance
compounds
compound
spelling
spell-check
approximate-string-matching
spelling-correction
damerau-levenshtein
-
Updated
Feb 13, 2018
Levenshtein algorithm in C
fuzzy-search
fuzzy-matching
similarity
edit-distance
levenshtein
levenshtein-distance
string-matching
-
Updated
Jul 11, 2020 - C
Python library for computing edit distance between arbitrary Python sequences.
-
Updated
Aug 23, 2020 - Python
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
-
Updated
Aug 24, 2020 - JavaScript
AStarix: Fast and Optimal Sequence-to-Graph Aligner
-
Updated
Feb 10, 2020 - C++
Various utilities regarding Levenshtein transducers. (Java)
computer-science
search-engine
data-science
machine-learning
natural-language-processing
information-retrieval
bioinformatics
genomics
dictionary
fuzzy-search
computational-biology
edit-distance
levenshtein-distance
approximate-string-matching
distance-metric
finite-state-automata
finite-state-transducer
levenshtein-automata
spelling-correction
universal-automata
-
Updated
Apr 6, 2018 - Java
Levenshtein edit-distance on PyTorch and CUDA
-
Updated
Nov 25, 2019 - Cuda
Fast approximate strings search & spelling correction
spellcheck
fuzzy-search
edit-distance
levenshtein
levenshtein-distance
spelling
spell-check
approximate-string-matching
spelling-correction
damerau-levenshtein
-
Updated
Apr 26, 2018 - C#
A curated list of papers dedicated to edit-distance as objective function
-
Updated
Aug 22, 2020
Sørensen–Dice coefficient
-
Updated
Aug 24, 2020 - JavaScript
A BK tree implementation for fast fuzzy string matching
-
Updated
Jul 24, 2018 - C#
Instant auto suggestion and completion
-
Updated
Jul 1, 2020 - Java
-
Updated
May 9, 2020 - Python
Implementation of the Optimal Completion Distillation for Sequence Labeling
-
Updated
Jul 15, 2019 - Python
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
-
Updated
Jun 7, 2020 - Crystal
-
Updated
Jan 19, 2020 - Rust
Julia and Python recursion algorithm and dynamic programming applications including Edit Distance, Knapsack, Stock Trading, Sierpiński Carpet, Pascal Triangle, Prime Factorization, Palindrome, Coin Change, Hanoi Tower, Fibonacci
memoization
julia-language
recursion
edit-distance
levenshtein-distance
palindrome
sierpinski-triangle
dynamic-programming
recursive-algorithm
factorization
tabulation
fibonacci-numbers
knapsack-problem
fractals
pascal-triangle
knapsack
hanoi-towers
learning-julia
julia-training
julia-learning
-
Updated
Jul 29, 2020 - Julia
An efficient data structure for fast string similarity searches
python
trie
fuzzy-matching
edit-distance
levenshtein-distance
spell-check
prefix-tree
spelling-correction
damerau-levenshtein-distance
-
Updated
Jan 14, 2020 - Python
1
Entomy
commented
Aug 17, 2020
Glyph is yet-another-character-type and should be supported in the majority of situations where Char and Rune are also supported. This means achieving near 100% parity for the functions.
That being said there are certain situations where a function reasonably expects a specific type and parity should not be implemented.
1
Library of tools for fuzzy matching.
-
Updated
Jun 25, 2020 - C#
-
Updated
Nov 24, 2016 - JavaScript
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
-
Updated
Apr 3, 2020 - Go
Improve this page
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."


You can get aligner to work on windows command line by inserting the following lines into aligner.ccp
after line 8: #include <queue>
#ifdef _WIN32
#include "getopt.h"
#endif
#include "edlib.h"
Then adding getopt.h file. The one I used is here: https://raw.githubusercontent.com/skandhurkat/Getopt-for-Visual-Studio/master/getopt.h although that's likely not the origin of the fi