edit-distance-algorithm

schiffma/distlib

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.

robertgr991/fastDamerauLevenshtein

Cython implementation of true Damerau-Levenshtein algorithm.

iranailab/eval_mt

To evaluate machine translation, they use several methods, some of which we fully implemented

vantrong291/vn_address_standardizer

A package for parsing Vietnamese address

disha2sinha/Data-Structures-and-Algorithms

CPP codes for some popular algorithms

neurlang/levenshtein

Levenshtein implements the Levenshtein (edit distance and diff) algorithm for golang

nilaksh/qwerty-jaro-winkler

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.

OrionJoshi/AutoSuggest_Using_Levenshtein

Auto Suggestion Using Levenshtein Algorithm(Edit Distance)

soras/genEditDist

Generalized edit distance command line tool

Konrad-Ziarko/Levenshtein

Sniffer, KeyLogger, Clipboard listener, USB scanner with ADS support; Computes Levenshtein minimum edit-distance between two strings

ppml38/shortest_edit_script

Novel algorithm to generate shortest edit script.

canberkakcali/hashtable-spell-checker

Spell Checking and Correcting using a HashTable Implementation and the Edit Distance Algorithm in C

georgioyammine/XDP-XML-Diff-and-Patch

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.

tcrouch/edits

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

IamShubhamGupto/Advanced-Algorithms

Implementations of most algorithms learnt in the course UE18CS311

mutalibcs/Bio-informatics

Bio informatics course materials for NEUB students.

AbdQaddora/edit_distance

This is a React application for calculating the edit distance between two DNA sequences. The edit distance measures the minimum number of operations (insertions, deletions, and substitutions) required to transform one sequence into another. The app provides various methods to calculate the distance, including bounded and adaptive bounded methods.

Ahmed-Ibrahim-Goname/PPHD

Academy

anandsharma26/Information-Retrieval

Created various Information Retrival Algorithms from scratch in python

celineuygun/Bioinformatics

INF103 Dönem Sonu Projesi

danielangelarro/Moogle

isherep/Delete-Only-Levenshtein

Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters

kkkooolllyyyaaa/Text-Similarity

Editing distance algorithm realisation

petrroll/EditDistanceHS

Edit distance algorithm in haskell.

rfgplk/fuzzy

an approximate string matching library written in C++

ritu-thombre99/Tolerant-Retrieval-Edit-Distance

Finding edit distance between a correct and an incorrect string

George614/edit_distance_gpu

Accelerating Levenshtein Edit Distance Using GPU and PyCUDA

hardikbhawsar/Edit-Distance-CPP

Edit distance algorithm implemented using C++ to calculate edit distance between two words and alignment.

zzzzz1st/EditDistance

Comparing edit distance with n-grams

1453nicat/Levenshtein_distance

The paper explains the Levenshtein Distance algorithm, which finds the minimum edits to change one string into another. It covers its logic, uses in NLP, spell checking, bioinformatics, and compares it to other string similarity method and similarity metrics.

arrdel/auto-correct-model

An implementation of a spell checker that uses a corpus file to compute word probabilities and suggests corrections for misspelled words by applying edit operations like delete, swap, replace, and insert.

jayvatti/spellChecker

Spell Checker using a Hash Table

maomullick/Edit-Distance-in-C

Implementing Edit Distance in C

maomullick/Edit_distance_count

This is a problem which is asked to solve in my Data Structure & Algorithm Lab.

mndxpnsn/edit-distance

Dynamic programming solution to the "Edit Distance" problem.