Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!gegeweb.org!de-l.enfer-du-nord.net!feeder1.enfer-du-nord.net!fu-berlin.de!uni-berlin.de!individual.net!not-for-mail From: Neil Cerutti Newsgroups: comp.lang.python Subject: Re: Optimizing Text Similarity Algorithm Date: 22 Aug 2011 13:05:03 GMT Organization: Norwich University Lines: 14 Message-ID: <9bf2fvFer9U1@mid.individual.net> References: Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Trace: individual.net I3dpA+EgrsMEjB5dxlzOTAyLJzKSroNissPnjYNOXoQcqZ3UHq Cancel-Lock: sha1:4bekgnX1Sv/485jEIdpcpR8h94M= User-Agent: slrn/0.9.9p1/mm/ao (Win32) Xref: x330-a1.tempe.blueboxinc.net comp.lang.python:12023 On 2011-08-22, Peter Otten <__peter__@web.de> wrote: > Ya??ar Arabac?? wrote: >> I originally posted this question on stackoverflow, you can find it here: >> http://stackoverflow.com/q/7133350/886669 >> >> I just want people check what I am doing and express their opinion about >> the thing I am doing is acceptable, or are there some expects of it that >> could change. Perhaps check out difflib.SequenceMatcher.ratio to see if the library function is good enough. -- Neil Cerutti