{
  "definition": "A family of query-evaluation techniques that avoid fully evaluating candidates that cannot affect the desired top-ranked results.",
  "derivedRelations": [
    {
      "target": "block-max-wand",
      "type": "narrower"
    },
    {
      "target": "wand",
      "type": "narrower"
    },
    {
      "target": "splade",
      "type": "related"
    }
  ],
  "id": "dynamic-pruning",
  "kind": "Method",
  "license": "https://creativecommons.org/publicdomain/zero/1.0/",
  "modifiedAt": "2026-09-12T21:39:00Z",
  "prefLabel": "Dynamic Pruning",
  "publisher": {
    "name": "Searchplex",
    "url": "https://searchplex.net/"
  },
  "relations": [
    {
      "target": "block-max-wand",
      "type": "related"
    },
    {
      "target": "learned-sparse-retrieval",
      "type": "related"
    },
    {
      "target": "sparse-retrieval",
      "type": "related"
    },
    {
      "target": "wand",
      "type": "related"
    },
    {
      "target": "weakand",
      "type": "related"
    }
  ],
  "representations": {
    "html": "https://id.searchplex.net/dynamic-pruning/",
    "json": "https://id.searchplex.net/dynamic-pruning.json",
    "jsonld": "https://id.searchplex.net/dynamic-pruning.jsonld"
  },
  "scheme": "https://id.searchplex.net/scheme/",
  "scopeNote": "Dynamic pruning uses score bounds or related statistics to skip unnecessary scoring work while preserving or approximating top-k effectiveness.",
  "status": "published",
  "uri": "https://id.searchplex.net/dynamic-pruning/"
}