Boolean queries are all you need?

• URL: http://arxiv.org/abs/2607.11362v1
• Date: Mon, 13 Jul 2026 10:25:46 GMT
• Title: Boolean queries are all you need?
• Abstract summary: We search the MS MARCO V2.1 deduped segment collection used by the TREC 2024 RAG track.<n>Over a standard track subset of 86 topics, and operating under a budget of 100 model calls/topic, the agent achieved an NDCG@10 of 0.6863.<n> Ranking is based solely on the density of corpuss matching a query, with no requirement for supervised learning, global statistics, or term weights.
• Score: 10.637635718179075
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We equipped an LLM-based search agent with access to a Boolean retrieval engine to search the MS MARCO V2.1 deduped segment collection used by the TREC 2024 RAG track. Over a standard track subset of 86 topics, and operating under a budget of 100 model calls/topic, the agent achieved an NDCG@10 of 0.6863, which would place it above many dense, sparse, and learned-sparse first-stage retrievers. Ranking is based solely on the density of corpus substrings matching a query, with no requirement for supervised learning, global statistics, or term weights. Formally, the query language expresses a strict subset of the regular languages, with a document's score based on the number and length of matches it contains. Although the results are more exploratory than definitive, because they are based on a single test collection that was publicly available during model training, they suggest that simple pattern matching may be sufficient for agentic search.

Related papers

• Q2D-Web: A Large-Scale Benchmark for Retrieval in Agentic RAG Systems [5.118312084290873]
  We introduce Q2D-Web, a large-scale agentic retrieval benchmark consisting of a 190M-document web corpus and 70k agentic search queries in ten languages.<n>We benchmark 13 retrievers including lexical, dense, and late-interaction models and find that their relative ordering is largely insensitive to the choice of judgment set.
  arXiv  Detail & Related papers  (2026-09-08T15:26:05Z)
• text2ql: Multi-Target Natural Language Querying via a Language-Agnostic Intermediate Representation [0.9927219503124457]
  This paper presents text2ql, an open-source Python architecture for natural language interfaces.<n>It addresses three structural limitations of natural language interfaces to databases.<n>It is based on a language-agnostic Intermediate Representation (QueryIR) architecture.
  arXiv  Detail & Related papers  (2026-09-02T05:09:51Z)
• VisDocAgentBench: Benchmarking Agents for Visually Rich Document Retrieval [65.89247522243959]
  VisDocAgentBench is a closed-corpus benchmark comparing static and agentic retrieval under a ranked-output contract.<n>It contains 2,375 pages from 100 documents and 120 unique-target queries balanced across direct, one-bridge, and two-bridge evidence structures.<n>A strong late-interaction visual retriever reaches 97.50% Recall@1 on direct items but 2.50% on two-bridge items, exposing the limits of query--target matching when relevance depends on corpus context.
  arXiv  Detail & Related papers  (2026-08-18T15:23:06Z)
• Search, Inspect, Fetch: Exploiting Structure-Aware Boolean Retrieval for Deep-Research Agents [50.35041517085015]
  Existing deep-research agents use a Search--Visit workflow that retrieves whole webpages without considering the structure they expose through titles, headings, sections, and metadata.<n>We introduce textscSieve, a search--inspect-fetch strategy driven by a Boolean Query Language (BQL)<n>It searches webpage fields to filter candidates, uses an interchangeable ranker to order them, presents structure-rich result cards for inspection, and fetches only selected sections.
  arXiv  Detail & Related papers  (2026-08-03T18:01:05Z)
• GrepSeek: Training Search Agents for Direct Corpus Interaction [66.69568141699311]
  GrepSeek is an optimized direct corpus interaction (DCI) search agent that trains a compact search agent to find, filter, and compose evidence from large text corpora.<n>To make DCI practical at scale, we further use a semantics-preserving sharded-parallel execution engine that accelerates shell-based retrieval by up to $7.6times$ while preserving byte-exact equivalence with sequential execution of the shell command.
  arXiv  Detail & Related papers  (2026-05-28T03:37:33Z)
• Superintelligent Retrieval Agent: The Next Frontier of Information Retrieval [25.731213365755234]
  We introduce textitSuperIntelligent Retrieval Agent (SIRA)<n>SIRA can compress multi-round exploratory search into a single corpus-discriminative retrieval action.<n>It can exceed substantially more expensive multi-round search while remaining interpretable, training-free, and efficient.
  arXiv  Detail & Related papers  (2026-05-07T17:54:29Z)
• LLM-guided Hierarchical Retrieval [54.73080745446999]
  LATTICE is a hierarchical retrieval framework that enables an LLM to reason over and navigate large corpora with logarithmic search complexity.<n>A central challenge in such LLM-guided search is that the model's relevance judgments are noisy, context-dependent, and unaware of the hierarchy.<n>Our framework achieves state-of-the-art zero-shot performance on the reasoning-intensive BRIGHT benchmark.
  arXiv  Detail & Related papers  (2025-10-15T07:05:17Z)
• Leveraging LLMs to Enable Natural Language Search on Go-to-market Platforms [0.23301643766310368]
  We implement and evaluate a solution for the Zoominfo product for sellers, which prompts the Large Language Models with natural language. The intermediary search fields offer numerous advantages for each query, including the elimination of syntax errors. Comprehensive experiments with closed, open source, and fine-tuned LLM models were conducted to demonstrate the efficacy of our approach.
  arXiv  Detail & Related papers  (2024-11-07T03:58:38Z)
• BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval [54.54576644403115]
  We introduce BRIGHT, the first text retrieval benchmark that requires intensive reasoning to retrieve relevant documents.<n>Our dataset consists of 1,384 real-world queries spanning diverse domains, such as economics, psychology, mathematics, and coding.<n>We show that incorporating explicit reasoning about the query improves retrieval performance by up to 12.2 points.
  arXiv  Detail & Related papers  (2024-07-16T17:58:27Z)
• Large Language Models are Strong Zero-Shot Retriever [89.16756291653371]
  We propose a simple method that applies a large language model (LLM) to large-scale retrieval in zero-shot scenarios. Our method, the Language language model as Retriever (LameR), is built upon no other neural models but an LLM.
  arXiv  Detail & Related papers  (2023-04-27T14:45:55Z)
• Acoustic span embeddings for multilingual query-by-example search [20.141444548841047]
  In low- or zero-resource settings, QbE search is often addressed with approaches based on dynamic time warping (DTW) Recent work has found that methods based on acoustic word embeddings (AWEs) can improve both performance and search speed. We generalize AWE training to spans of words, producing acoustic span embeddings (ASE), and explore the application of AWE to arbitrary-length queries in multiple unseen languages.
  arXiv  Detail & Related papers  (2020-11-24T00:28:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.