John Machin:
> This paper by Heikki Hyyrö is well worth
> reading, and refers to a whole lot of previous work, including
> Ukkonen's:
> http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.2242
This is the site of the author:
http://www.cs.uta.fi/~helmu/pubs/pubs.html
There you can find updat
On Dec 20, 7:07 pm, Øyvind wrote:
> Thanks for the useful comments.
>
> On 20 Des, 01:38, John Machin wrote:
>
> > On Dec 20, 10:02 am, Øyvind wrote:
>
> > > Based on examples and formulas
> > > fromhttp://en.wikipedia.org/wiki/Jaro-Winkler.
>
> > For another Python implementation, google "febr
Thanks for the useful comments.
On 20 Des, 01:38, John Machin wrote:
> On Dec 20, 10:02 am, Øyvind wrote:
>
> > Based on examples and formulas
> > fromhttp://en.wikipedia.org/wiki/Jaro-Winkler.
>
> For another Python implementation, google "febrl".
>
> > Useful for measuring similarity between
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Øyvind wrote:
> Based on examples and formulas from http://en.wikipedia.org/wiki/Jaro-Winkler.
> Useful for measuring similarity between two strings. For example if
> you want to detect that the user did a typo.
Jaro-Winkler is best when dealing with
On Dec 20, 10:02 am, Øyvind wrote:
> Based on examples and formulas fromhttp://en.wikipedia.org/wiki/Jaro-Winkler.
For another Python implementation, google "febrl".
> Useful for measuring similarity between two strings. For example if
> you want to detect that the user did a typo.
You mean lik
