3 Traditional Methods for Similarity Search (Jaccard, w-shingling, Levenshtein)
Similarity search is one of the fastest-growing domains in AI and machine learning. At its core, it is the process of matching relevant pieces of information together.

Similarity search is a complex topic and there are countless techniques for building effective search engines.

In this video, we'll cover three traditional approaches for comparing languages and identifying similar 'documents':

- Jaccard Similarity
- w-shingling
- Levenshtein distance

📰 Original article:
https://www.pinecone.io/learn/semantic-search/

🤖 70% Discount on the NLP With Transformers in Python course:
https://bit.ly/3DFvvY5

🎉 Sign-up For New Articles Every Week on Medium!
https://medium.com/@jamescalam/membership

Mining Massive Datasets Book (Similarity Search):
📚 https://amzn.to/3CC0zrc (3rd ed)
📚 https://amzn.to/3AtHSnV (1st ed, cheaper)

👾 Discord
https://discord.gg/c5QtDB9RAP

🕹️ Free AI-Powered Code Refactoring with Sourcery: 
https://sourcery.ai/?utm_source=YouTub&utm_campaign=JBriggs&utm_medium=aff

00:00 Intro
00:23 Jaccard Similarity
02:39 w-shingling
07:17 Levenshtein Distance