|
| [Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] |
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
| References: | |
| >Fuzzy string searching. String distance algorithm based on a tree technique? (From: "Theodore H. Smith" <email@hidden>) |
| Home | Archives | Terms/Conditions | Contact | RSS | Lists | About |
Visit the Apple Store online or at retail locations.
1-800-MY-APPLE
Contact Apple | Terms of Use | Privacy Policy
Copyright © 2011 Apple Inc. All rights reserved.