Unverified50% confidenceFactExact time
Vector retrieval performs terribly at looking up exact identifiers (such as contract numbers, customer names, date ranges, and material codes), because embedding models compress text into dense vectors, and similarity ranking has no binding force for exact equality.
1
Sources
50%
Confidence
Long-term
Relevance
10/15/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedVector search compares semantic similarity and is inherently poor at exact matching (such as numbers, dates, and codes); directed queries are a weakness of vector search.76% similarUnverifiedPure vector search falls short for information with high requirements for structure and precision (such as names and dates), and needs to be supplemented with metadata filtering75% similarUnverifiedThe bottleneck of single-pass retrieval stems from vector similarity search compressing the user query into a single high-dimensional vector; when a question contains multiple semantic directions, this vector becomes an average of multiple semantics, causing sub-intents to be insufficiently represented.71% similarUnverifiedVector search can retrieve text chunks with high similarity scores, but cannot explain the reasoning logic behind answers, nor structurally connect facts scattered across different documents.71% similarUnverifiedRelying solely on vector similarity retrieval often yields imprecise recall, necessitating a hybrid retrieval approach that combines keyword-based retrieval.69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1034920API
curl https://kongchang.com/api/v1/knowledge/claims/1034920MCP
get_claim(id=1034920)