[Tutor] stopping at 100 entries

[Simon Brunning]

> From:	Daniel Yoo [SMTP:dyoo@hkn.eecs.berkeley.edu]
> I was curious; is there a python module that, given a list of words and a
> misspelled word, returns back the "most similar" word?  I do remember
> reading about an algorithm that would give the "distance" between two
> words, but I haven't found it in Parnassus.
 
Daniel,
The algorithm that you want is called 'soundex'. I think that I remember a
soundex module at Parnassus, but I haven't tried it.

Cheers,
Simon Brunning
TriSystems Ltd.
sbrunning@trisystems.co.uk





-----------------------------------------------------------------------
The information in this email is confidential and may be legally privileged.
It is intended solely for the addressee. Access to this email by anyone else
is unauthorised. If you are not the intended recipient, any disclosure,
copying, distribution, or any action taken or omitted to be taken in
reliance on it, is prohibited and may be unlawful. TriSystems Ltd. cannot
accept liability for statements made which are clearly the senders own.