pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
-
Updated
Sep 16, 2022 - Python
#
edit-distance-algorithm
Here are 37 public repositories matching this topic...
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
extension
sqlite
edit-distance
jaro-winkler
levenshtein-distance
sqlite3
permutation
subsets
longest-common-subsequence
jaro-winkler-distance
subsequence
edit-distance-algorithm
longest-common-substring
damerau-levenshtein-distance
-
Updated
Sep 6, 2021 - C
Cython implementation of true Damerau-Levenshtein algorithm.
-
Updated
Oct 31, 2020 - Python
Qwerty-Jaro–Winkler distance is a tweak on top of jaro winkler edit distance where we try to consider distance between keys in keyboard while calculating number of matches.
-
Updated
Aug 14, 2017 - Java
A package for parsing Vietnamese address
-
Updated
May 14, 2022 - Python
Generalized edit distance command line tool
c
transformations
edit-distance
levenshtein-distance
alignment
edit-distances
editdistance
edit-distance-algorithm
aho-corasick-algorithm
generalizededitdistance
generalized-edit-distance
-
Updated
Mar 30, 2019 - C
Auto Suggestion Using Levenshtein Algorithm(Edit Distance)
-
Updated
Jun 24, 2021 - JavaScript
CPP codes for some popular algorithms
quicksort
mergesort
heapsort
longest-common-subsequence
knapsack-problem
edit-distance-algorithm
travelling-salesman-problem
dijkstra-shortest-path
longest-increasing-subsequence
bellman-ford-algorithm
floyd-warshall-algorithm
hamiltonian-cycles
all-pairs-shortest-path
graph-colouring-algorithms
n-queens-problem
chain-matrix-multiplication
min-cost-path
-
Updated
May 10, 2022 - C++
Sniffer, KeyLogger, Clipboard listener, USB scanner with ADS support; Computes Levenshtein minimum edit-distance between two strings
csharp
cuda
sniffer
ads
edit-distance
levenshtein
gpgpu
levenshtein-distance
keylogger
edit-distance-algorithm
gpgpu-computing
cudafy
-
Updated
Feb 11, 2019 - C#
Novel algorithm to generate shortest edit script.
diff
algorithms
edit-distance
data-structures
levenshtein-distance
research-project
git-diff
longest-common-subsequence
research-paper
string-similarity
editdistance
edit-distance-algorithm
longest-common-substring
editscript
edit-distance-algorithms
-
Updated
Aug 22, 2022 - JavaScript
Spell Checking and Correcting using a HashTable Implementation and the Edit Distance Algorithm in C
hashing
spellcheck
dictionary
edit-distance
spelling
spell-check
dynamic-programming
hashtable
spell-checker
hash-table
spelling-correction
spelling-corrector
spellchecker
editdistance
edit-distance-algorithm
edit-distance-path
-
Updated
Nov 15, 2017 - C
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
ruby
text
fuzzy-matching
edit-distance
levenshtein
jaro-winkler
similarity-measures
damerau-levenshtein
edit-distance-algorithm
jaro
restricted-edit
-
Updated
Oct 9, 2022 - Ruby
Bio informatics course materials for NEUB students.
bioinformatics
pdp
edit-distance-algorithm
bioinformatics-algorithms
needleman-wunsch-algorithm
dna-transcription
bio-informatics
smith-waterman-algorithm
neub
partial-digest-problem
-
Updated
Nov 5, 2022
Editing distance algorithm realisation
-
Updated
Apr 23, 2022 - Java
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
levenshtein-distance
duplicates-removed
string-matching
levenshtein-algorithm
edit-distance-algorithm
modified-levenshtein
levenshtein-deletion-only
character-duplication
delete-only-levenshtein
weighted-levenshtein
-
Updated
Apr 4, 2019 - Java
Edit distance algorithm in haskell.
-
Updated
Sep 15, 2016 - Haskell
XDP is a tool in Java 8 which compares XML documents (Structure and Content), returns the similarity, provides a diff file which can be used to patch the 1st XML producing the 2nd.
-
Updated
Mar 4, 2021 - Java
Created various Information Retrival Algorithms from scratch in python
information-retrieval
machine-learning-algorithms
tf-idf
dcg
cosine-similarity
jaccard-similarity
mutual-information
naive
edit-distance-algorithm
tf-idf-calculation
relevance-feedback
knn-classifier
rocchio-algorithm
naive-bayes-implementation
tf-idf-vectorizer
nltk-python
positional-posting-list
positional-indexing
static-quality-ordering
champion-list
-
Updated
Apr 14, 2020 - Jupyter Notebook
Implementations of most algorithms learnt in the course UE18CS311
kmp-algorithm
dynamic-table
dynamic-programming
string-matching
edit-distance-algorithm
rabin-karp-algorithm
polynomial-multiplication
matrix-chain-multiplication
splay-tree
fft-algorithm
lcs-algorithm
-
Updated
Dec 6, 2020 - C
Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.
information-retrieval
jaccard-similarity
levenshtein-algorithm
edit-distance-algorithm
document-term-matrix
-
Updated
Jul 23, 2021 - Python
Improve this page
Add a description, image, and links to the edit-distance-algorithm 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-algorithm topic, visit your repo's landing page and select "manage topics."