Shortens the paragraph depending on the given keywords using Levenshtein distance
-
Updated
Sep 20, 2020 - Python
Shortens the paragraph depending on the given keywords using Levenshtein distance
Implemented various spellcheck techniques like cosine similarity, jaccard similarity and levenshtein distance. Open to any further contributions.
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
C++/Assembler language program simulating the operation of autocorrect using the Levenshtein (Editing Distance) Algorithm. [PL]
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
Implementation of the Levenshtein Algorithm in x86 Assembler (for multi-threaded use). [ENG]
Voirex - Speech to Function API
fast weighted levenshtein distance library in Golang
A python implementation of bk trees and Levenshtein distances
Implementation of Spell-check algorithm in c++, returns a list of valid suggestions to incorrect words
[EN]Repository with C++ implementations of famous algorithms/ [PT-BR] Repositório com implementações em C++ de algoritmos famosos
A web service for calculating the Levenshtein distance between two sequences
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."