Hello, Scott David Daniels <[EMAIL PROTECTED]> wrote in message news:<[EMAIL PROTECTED]>... > William Park wrote: > > How do you compare 2 strings, and determine how much they are "close" to > > each other? > > Here's a really weird idea: Measure the size difference between the > pair of strings compressed together and compressed separately. > The idea isn't weird. The only problem is that naive approach failed. compress(a,b) != compress(b,a). Having an assumption that compressing is a good approximation for the Kolmogorov complexity, the correct formula is a bit more complicated.
-- olpa@ http://datahansa.com/ XML publishing and documentation management http://uucode.com/blog/ Generative Programming, XML, TeX, Scheme -- http://mail.python.org/mailman/listinfo/python-list