Compare similarity of strings through string distance in Natural
InstructorHannah Davis
Published 8 years ago
Updated 6 years ago
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.
egghead
~ an hour ago
Markdown supported.
Become a member to join the discussionEnroll Today
Member comments are a way for members to communicate, interact, and ask questions about a lesson.
The instructor or someone from the community might respond to your question Here are a few basic guidelines to commenting on egghead.io
Be on-Topic
Comments are for discussing a lesson. If you're having a general issue with the website functionality, please contact us at support@egghead.io.
Avoid meta-discussion
Code Problems?
Should be accompanied by code! Codesandbox or Stackblitz provide a way to share code and discuss it in context
Details and Context
Vague question? Vague answer. Any details and context you can provide will lure more interesting answers!