Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
-
Updated
Apr 4, 2019 - Java
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
Implementation of Levenshtein Algorithm
Here Is Program To Check The Spelling And Correction in Spelling mistake suggester
Add a description, image, and links to the levenshtein-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-algorithm topic, visit your repo's landing page and select "manage topics."