STL and Boost compatible edit distance functions for C++
-
Updated
Apr 14, 2014 - C++
STL and Boost compatible edit distance functions for C++
👌 Simple search suggestion using the Levenshtein distance algorithm.
Presentation about algorithmic complexity at PHPnRio 2012 conference
A go-kit based microservice for the Levenshtein distance algorithm
This application is an implementation of a spell checker for English text. The spell checker incorporates a database of known words, which is built from a simple word list. The Burkhard-Keller Tree (BK-Tree for short) organizes the word list for efficient searching.
DP approach to solve the palindrome creation problem from a given string with the optimum number of addition, deletion and swaps.
@College_Project: A tool for detecting and extracting relevant information from a call for papers (CFP).
🚄 💨 A lightweight implementation of the Levenshtein distance algorithm.
A simple game in which you must calculate the edit distance between words
МГТУ ИУ7 "Анализ алгоритмов" лабораторные работы
A C++11 port of Buffer, μ-framework for efficient array diffs, collection observation and data source implementation.
A simple spell corrector built in C++
Plain PHP implementation of the Levenshtein distance
Golang quick levenstein distance measure
Projet Bases de Données avancées 2017
Utils for node project
Spell checker written in Kotlin
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."