Levenshtein Edit Distance (Patreon)

How do Spell Checkers work? The Levenshtein Edit Distance Algorithm

This video is all about an interesting algorithm commonly used in spell-checkers. It is called the Levenshtein Edit Distance algorithm, and it determines the distance between two strings of symbols in terms of how many edits would be required to transform one string into another. The source code and accompanying e-book are available on Patreon. Wikipedia Levenshtein: https://en.wikipedia.org/wiki/Levenshtein_distance RosettaCode (featuring Martin Ettl's C++ single row version): https://rosettacode.org/wiki/Levenshtein_distance Source for the dictionary used in this video: http://www.gwicks.net/dictionaries.htm Support What's a Creel? on Patreon (access source codes and an accompanying e-book for this video): https://www.patreon.com/whatsacreel FaceBook: https://www.facebook.com/whatsacreel/ Music Channel: https://www.youtube.com/channel/UC2nWRGqPL6O-Lm8mexWhISQ Software used to make this vid: Visual Studio 2019 Community: https://www.visualstudio.com/downloads/ Audacity: https://www.audacityteam.org/ OBS: https://obsproject.com/ Davinci Resolve 16: https://www.blackmagicdesign.com/products/davinciresolve/ OpenOffice: https://www.openoffice.org/ Gimp: https://www.gimp.org/