Editing
Information Retrieval
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Remembering</span> == * '''Query''' β A user's information need expressed as text (keywords, natural language question, or structured expression). * '''Document''' β A unit of retrievable information: web page, paragraph, PDF, database record. * '''Relevance''' β The degree to which a retrieved document satisfies the user's information need. * '''Inverted index''' β A data structure mapping terms to the documents containing them; the backbone of all keyword-based IR. * '''TF-IDF (Term Frequency-Inverse Document Frequency)''' β A weighting scheme that ranks terms by their frequency in a document (TF) discounted by their commonness across all documents (IDF). * '''BM25 (Best Match 25)''' β A probabilistic retrieval function that extends TF-IDF with document length normalization; the dominant lexical retrieval algorithm. * '''Dense retrieval''' β Retrieving documents by computing similarity between dense vector embeddings of query and documents (vs. sparse keyword matching). * '''Sparse retrieval''' β Retrieval based on term overlap (BM25, TF-IDF); fast and exact but lacks semantic understanding. * '''Embedding''' β A dense vector representation of text enabling semantic similarity search. * '''Bi-encoder''' β A retrieval model with separate encoders for query and document; enables fast approximate nearest neighbor search. * '''Cross-encoder''' β A model that jointly encodes query + document for highly accurate relevance scoring; too slow for retrieval, used for re-ranking. * '''FAISS''' β Facebook's library for efficient approximate nearest neighbor search in high-dimensional embedding spaces. * '''Hybrid retrieval''' β Combining dense and sparse retrieval (e.g., BM25 + dense vectors) for better coverage. * '''Re-ranking''' β Applying a more accurate (but slower) model to re-order an initial set of retrieved candidates. * '''BEIR (Benchmarking Information Retrieval)''' β A heterogeneous benchmark suite for evaluating zero-shot dense retrieval across diverse domains. </div> <div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information