3 ms·
Could HN help me with this. I remember reading this really wonderful article on the levenshtein distance on HN 2-3 months ago. basically I have difficulty und
by wrong_variable 10y ago
Could HN help me with this.
I remember reading this really wonderful article on the levenshtein distance on HN 2-3 months ago.
basically I have difficulty understanding why the Wagner-Fisher's algorithm works - the intuition behind it - I remember it was dynamic programming but I really want to read that article again.
The format was similar to medium with wonderful diagrams :( I tried searching for it on HN but searching on HN is really difficult and it was my own fault for not saving it on Pocket.
I would really appreciate the help since it was one of those "better explained" gems.
- alixaxel 10y agoAlso curious, could it be one of these websites where they explain algorithms visually? Have you tried https://hn.algolia.com/?query=levenshtein&sort=byPopularity&prefix&page=0&dateRange=pastYear&type=story https://hn.algolia.com/?query=levenshtein&sort=byPopularity&... ?
- wrong_variable 10y agooh wow ! didnt know there was a handy search engine for HN. basically it explained 1-dimentional Levenshtein distance first. That blew my mind since its much easier to think about the 1d case and then apply it for a 2d matrix. but i remember reading only half-way through the article before had to do something else :( sorry - but I really want to read it again since it will really help me out at my work ! EDIT - FOUND IT ! thanks a lot for that ! It was a god send ! http://davedelong.tumblr.com/post/134367865668/edit-distance-and-edit-steps http://davedelong.tumblr.com/post/134367865668/edit-distance... here is the link - you just made my afternoon ! EDIT 2 - someone should write a book which explains all maths/algorithms concepts using just links to blog posts by most HN popularity - just a though :)