Newsgroups: php.internals
Path: news.php.net
Xref: news.php.net php.internals:44066
Mailing-List: contact internals-help@lists.php.net; run by ezmlm
Received-SPF: pass (pb1.pair.com: domain gmail.com designates 72.14.220.152 as permitted sender)
DomainKey-Status: bad
DomainKey-Signature: a=rsa-sha1; c=nofws;
        d=gmail.com; s=gamma;
        h=mime-version:in-reply-to:references:date:message-id:subject:from:to
         :cc:content-type:content-transfer-encoding;
        b=ZLbNQQCceVtg+gD3L2buxpRhce97qYwhb7akoFl6BuHbJT8raFgUfGlyqDjNsveDJ5
         P7yfY2N9jbcY7HCEp6cSuAeiwe/n9v6DeFgMThiW3Eq6wUhwcjFAPtokWV6uqYhRUOBS
         2J2cNo9Sz7kjkQgqrmIyebxd5InUrpZ3nCIYA=
MIME-Version: 1.0
In-Reply-To: <88441b60905260717w78cf2bb6i1ffc47ea2afb59da@mail.gmail.com>
References: <88441b60905260717w78cf2bb6i1ffc47ea2afb59da@mail.gmail.com>
Date: Tue, 26 May 2009 20:06:37 +0200
Message-ID: <7f3ed2c30905261106w63745d33t8ede4e15a460cc06@mail.gmail.com>
To: "paul (aka: azmodai)" <azmodai.paul@gmail.com>, sas@php.net
Cc: internals@lists.php.net
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Subject: Re: [PHP-DEV] [PHP] Question about Olivier's method
From: hannes.magnusson@gmail.com (Hannes Magnusson)

On Tue, May 26, 2009 at 16:17, paul (aka: azmodai)
<azmodai.paul@gmail.com> wrote:
> Hello,
>
> I'm looking for information about Olivier's method in order to supplement a
> talk. I spent a lot of time on engine searchers and I didn't find something
> documented enough to make me understand the way of working of such a method.
> Then I decided to contact you directly. Because I use the php similar_text
> function using this method to study how regular sentences change when they
> spread in a sample of people. I thought you could help me.
> Do you know a webpage or something else where I could find information about
> Olivier's method ?

To decrypt this question, he is talking about the comment in the
manual on www.php.net/similar_text
"calculates the similarity between two strings as described in Oliver
[1993]. Note that this implementation does not use a stack as in
Oliver's  pseudo code, but recursive calls which may or may not speed
up the whole process. Note also that the complexity of this algorithm
is O(N**3) where N is the length of the longest string."

That comment has been there since 9 years and 11 months ago, committed
by sas (which was the initial commit).

So, who is this Oliver - and where is that description/pseudo code? :)

-Hannes