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...

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 :)