Fuzzy string searching. String distance algorithm based on a tree technique?
Fuzzy string searching. String distance algorithm based on a tree technique?
- Subject: Fuzzy string searching. String distance algorithm based on a tree technique?
- From: "Theodore H. Smith" <email@hidden>
- Date: Thu, 21 Oct 2004 18:03:56 +0100
Does anyone know a string distance algorithm that is based on a tree
technique? Or one that is recursive (stack based), but also calls
itself in such a way that its operation could be drawn as a tree,
cutting off branches which are too dissimilar and not going down those
paths.
I know of Levenshtein for doing string distances, I've used it
sucessfully in the past, but that is not what I need. I need a tree
based one.
Why?
I need to adapt it for a different purpose, which is "fuzzy string
searching". Levenshtein is simply not adaptable for this purpose. At
least if it is, I haven't figured out how ;o)
Any smart people have any ideas?
--
Theodore H. Smith - Software Developer.
http://www.elfdata.com
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Cocoa-dev mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
This email sent to email@hidden