Exploring Latent Word Vectors using Path Finding

In my previous post, I created a product recommendation system using word embeddings. Today, we’ll take it a step further and explore how we can use these vectors to find the shortest path between pairs of words. Dijkstra’s algorithm Dijkstra’s algorithm is a method for finding the shortest path between any two vertices of a…

Read More