You could do a hash of each Q/A pair into a dictionary as you iterate through them and only keep each one if its hash doesn't exist yet. If you're looking to do a fuzzier search, you could do cosine similarity and throw out anything that's got too close of a nearest neighbor.
this post was submitted on 23 Nov 2023
1 points (100.0% liked)
LocalLLaMA
3 readers
1 users here now
Community to discuss about Llama, the family of large language models created by Meta AI.
founded 1 year ago
MODERATORS