I've now implemented the Levenshtein Distance algorithm I described the other day, and it's compiled successfully! With a bit more logic to run it over my links table...

I think next time I'll integrate this into my I/O so I can finally navigate links without relying on imperfect human memory. Which'll wrap up this traunch!

Sign in to participate in the conversation

For people who care about, support, or build Free, Libre, and Open Source Software (FLOSS).