Passage Retrieval of Polish Texts Using OKAPI BM25 and an Ensemble of Cross Encoders
원문 초록
Passage Retrieval has traditionally relied on lexical methods like TF-IDF and BM25. Recently, some neural network models have surpassed these methods in performance. However, these models face challenges, such as the need for large annotated datasets and adapting to new domains. This paper presents a winning solution to the Poleval 2023 Task 3: Passage Retrieval challenge, which involves retrieving passages of Polish texts in three domains: trivia, legal, and customer support. However, only the trivia domain was used for training and development data. The method used the OKAPI BM25 algorithm to retrieve documents and an ensemble of publicly available multilingual Cross Encoders for Reranking. Fine-tuning the reranker models slightly improved performance but only in the training domain, while it worsened in other domains.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
JointRank: Rank Large Set with Single Pass
Constructing and Evaluating Declarative RAG Pipelines in PyTerrier
Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models
GenKI: Enhancing Open-Domain Question Answering with Knowledge Integration and Controllable Generation in Large Language Models
REARANK: Reasoning Re-ranking Agent via Reinforcement Learning
SARA: Selective and Adaptive Retrieval-augmented Generation with Context Compression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.