Grokking Algorithms: An illustrated guide for programmers and other curious people

by Aditya Y. Bhargava

Levenshtein distance measures how similar two strings are, and it uses dynamic programming. Levenshtein distance is used for everything from spell-check to figuring out whether a user is uploading copyrighted data.