How do Spell Checkers work? Levenshtein Edit Distance @WhatsACreel
How do Spell Checkers work? Levenshtein Edit Distance  @WhatsACreel
Uploaded January 2021 | Updated November 2026, 2 days ago
Support What's a Creel? on Patreon: patreon.com/whatsacreel
Office merch store: whats-a-creel-3.creator-spring.com
FaceBook: facebook.com/whatsacreel



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: en.wikipedia.org/wiki/Levenshtein_distance
RosettaCode (featuring Martin Ettl's C++ single row version): rosettacode.org/wiki/Levenshtein_distance
Source for the dictionary used in this video: gwicks.net/dictionaries.htm


Software used to make this vid:
Visual Studio 2019 Community: visualstudio.com/downloads
Audacity: audacityteam.org
OBS: obsproject.com
Davinci Resolve 16: blackmagicdesign.com/products/davinciresolve
OpenOffice: openoffice.org
Gimp: gimp.org
How do Spell Checkers work? Levenshtein Edit DistanceNeural Nets 4: Adding Layers Explained (Deep Learning)AVX512 (1 of 3): Introduction and OverviewComputer Science Lockdown Quiz 2C++ Tutorial 23: Intro to DefineModern x64 Assembly 3: 32 and 64 bit RegistersAoS vs. SoA: Array of Structures versus Structure of ArraysDirect3D 11 1: Introduction and WindowIntro to Rust Programming Language (Installing guide, cargo and simple examples, vs C++)Modern x64 Assembly 14: Structures in ASM and C++The Sorting Algorithm Olympics - Who is the Fastest of them AllC++ Tutorial 3: If Statements and Conditions
Creel |

How do Spell Checkers work? Levenshtein Edit Distance

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER