mlsanityData to 14 Oct 2026

Analysing the Robustness of Dual Encoders for Dense Retrieval Against Misspellings

arXiv 2205.02303 ↗First posted 4 May 2022cs.IRcited by 23

Not on the map. Why?

Abstract (arXiv)

Dense retrieval is becoming one of the standard approaches for document and passage ranking. The dual-encoder architecture is widely adopted for scoring question-passage pairs due to its efficiency and high performance. Typically, dense retrieval models are evaluated on clean and curated datasets. However, when deployed in real-life applications, these models encounter noisy user-generated text. That said, the performance of state-of-the-art dense retrievers can substantially deteriorate when exposed to noisy text. In this work, we study the robustness of dense retrievers against typos in the user question. We observe a significant drop in the performance of the dual-encoder model when encountering typos and explore ways to improve its robustness by combining data augmentation with contrastive learning. Our experiments on two large-scale passage ranking and open-domain question answering datasets show that our proposed approach outperforms competing approaches. Additionally, we perform a thorough analysis on robustness. Finally, we provide insights on how different typos affect the robustness of embeddings differently and how our method alleviates the effect of some typos but not of others.

Key facts. Cited by 23 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 May 2022.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 7; 2024: 5; 2025: 6; 2026: 4.

23 papers.

Sort:

By area:

  1. 2025REAL-MM-RAG: A Real-World Multi-Modal Retrieval Benchmarkcited by 35
  2. 2025MoC: Mixtures of Text Chunking Learners for Retrieval-Augmented Generation Systemcited by 19
  3. 2024Meta-Chunking: Learning Text Segmentation and Semantic Completion via Logical Perceptioncited by 17
  4. 2024Robust Neural Information Retrieval: An Adversarial and Out-of-distribution Perspectivecited by 15
  5. 2025Unsupervised Corpus Poisoning Attacks in Continuous Space for Dense Retrievalcited by 11
  6. 2025Investigating the Robustness of Retrieval-Augmented Generation at the Query Levelcited by 11
  7. 2023A Study on FGSM Adversarial Training for Neural Retrievalcited by 10
  8. 2023On the Robustness of Generative Retrieval Models: An Out-of-Distribution Perspectivecited by 8
  9. 2022On the Impact of Speech Recognition Errors in Passage Retrieval for Spoken Question Answeringcited by 6
  10. 2023Typo-Robust Representation Learning for Dense Retrievalcited by 6
  11. 2023Noise-Robust Dense Retrieval via Contrastive Alignment Post Trainingcited by 5
  12. 2024Benchmark Granularity and Model Robustness for Image-Text Retrievalcited by 5
11 more
  1. 2024Investigating Mixture of Experts in Dense Retrievalcited by 4
  2. 2023Defense of Adversarial Ranking Attack in Text Retrieval: Benchmark and Baseline via Detectioncited by 3
  3. 2025Misspellings in Natural Language Processing: A surveycited by 3
  4. 2026How You Ask Matters! Adaptive RAG Robustness to Query Variationscited by 3
  5. 2023LEA: Improving Sentence Similarity Robustness to Typos Using Lexical Attention Biascited by 2
  6. 2024A Multimodal Dense Retrieval Approach for Speech-Based Open-Domain Question Answeringcited by 2
  7. 2025Mixture of Experts Approaches in Dense Retrieval Taskscited by 2
  8. 2023On Monotonic Aggregation for Open-domain QAcited by 1
  9. 2026Evaluating Chunking Strategies For Retrieval-Augmented Generation in Oil and Gas Enterprise Documentscited by 1
  10. 2026On the Robustness of LLM-Based Dense Retrievers: A Systematic Analysis of Generalizability and Stabilitycited by 0
  11. 2026Retrieval Sensitivity to Identity Signals in Queriescited by 0