Hi,
 
I'm searching for an optimized Levenshtein Distance like Postgresql's. My problem is that I want to compare strings with a length over 255 characters.
Does anyone know a solution?
 
Janek Sendrowski