Views
No views yet
colbert-ir/colbertv1.9colbert (with Hugging Face backbones)ℹ️ ColBERT encodes queries and passages into token-level embedding matrices and usesMaxSimto compute relevance at search time. It typically outperforms single-vector embedding retrievers while remaining scalable.
colbert-ir/colbertv1.9.[qid, pid+, pid-]) using TSV queries.tsv and collection.tsv (IDs + text).NLKI: A lightweight Natural Language Knowledge Integration Framework for Improving Small VLMs in Commonsense VQA Tasks1from colbert.infra import Run, RunConfig, ColBERTConfig
2from colbert import Indexer, Searcher
3from colbert.data import Queries
4
5# 1) Index your collection (pid \t passage)
6with Run().context(RunConfig(nranks=1, experiment="my-exp")):
7 cfg = ColBERTConfig(root="/path/to/experiments")
8 indexer = Indexer(checkpoint="dutta18/Colbert-Finetuned", config=cfg)
9 indexer.index(
10 name="my.index",
11 collection="/path/to/collection.tsv" # "pid \t passage text"
12 )
13
14# 2) Search with queries (qid \t query)
15with Run().context(RunConfig(nranks=1, experiment="my-exp")):
16 cfg = ColBERTConfig(root="/path/to/experiments")
17 searcher = Searcher(index="my.index", config=cfg)
18 queries = Queries("/path/to/queries.tsv") # "qid \t query text"
19 ranking = searcher.search_all(queries, k=20)
20 ranking.save("my.index.top20.tsv")