Levenshtein Algorithm based approach, Levenshtein Algorithm (Edit distance algorithm) is used to find the similarity between two strings.

Levenshtein distance implementation using a trie for fast string similarity searching

A proof-of-concept program for lightweight fingerprints for fast approximate keyword matching using bitwise operations.

A spell checker that loads /usr/share/dict/words and uses Levenshtein distance to find similar words.

@College_Project: A tool for detecting and extracting relevant information from a call for papers (CFP).

MAG for approximate pattern matching (MAGA)

A C++11 port of Buffer, μ-framework for efficient array diffs, collection observation and data source implementation.

Calculation Of Levenshtein Distance

Ever wondered how spell checkers work? I actually found them quite fascinating, so I decided to build one myself. This project is a spell checker implemented in C++ using the strategy pattern.

A Levenshtein Distance implementation using C++ with a dynamic programming approach.

Calculation of Levenshtein and Damerau Levenshtein distances in C++

Levenshtein distance related Facebook puzzle solution

Banded approach of semi-global levenshtein distance on FPGA using OpenCL. This work was published in FPL2021.

Levenshtein distance based string suggestion lib

package for exact edit similarity joins

Levenshtein distance implementation using an automaton and a trie for fast string similarity searching

Spellchecker using the Levenshtein Distance between words to correct user input

A blazing fast dictionary for the Terminal.

A single header C++ library for compute edit distance (Levenshtein distance), supporting wstring ( and Chinese string).