Re: Levenshtein Distance with more than 255 characters

From: Szymon Guz <mabewlun(at)gmail(dot)com>
To: Janek Sendrowski <janek12(at)web(dot)de>
Cc: PostgreSQL <pgsql-general(at)postgresql(dot)org>
Subject: Re: Levenshtein Distance with more than 255 characters
Date: 2013-09-06 06:40:33
Message-ID: CAFjNrYuhKq5qxpJKtBdOY=qEis+8OXb8u-T_3ymVd3dOvnHJqw@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

On 6 September 2013 01:00, Janek Sendrowski <janek12(at)web(dot)de> 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

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Tom Lane 2013-09-06 06:47:34 Re: Levenshtein Distance with more than 255 characters
Previous Message Haribabu kommi 2013-09-06 05:22:28 Re: Question About WAL filename and its time stamp