Subject: Re: Maximum length for levenshtein algorithm
To: p.becker@the-library-code.de, pgsql-docs@postgresql.org
References: <20170612221910.26504.10344@wrigleys.postgresql.org>
From: Peter Eisentraut <peter.eisentraut@2ndquadrant.com>
Organization: 2ndQuadrant
Message-ID: <9a1856c2-4e83-4dd1-8fd4-7dc9128482d0@2ndquadrant.com>
Date: Thu, 15 Jun 2017 11:17:41 -0400
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:52.0)
 Gecko/20100101 Thunderbird/52.1.1
MIME-Version: 1.0
In-Reply-To: <20170612221910.26504.10344@wrigleys.postgresql.org>
Content-Type: text/plain; charset=utf-8
Content-Language: en-US
Content-Transfer-Encoding: 7bit
Precedence: bulk
Sender: pgsql-docs-owner@postgresql.org

On 6/12/17 18:19, p.becker@the-library-code.de wrote:
> The following documentation comment has been logged on the website:
> 
> Page: https://www.postgresql.org/docs/9.2/static/fuzzystrmatch.html
> Description:
> 
> While the documenation of the versions 9.5 and 9.6 states a maximum length
> of 255 characters for the levenshtein algorithm&#39;s input, the documentation
> of any previous version states a maximium of 255 bytes. I expect that this
> hasn&#39;t change, but the documentation of older versions is wrong.

Yes, the older documentation was less correct.

-- 
Peter Eisentraut              http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services


-- 
Sent via pgsql-docs mailing list (pgsql-docs@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-docs