6 ms·
This was the first algorithm I ever searched for on wikipedia, back when I first learned to code. Good memories.
by bxio 7y ago
This was the first algorithm I ever searched for on wikipedia, back when I first learned to code. Good memories.
- bluesmoon 7y agolucky you :) there was no wikipedia when I first ran into this algorithm. Foxpro for DOS & Novell Netware had an implementation of Levenshtein distance that I ended up using as part of a college project on database basics. I used it to detect typos in data entry by comparing entered names with all names already in the table. It was blazingly fast because we never exceeded 30 names (the size of our class) and my profs were super impressed because they thought I did something way more complicated than I had.
- pvg 7y agoAnd then there's that strange yet oddly persistent certainty that back then it was called the Levenshtain distance.