I was faffing about trying to find a good way to compare two strings when I found the wiki article on Levenshtein distance. The algorithm on that page, rewritten to make implementation in 68K assembly a bit easier, works remarkably well and seems to give good, reliable scores without needing a huge amount of memory or using any 'clever' programming.
It's all been bundled up with a little user interface as a demo here
And while you're there the scroll window demo has had an update.
My mirror site page at .. http://members.multimania.co.uk/leeedavison/68k/easy68k/index.html#scroll
.. is broken at the moment. Problems with FTP transfers which have yet to be resolved.
Ah, Friday the 13th. That could be it.