Currently, a hybrid embeddings search combines the top n results from the dense vector search and sparse vector search. These combined results are then reordered.
An updated hybrid scoring algorithm should do the following.
- Pull the top n * 10 sparse + dense results respectively
- Combine the scores together as it does today
- Re-order and return the top n best scoring rows