Re: levenshtein for large strings

Walter Kerelitsch wrote:
i need an algorithm for comparing two strings for equivalence, but
levenshtein is just working for strings up to 255 characters, i have to
process longer strings (lets say, about 10kB).

The Levenshtein algorithm has no limit in length. Your problem is probably
that PHP limits the length. Just implement the algorithm yourself. How it
works you can see e.g. on wikipedia:
http://en.wikipedia.org/wiki/Levenshtein_distance


.