rerankers:一个用于统一排序方法的轻量级 Python 库
rerankers: A Lightweight Python Library to Unify Ranking Methods
AI总结:
本文提出轻量级 Python 库 rerankers,将多种重排序方法统一为单一易用接口,支持仅改一行代码切换方法,并通过最少依赖和复用原始实现保证性能不下降。
摘要:
本文介绍了 rerankers,一个 Python 库,它为最常用的重排序方法提供了易于使用的接口。重排序是许多检索流程中不可或缺的组成部分;然而,存在多种依赖不同实现方式的重排序方法。rerankers 将这些方法统一到一个用户友好的接口中,使从业者和研究人员能够仅更改一行 Python 代码即可探索不同的方法。此外,rerankers 确保其实现以尽可能少的依赖完成,并尽可能复用原始实现,从而保证我们简化的接口与更复杂的接口相比不会导致性能下降。完整的源代码和支持的模型列表会定期更新,并可在 https://github.com/answerdotai/rerankers 获取。
英文摘要:
This paper presents rerankers, a Python library which provides an easy-to-use interface to the most commonly used re-ranking approaches. Re-ranking is an integral component of many retrieval pipelines; however, there exist numerous approaches to it, relying on different implementation methods. rerankers unifies these methods into a single user-friendly interface, allowing practitioners and researchers alike to explore different methods while only changing a single line of Python code. Moreover ,rerankers ensures that its implementations are done with the fewest dependencies possible, and re-uses the original implementation whenever possible, guaranteeing that our simplified interface results in no performance degradation compared to more complex ones. The full source code and list of supported models are updated regularly and available at https://github.com/answerdotai/rerankers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。