def nearest_neighbors(self, word, count=1):
    embedding = self.get_embedding(word)
    heap = []
    for w in self.embeddings:
        if (w == word):
            continue
        dist = self.euclidian_distance(embedding, self.embeddings[w])
        heappush(heap, (dist, w))
    return nsmallest(count, heap)
def nearest_neighbors(self, word, count=1):
    embedding = self.get_embedding(word)
    heap = []
    for w in self.embeddings:
        if (w == word):
            continue
        dist = self.euclidian_distance(embedding, self.embeddings[w])
        heappush(heap, (dist, w))
    return nsmallest(count, heap)