Support What's a Creel? on Patreon: [ Ссылка ]
Office merch store: [ Ссылка ]
FaceBook: [ Ссылка ]
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: [ Ссылка ]
RosettaCode (featuring Martin Ettl's C++ single row version): [ Ссылка ]
Source for the dictionary used in this video: [ Ссылка ]
Software used to make this vid:
Visual Studio 2019 Community: [ Ссылка ]
Audacity: [ Ссылка ]
OBS: [ Ссылка ]
Davinci Resolve 16: [ Ссылка ]
OpenOffice: [ Ссылка ]
Gimp: [ Ссылка ]
