Mah-D / DoUMean

Levenshtein Spell Checker

This is an implementation of Levenshtein distance. Given an array of reference strings and a word to check against them, DoUMean finds the closest match to the given word. Check main.js to see examples.