This Lesson is for PRO Members

Subscribe today and get access to all lessons! Plus direct HD download for offline use, enhances transcripts, member comment forums, and iTunes "podcast" RSS feed. Level up your skills now!

Unlock This Lesson

Already subscribed? Sign In

Compare similarity of strings through string distance in Natural

We will learn how to compare how similar two strings are to each other, examining three algorithms: Jaro-Winkler, Levenshtein, and Dice’s Coefficient.

You should note that none of these algorithms are inherently better than the others. Instead, it's important to choose the one that best fits your text data.

Please take a moment to tell your friends:

You must be a PRO Member to view code