A python implementation of bk trees and Levenshtein distances
-
Updated
Sep 21, 2018 - Python
A python implementation of bk trees and Levenshtein distances
Implementation of the Levenshtein Algorithm in x86 Assembler (for multi-threaded use). [ENG]
C++/Assembler language program simulating the operation of autocorrect using the Levenshtein (Editing Distance) Algorithm. [PL]
[EN]Repository with C++ implementations of famous algorithms/ [PT-BR] Repositório com implementações em C++ de algoritmos famosos
Shortens the paragraph depending on the given keywords using Levenshtein distance
fast weighted levenshtein distance library in Golang
Voirex - Speech to Function API
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
A web service for calculating the Levenshtein distance between two sequences
An incomplete terminal-based game where the user could interact with a dog. Chances of me coming back to finish this are very low and it was just meant to be a fun exercise in python
Implemented various spellcheck techniques like cosine similarity, jaccard similarity and levenshtein distance. Open to any further contributions.
Implementation of Spell-check algorithm in c++, returns a list of valid suggestions to incorrect words
A fuzzy string dictionary based on Levenshtein automata
Add a description, image, and links to the levenshtein-string-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-string-distance topic, visit your repo's landing page and select "manage topics."