OK, I finally figured out an altered version of Levenshtein, which is
compatible with Smith-Waterman.

This means I can now continue development on my fuzzy search
algorithms! In fact the altered version of Levenshtein is simpler
than I expected it to be, it's so simple, but slightly unintuitive in
it's implementation.

This should be fun! Completing my fuzzy search algorithm should be fun.

It's been a long time since I worked on this code, and it is the
hardest most complex piece of code I've ever worked on. Hopefully I
should get up to speed again however in no longer than a day.

What does this mean for ElfData users?

Well, if they are using ElfData to do biological processing, it means
you'll be able to use it for BLAST-like searches.

What if you aren't using it for biological processing, just English?
In that case, you'll be able to do fuzzy sentance similarity testing!
This quite exciting actually.

ElfData will now be able to tell that the sentance "hello fred this
is my frog", contains the same words as "hello this is my frog fred".

Basically, it'll be able to detect re-arranged words in a sentance.
It's quite powerful actually. Very cool stuff. Now I must get onto my
C++ coding!

--
http://elfdata.com/plugin/