Know When to Fuse: Investigating Non-English Hybrid Retrieval in the Legal Domain
Not on the map. Why?
Abstract (arXiv)
Hybrid search has emerged as an effective strategy to offset the limitations of different matching paradigms, especially in out-of-domain contexts where notable improvements in retrieval quality have been observed. However, existing research predominantly focuses on a limited set of retrieval methods, evaluated in pairs on domain-general datasets exclusively in English. In this work, we study the efficacy of hybrid search across a variety of prominent retrieval models within the unexplored field of law in the French language, assessing both zero-shot and in-domain scenarios. Our findings reveal that in a zero-shot context, fusing different domain-general models consistently enhances performance compared to using a standalone model, regardless of the fusion method. Surprisingly, when models are trained in-domain, we find that fusion generally diminishes performance relative to using the best single system, unless fusing scores with carefully tuned weights. These novel insights, among others, expand the applicability of prior findings across a new field and language, and contribute to a deeper understanding of hybrid search in non-English specialized domains.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 48 of its 79 references that are in the map. First posted on arXiv 2 Sep 2024.
Builds on
48 of 79 references.
References · 48
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
36 more
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,050
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
- 2019Passage Re-ranking with BERTcited by 629
- 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 464
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
- 2019CamemBERT: a Tasty French Language Modelcited by 368
- 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2019Multi-Stage Document Ranking with BERTcited by 200
- 2019FlauBERT: Unsupervised Language Model Pre-training for Frenchcited by 153
- 2020Pre-training Tasks for Embedding-based Large-scale Retrievalcited by 153
- 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
- 2021mMARCO: A Multilingual Version of the MS MARCO Passage Ranking Datasetcited by 116
- 2019Deeper Text Understanding for IR with Contextual Neural Language Modelingcited by 111
- 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 95
- 2021Rethink Training of BERT Rerankers in Multi-Stage Retrieval Pipelinecited by 65
- 2022An Analysis of Fusion Functions for Hybrid Retrievalcited by 49
- 2018End-to-End Retrieval in Continuous Spacecited by 46
- 2020Minimizing FLOPs to Learn Efficient Sparse Representationscited by 46
- 2020PARADE: Passage Representation Aggregation for Document Rerankingcited by 44
- 2021A Statutory Article Retrieval Dataset in Frenchcited by 40
- 2020BARThez: a Skilled Pretrained French Sequence-to-Sequence Modelcited by 39
- 2021A Replication Study of Dense Passage Retrievercited by 37
- 2020Learning-to-Rank with BERT in TF-Rankingcited by 36
- 2020Leveraging Semantic and Lexical Matching to Improve the Recall of Document Retrieval Systems: A Hybrid Approachcited by 31
- 2021On the Ethical Limits of Natural Language Processing on Legal Textcited by 26
- 2022Out-of-Domain Semantics to the Rescue! Zero-Shot Hybrid Retrieval Modelscited by 26
- 2022Cedille: A large autoregressive French language modelcited by 20
- 2023Explicitly Integrating Judgment Prediction with Legal Document Retrieval: A Law-Guided Generative Approachcited by 14
- 2024STARD: A Chinese Statute Retrieval Dataset with Real Queries Issued by Non-professionalscited by 10
- 2021PAGnol: An Extra-Large French Generative Modelcited by 9
- 2023Data-Efficient French Language Modeling with CamemBERTacited by 8
- 2024CuSINeS: Curriculum-driven Structure Induced Negative Sampling for Statutory Article Retrievalcited by 5
- 2019Threshold-Based Retrieval and Textual Entailment Detection on Legal Bar Exam Questionscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.