Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
For an algorithms class, I am doing a project which investigates any particular algorithm. I chose to investigate BK Trees (Burkhard-Keller Trees). A BK Tree is associated with fuzzy string searches (e.g. spell check, word recommendations). However, it seems that BK Trees don’t perform that quickly, and could even be outdated. There aren’t a lot of good, academic sources out there. Are there any faster, more efficient algorithms out there for fuzzy string matching?
Thank you!
Here are a few common approaches