[Tutor] Find all strings that....

[Albert-Jan Roskam]

hi,

this page contains interesting info about this topic. The algorithms that are discussed are all implemented in Python.

http://cs.anu.edu.au/~Peter.Christen/Febrl/febrl-0.3/febrldoc-0.3/node38.html

 
Cheers!!
Albert-Jan


~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
All right, but apart from the sanitation, the medicine, education, wine, public order, irrigation, roads, a fresh water system, and public health, what have the Romans ever done for us?
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


>________________________________
>From: Jerry Hill <malaclypse2 at gmail.com>
>To: "tutor at python.org" <tutor at python.org>
>Sent: Friday, November 11, 2011 7:38 PM
>Subject: Re: [Tutor] Find all strings that....
>
>
>On Fri, Nov 11, 2011 at 1:21 PM, Francesco Loffredo <fal at libero.it> wrote:
>
>Anyway, taking for granted the rules contained in the edit distance definition (Thank you, Steven!), I think that finding in a given set S all words that can be converted into some given "target" with at most N such operations (better:  the subset of all words in S with an edit distance from "target" <= N) is a very interesting and challenging task. Thank you (and your friend!) for this exercise, I'll give it a try.
>>
>There are some standard library tools that make this pretty easy.  Take a look into difflib if you're interested.  As always, there's nothing wrong with doing it yourself so that you understand it better, of course.
>
>-- 
>Jerry
>
>_______________________________________________
>Tutor maillist  -  Tutor at python.org
>To unsubscribe or change subscription options:
>http://mail.python.org/mailman/listinfo/tutor
>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/tutor/attachments/20111111/80ac3284/attachment.html>