The BK-tree is a metric tree suggested by Walter Austin Burkhard and Robert M. Keller. Using a string metric like the Levenshtein distance and a tree-like data structure that I recreated in Scratch, it allows you to obtain a list of words closest to a string of characters, such as a misspelled word. Use TurboWarp for better performance : -> https://turbowarp.org/1318329983 If you want to use this algorithm in one of your projects, simply copy the "BK tree" sprite. The algorithm's usage is explained in the project.
