Improving document retrieval with sparse semantic encoders · OpenSearch
OpenSearch 2.11 introduced neural sparse search—a new efficient method of semantic retrieval. In this blog post, you’ll learn about using sparse encoders for semantic search. You’ll find that neural sparse search reduces costs, performs faster, and improves search relevance. We’re excited to share benchmarking results and show how neural sparse search outperforms other search methods. You can even try it out by building your own search engine in just five steps. To skip straight to the results, see Benchmarking results.
OpenSearch 2.11 introduced neural sparse search—a new efficient method of semantic retrieval. In this blog post, you’ll learn about using sparse encoders for semantic search. You’ll find that neural sparse search reduces costs, performs faster, and improves search relevance. We’re excited to share benchmarking results and show how neural sparse search outperforms other search methods. You can even try it out by building your own search engine in just five steps. To skip straight to the results, see Benchmarking results . What are dense and sparse vector embeddings? When
related reading
- Building a web search engine from scratch in two months with 3 billion neural embeddingsblog.wilsonl.in
- Semantic Search - Sentence Transformers documentationsbert.net
- Announcing ScaNN: Efficient Vector Similarity Searchai.googleblog.com
- The vector database to build knowledgeable AI | Pineconepinecone.io
- From grep to SPLADE: A Journey Through Semantic Search - Elicitblog.elicit.com
- Introducing text and code embeddings | OpenAIopenai.com
- Faiss: A library for efficient similarity search - Engineering at Metaengineering.fb.com
- Okapi BM25 - Wikipediaen.wikipedia.org
- Voyage AI | Homevoyageai.com
- Vector embeddings | OpenAI APIdevelopers.openai.com
- [2004.04906] Dense Passage Retrieval for Open-Domain Question Answeringarxiv.org
- Cohere Rerank: Say Goodbye to Irrelevant Search Resultstxt.cohere.com