Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

He did far more than use Levenshtein distance. He is matching phrases not individual words.

He created different metrics based on Levenshtein distance, combined them using a weighted formula, and used an optimization algorithm to choose weights. And he provides great visualizations on how it worked.

I've tried several approaches to fuzzy string matching, and I'm impressed with his results and approach. I've bookmarked it for future reference.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: