Minkoo wrote:

> Hi list.
> 
> I read an article posted at Wikipedia about Levenshtein distance (aka edit
> distance).
> The location of the document is
> http://en.wikipedia.org/wiki/Levenshtein_distance
> 
> In the document, a sample Ruby code goes like the following:
> 
> class String
>   def levenshtein(comparator)
[...]
> In the code, there's a parameter called comparator which seems to be 
> used to
> decode given parameter. But, I can't understand what exactly the comparator
> is doing.

I didn't examine the code, but I'd guess... you want the L. distance 
between two strings. One is self, and the other is the parameter named 
"comparator".

Good luck.
--