@College_Project: A tool for detecting and extracting relevant information from a call for papers (CFP).
-
Updated
Oct 5, 2016 - C++
@College_Project: A tool for detecting and extracting relevant information from a call for papers (CFP).
Implementation of taught approaches
Implementation of a spellchecker using the Levenshtein distance, for integration to the course's search engine java skeleton.
Levenshtein algorithm with zero dependencies
Dynamic Programming code for MO640 course
C++/Assembler language program simulating the operation of autocorrect using the Levenshtein (Editing Distance) Algorithm. [PL]
Go calculate Levenshtein Distance.
Fuzzy search using Levenshtein Distance (LD) and Longest Common Substring (LCS) algorithm.
A simple autocorrect tool that can be used on Windows systems.
The Practice "Antiplagiarism"
A C library for calculating Levenshtein distance
Решение для задачи Тинькофф
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
This is a Go package that provides a function to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the difference between two strings, defined as the minimum number of single-character edits (insertions, deletions, or substitutions) required to transform one string into the other.
The Levenshtein Distance or edit distance measures the similarity between two sequences/strings.
Takes words from the user and checks if it is spelled correctly according to a wordlist containing the 10000 most used English words.
A simple JS game for dengue education
Global etymology approximation with Levenshtein distance
API for name similarity check
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."