Vector Space Model & TF-IDF (1968) › Connections to Modern Search and Retrieval

Modern search systems often combine sparse lexical retrieval with neural and behavioral signals, as well as link analysis. Query-document scoring remains central, though production architectures use many representations and ranking stages rather than a single TF-IDF comparison.

Dense passage retrieval represents queries and documents with vectors learned by neural networks. Retrieval then uses cosine similarity, a dot product, or another geometric score. Dense and sparse representations may be used separately or together, depending on the collection and query type.

Recommendation systems also represent users and items with vectors. Those latent-factor or embedding models are not document TF-IDF, but they likewise use geometric operations to score candidate items.

Large language models also operate on vector representations. Attention computes query-key compatibility scores and uses them to mix value vectors. This is vector mathematics, but its learned, contextual computation differs substantially from cosine ranking over TF-IDF documents.

Hybrid search combines sparse and dense retrieval. A system may use BM25 for exact-term candidates and a dense model for semantic retrieval or re-ranking. Sparse methods often handle rare identifiers well, while dense methods can match paraphrases with little vocabulary overlap.