# [PHP] Question about Olivier's method - Thread: https://externals.io/message/44065 - Original archive: https://news-web.php.net/php.internals/44065 - Started by paul aka: azmodai on 2009-05-26T14:17:01+00:00 - Messages: 7 - Reply by email to internals@lists.php.net - More for agents: search with https://externals.io/search.md?q={query} · JSON API at https://externals.io/api · documentation at https://externals.io/llms.txt --- ## #44065 — paul aka: azmodai — 2009-05-26T14:17:01+00:00 URL: https://externals.io/message/44065#44065 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 ? Thank you very much, Best regards, AZMODAI Paul, --- ## #44066 — Hannes Magnusson — 2009-05-26T18:06:37+00:00 URL: https://externals.io/message/44065#44066 · In reply to: #44065 On Tue, May 26, 2009 at 16:17, paul (aka: azmodai) 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 --- ## #44067 — Paul Biggar — 2009-05-26T18:21:33+00:00 URL: https://externals.io/message/44065#44067 · In reply to: #44066 On Tue, May 26, 2009 at 7:06 PM, Hannes Magnusson wrote: > On Tue, May 26, 2009 at 16:17, paul (aka: azmodai) > So, who is this Oliver - and where is that description/pseudo code? :) A note on that page (from brad dot fish at gmail dot com on 24-Feb-2006 10:30) says: "The link below to the Oliver document appears to be broken. Here is one that works: http://citeseer.ist.psu.edu/oliver93decision.html" Paul -- Paul Biggar paul.biggar@gmail.com --- ## #44068 — Hannes Magnusson — 2009-05-26T18:31:24+00:00 URL: https://externals.io/message/44065#44068 · In reply to: #44067 > On Tue, May 26, 2009 at 7:06 PM, Hannes Magnusson > wrote: > > […] > > > […] > > A note on that page (from brad dot fish at gmail dot com on > 24-Feb-2006 10:30) says: > > "The link below to the Oliver document appears to be broken. Here is > one that works: http://citeseer.ist.psu.edu/oliver93decision.html" Heh. I had assumed he read the notes :) That link is broken to, but archive.org has it from 1997; http://web.archive.org/web/*/http://www.cs.monash.edu.au/~jono/TechReports/TR173.dgraph.ps -Hannes --- ## #44069 — Paul Biggar — 2009-05-26T18:41:18+00:00 URL: https://externals.io/message/44065#44069 · In reply to: #44068 On Tue, May 26, 2009 at 7:31 PM, Hannes Magnusson wrote: > > > […] > > That link is broken to, but archive.org has it from 1997; > http://web.archive.org/web/*/http://www.cs.monash.edu.au/~jono/TechReports/TR173.dgraph.ps Citeseer keeps a cache (in the top right-hand-side of the page). Citeseer has been very reliable for the last year or so, but there were problems with links changing, and an unreliable connection before that. Maybe archive.org is better as a result. Paul -- Paul Biggar paul.biggar@gmail.com --- ## #44070 — Paul Biggar — 2009-05-26T18:41:53+00:00 URL: https://externals.io/message/44065#44070 · In reply to: #44068 On Tue, May 26, 2009 at 7:31 PM, Hannes Magnusson wrote: > > > […] > > That link is broken to, but archive.org has it from 1997; > http://web.archive.org/web/*/http://www.cs.monash.edu.au/~jono/TechReports/TR173.dgraph.ps Citeseer keeps a cache (in the top right-hand-side of the page). Citeseer has been very reliable for the last year or so, but there were problems with links changing, and an unreliable connection before that. Maybe archive.org is better as a result. Paul -- Paul Biggar paul.biggar@gmail.com --- ## #44078 — paul aka: azmodai — 2009-05-27T08:43:39+00:00 URL: https://externals.io/message/44065#44078 · In reply to: #44066 Oops, indeed I forgot speaking about the comment I found when I was searching for similar_text properties Thank you very much for your help Hannes and Paul ! I'm going to read this file right now ;-) 2009/5/26 Hannes Magnusson > On Tue, May 26, 2009 at 16:17, paul (aka: azmodai) > wrote: > > […] > a > > […] > something > > […] > method. > > […] > similar_text > > […] > they > > […] > about > > […] > > 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