|
in reply to Re: Levenshtein distance: calculating similarity of strings
in thread Levenshtein distance: calculating similarity of strings
- When I said "what else is new" I didn't refer to CPAN modules, but the general practice of not commenting. I see how I could've been misunderstood
- http://www.merriampark.com/ld.htm#FLAVORS indeed gives a step-by-step recipe to the algorithm, but if you read carefully you see that it doesn't go a bit into explaining why things are the way they are. My code does
- To avoid further mis-understanding, I removed the offending phrase
|
