Re: Levenshtein Distance with more than 255 characters

[Szymon Guz <mabewlun@xxxxxxxxx>]

On 6 September 2013 01:00, Janek Sendrowski <janek12@xxxxxx> wrote:

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

Hi,

I'm not sure there is anything different from what you've found in core/contribs. But you can always use pg/plpython or pg/plperl procedure with some external library calculating the distance.

regards

Szymon