how to do fuzzy search in big data

Question

I\'m new to that area and I wondering mostly what the state-of-the-art is and where I can read about it.

Let\'s assume that I just have a key/value store and I have some

Answer 1

Depends on what your key/values are like, the Levenshtein algorithm (also called Edit-Distance) can help. It calculates the least number of edit operations that are necessary to modify one string to obtain another string.

• http://en.wikipedia.org/wiki/Levenshtein_distance
• http://www.levenshtein.net/