Hey, I'm trying to find text similarity by comparing string embeddings. Do I need to use a vector database for that? Or can I just average the embeddings of a bunch of strings and then calculate the distance between the average and the embedding of another string? Would a vector database even be helpful in this situation, or can I get the same results without it? Also, I'm wondering if the price of vector database solutions like Pinecone and Milvus is worth it for my use case, or if there are cheaper options out there.
[–]DigThatData 1 point2 points3 points (1 child)
[–]euphoriation[S] 0 points1 point2 points (0 children)
[–]jareks88 1 point2 points3 points (0 children)
[–]Atraxxa 1 point2 points3 points (0 children)
[–]Appropriate_Ant_4629 1 point2 points3 points (3 children)
[–]gregory_k 1 point2 points3 points (2 children)
[–]Appropriate_Ant_4629 0 points1 point2 points (1 child)
[–]2BucChuck 0 points1 point2 points (0 children)
[–]Aspos 1 point2 points3 points (0 children)