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
Spell Checking for bad casing and invalid character duplication
Add a description, image, and links to the modified-levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the modified-levenshtein topic, visit your repo's landing page and select "manage topics."