From: Dave Bass Date: 2008-05-25T19:30:12+09:00 Subject: Re: 40 million levenshtein distances for two long strings John wrote: > I am trying to discover similar files to reduce redundancy on a large > project. Edit distance isn't the only way to describe (dis)similarity, you know! Moreover, what you're proposing is a really brute-force approach. Defining similarity is not a trivial exercise. Two identical documents should have a similarity of one, no matter how measured, but dissimilar documents can have very different similarity figures depending on how you measure them. I suggest you look at the information retrieval literature (search engines etc). -- Posted via http://www.ruby-forum.com/.