Question 18
Consider a RAG application (uses chunking and cosine similarity to compare chunks) .
The input query to the RAG is given who's embedding vector is as follows: [1,0.5,1]
The vector store contains 3 chunk embeddings as follows:
C1 = [0,1,0.9] C2 = [1,1,1] C3 = [0.2,0,0.5]
Which chunk will be retrieved when the RAG application executes the input query?
C1
C2
C3
C1 and C2 are equally likely.