I borrowed @1132262's keyboard distance and quicksort scripts. I coded everything else myself. Nope. Still too slow. The Levenshtein Distance algorithm itself is O(n^2m^2) when implemented in Scratch, and there's no way of changing that. Apart from lowering the dictionary size, there is probably no way to make this any faster. Edit: turns out I was wrong.
