@delali/narsil 0.3.1-next.73 → 0.3.1-next.75

package/dist/index.browser.mjs

@@ -209,11 +209,303 @@ function resolveIndexAnalysis(config) {
   };
 }
 
-// src/core/pattern-index/platform.browser.ts
-function platformPatternSearch() {
+// src/core/partition/partial-words/platform.browser.ts
+function platformPartialWordSearch() {
   return null;
 }
 
+// src/core/ordering/code-points.ts
+function exceedsCodePoints(value, maximum) {
+  if (value.length <= maximum) return false;
+  let counted = 0;
+  let i = 0;
+  while (i < value.length) {
+    const unit = value.charCodeAt(i);
+    if (unit >= 55296 && unit < 56320 && i + 1 < value.length) {
+      const low = value.charCodeAt(i + 1);
+      if (low >= 56320 && low < 57344) i++;
+    }
+    i++;
+    counted++;
+    if (counted > maximum) return true;
+  }
+  return false;
+}
+var SURROGATE_UNIT = /[\ud800-\udfff]/;
+function holdsUnpairedSurrogate(value) {
+  if (!SURROGATE_UNIT.test(value)) return false;
+  for (let i = 0; i < value.length; i++) {
+    const unit = value.charCodeAt(i);
+    if (unit < 55296 || unit >= 57344) continue;
+    if (unit >= 56320) return true;
+    const low = value.charCodeAt(i + 1);
+    if (!(low >= 56320 && low < 57344)) return true;
+    i++;
+  }
+  return false;
+}
+function codePointCount(value) {
+  let counted = 0;
+  for (let i = 0; i < value.length; i++) {
+    const unit = value.charCodeAt(i);
+    if (unit >= 55296 && unit < 56320 && i + 1 < value.length) {
+      const low = value.charCodeAt(i + 1);
+      if (low >= 56320 && low < 57344) i++;
+    }
+    counted++;
+  }
+  return counted;
+}
+function adjustUtf16Unit(unit) {
+  if (unit < 55296) return unit;
+  if (unit < 57344) return unit + 8192;
+  return unit - 2048;
+}
+function compareCodePoints(a, b) {
+  const shorter = a.length < b.length ? a.length : b.length;
+  let i = 0;
+  while (i < shorter && a.charCodeAt(i) === b.charCodeAt(i)) i++;
+  if (i === shorter) return a.length - b.length;
+  return adjustUtf16Unit(a.charCodeAt(i)) - adjustUtf16Unit(b.charCodeAt(i));
+}
+
+// src/core/ordering/fold-table.ts
+var SINGLE_FOLDS = "1t,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;2j,lj;b,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;2,w;1,w;1,w;1,w;1,w;1,w;1,w;y,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;4,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-3d;1,1;2,1;2,1;2,-7g;2,5u;1,1;2,1;2,5q;1,1;2,5p;1,5p;1,1;3,27;1,5m;1,5n;1,1;2,5p;1,5r;2,5v;1,5t;1,1;4,5v;1,5x;2,5y;1,1;2,1;2,1;2,62;1,1;2,62;3,1;2,62;1,1;2,61;1,61;1,1;2,1;2,63;1,1;4,1;8,2;1,1;2,2;1,1;2,2;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,2;1,1;2,1;2,-2p;1,-1k;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-3m;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;8,8bv;1,1;2,-4j;1,8bs;3,1;2,-5f;1,1x;1,1z;1,1;2,1;2,1;2,1;2,1;6v,38;17,1;2,1;4,1;9,38;7,12;2,11;1,11;1,11;2,1s;2,1r;1,1r;2,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;2,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;n,1;d,8;1,-u;1,-p;4,-f;1,-m;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-1i;1,-1c;3,-1o;1,-1s;2,1;2,-7;1,1;3,-3m;1,-3m;1,-3m;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1d,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;a,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,f;1,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;28a,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;2,5ls;6,5ls;mj,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1oj,-4su;1,-4st;1,-4sk;1,-4si;1,-4si;1,-4sj;1,-4sc;1,-4ro;1,r7n;1,1;7,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;3,-2bk;1,-2bk;1,-2bk;8x,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;7,-1m;5,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;a,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;b,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;c,-8;2,-8;2,-8;2,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;21,-8;1,-8;1,-22;1,-22;3,-5j9;a,-2e;1,-2e;1,-2e;1,-2e;d,-8;1,-8;1,-2s;1,-2s;d,-8;1,-8;1,-34;1,-34;1,-7;c,-3k;1,-3k;1,-3i;1,-3i;8b,-5st;4,-6gv;1,-6di;7,s;1a,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;k,1;mr,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1f5,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1d,1;2,-8af;1,-2xy;1,-89z;3,1;2,1;2,1;2,-8bg;1,-8al;1,-8bj;1,-8bi;2,1;3,1;9,-8cf;1,-8cf;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;9,1;2,1;5,1;nym,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;k,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3s,1;2,1;2,1;2,1;2,1;2,1;2,1;4,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;b,1;2,1;2,-r9g;1,1;2,1;2,1;2,1;2,1;5,1;2,-wmg;3,1;2,1;4,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-wn8;1,-wnj;1,-wnf;1,-wn5;1,-wn8;2,-wlu;1,-wmi;1,-wlx;1,ps;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-1c;1,-wn7;1,-raw;1,1;2,1;2,-wo7;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-wu9;p,1;or,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;ggy,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;xy,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;3t,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;4d,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;2,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;2,13;1,13;1,13;1,13;1,13;1,13;1,13;2,13;1,13;1d7,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;4e,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;27v,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;gw1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1t,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;o5k,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;";
+var MULTI_FOLDS = "67,37,37;29,2x,lj;p,jg,32;4n,2y,lo;bk,qh,lk,ld;w,qt,lk,ld;d3,12d,136;4y7,2w,mp;1,38,lk;1,3b,lm;1,3d,lm;1,2p,ji;4,37,37;4y,qt,lv;2,qt,lv,lc;2,qt,lv,ld;2,qt,lv,n6;16,64g,qh;1,64h,qh;1,64i,qh;1,64j,qh;1,64k,qh;1,64l,qh;1,64m,qh;1,64n,qh;1,64g,qh;1,64h,qh;1,64i,qh;1,64j,qh;1,64k,qh;1,64l,qh;1,64m,qh;1,64n,qh;1,65c,qh;1,65d,qh;1,65e,qh;1,65f,qh;1,65g,qh;1,65h,qh;1,65i,qh;1,65j,qh;1,65c,qh;1,65d,qh;1,65e,qh;1,65f,qh;1,65g,qh;1,65h,qh;1,65i,qh;1,65j,qh;1,674,qh;1,675,qh;1,676,qh;1,677,qh;1,678,qh;1,679,qh;1,67a,qh;1,67b,qh;1,674,qh;1,675,qh;1,676,qh;1,677,qh;1,678,qh;1,679,qh;1,67a,qh;1,67b,qh;3,67k,qh;1,q9,qh;1,q4,qh;2,q9,n6;1,q9,n6,qh;5,q9,qh;6,67o,qh;1,qf,qh;1,q6,qh;2,qf,n6;1,qf,n6,qh;5,qf,qh;6,qh,lk,lc;1,qh,lk,ld;3,qh,n6;1,qh,lk,n6;b,qt,lk,lc;1,qt,lk,ld;1,qp,lv;2,qt,n6;1,qt,lk,n6;b,67w,qh;1,qx,qh;1,r2,qh;2,qx,n6;1,qx,n6,qh;5,qx,qh;179g,2u,2u;1,2u,2x;1,2u,30;1,2u,2u,2x;1,2u,2u,30;1,37,38;1,37,38;d,12s,12u;1,12s,12d;1,12s,12j;1,132,12u;1,12s,12l;";
+var singleTable = null;
+var multiTable = null;
+function singleFoldTable() {
+  if (singleTable === null) {
+    singleTable = /* @__PURE__ */ new Map();
+    let source = 0;
+    for (const entry of SINGLE_FOLDS.split(";")) {
+      if (entry.length === 0) continue;
+      const [delta, offset] = entry.split(",");
+      source += Number.parseInt(delta, 36);
+      singleTable.set(source, source + Number.parseInt(offset, 36));
+    }
+  }
+  return singleTable;
+}
+function multiFoldTable() {
+  if (multiTable === null) {
+    multiTable = /* @__PURE__ */ new Map();
+    let source = 0;
+    for (const entry of MULTI_FOLDS.split(";")) {
+      if (entry.length === 0) continue;
+      const parts = entry.split(",");
+      source += Number.parseInt(parts[0], 36);
+      multiTable.set(
+        source,
+        parts.slice(1).map((cp) => Number.parseInt(cp, 36))
+      );
+    }
+  }
+  return multiTable;
+}
+
+// src/core/ordering/fold-compare.ts
+var EXHAUSTED = -1;
+function foldOf(codePoint, single, multi) {
+  if (codePoint < 128) return codePoint >= 65 && codePoint <= 90 ? codePoint + 32 : codePoint;
+  return single.get(codePoint) ?? multi.get(codePoint) ?? codePoint;
+}
+function nextFoldedCodePoint(text, cursor, single, multi) {
+  if (cursor.pending !== null) {
+    const cp2 = cursor.pending[cursor.pendingIndex];
+    cursor.pendingIndex++;
+    if (cursor.pendingIndex === cursor.pending.length) {
+      cursor.pending = null;
+      cursor.pendingIndex = 0;
+    }
+    return cp2;
+  }
+  if (cursor.index >= text.length) return EXHAUSTED;
+  let cp = text.charCodeAt(cursor.index);
+  cursor.index++;
+  if (cp >= 55296 && cp < 56320 && cursor.index < text.length) {
+    const low = text.charCodeAt(cursor.index);
+    if (low >= 56320 && low < 57344) {
+      cp = 65536 + (cp - 55296 << 10) + (low - 56320);
+      cursor.index++;
+    }
+  }
+  const folded = foldOf(cp, single, multi);
+  if (typeof folded === "number") return folded;
+  if (folded.length > 1) {
+    cursor.pending = folded;
+    cursor.pendingIndex = 1;
+  }
+  return folded[0];
+}
+function compareCaseFolded(a, b) {
+  const shorter = a.length < b.length ? a.length : b.length;
+  let start = 0;
+  while (start < shorter && a.charCodeAt(start) === b.charCodeAt(start)) start++;
+  if (start === a.length && start === b.length) return 0;
+  if (start > 0) {
+    const previous = a.charCodeAt(start - 1);
+    if (previous >= 55296 && previous < 56320) start--;
+  }
+  const single = singleFoldTable();
+  const multi = multiFoldTable();
+  const aCursor = { index: start, pending: null, pendingIndex: 0 };
+  const bCursor = { index: start, pending: null, pendingIndex: 0 };
+  for (; ; ) {
+    const aCp = nextFoldedCodePoint(a, aCursor, single, multi);
+    const bCp = nextFoldedCodePoint(b, bCursor, single, multi);
+    if (aCp !== bCp) return aCp - bCp;
+    if (aCp === EXHAUSTED) return 0;
+  }
+}
+function compareSortStrings(a, b) {
+  const folded = compareCaseFolded(a, b);
+  if (folded !== 0) return folded;
+  return compareCodePoints(a, b);
+}
+function appendFoldedCodePoint(codePoint, out) {
+  const folded = foldOf(codePoint, singleFoldTable(), multiFoldTable());
+  if (typeof folded === "number") {
+    out.push(folded);
+    return;
+  }
+  for (const foldedCodePoint of folded) out.push(foldedCodePoint);
+}
+function appendFoldedCodePoints(text, out) {
+  const single = singleFoldTable();
+  const multi = multiFoldTable();
+  const cursor = { index: 0, pending: null, pendingIndex: 0 };
+  for (let codePoint = nextFoldedCodePoint(text, cursor, single, multi); codePoint !== EXHAUSTED; ) {
+    out.push(codePoint);
+    codePoint = nextFoldedCodePoint(text, cursor, single, multi);
+  }
+}
+function foldedCodePointCount(text) {
+  const folded = [];
+  appendFoldedCodePoints(text, folded);
+  return folded.length;
+}
+
+// src/core/ordering/constants.ts
+var SORT_VALUE_MAX_CODE_POINTS = 512;
+
+// src/core/ordering/sort-values.ts
+var SORT_MODES = ["min", "max", "avg", "median"];
+function isSortMode(value) {
+  return value === "min" || value === "max" || value === "avg" || value === "median";
+}
+function defaultSortMode(direction) {
+  return direction === "desc" ? "max" : "min";
+}
+function sortModeOf(entry) {
+  return entry.mode ?? defaultSortMode(entry.direction);
+}
+function truncateSortString(value) {
+  if (value.length <= SORT_VALUE_MAX_CODE_POINTS) return value;
+  let index = 0;
+  let counted = 0;
+  while (index < value.length && counted < SORT_VALUE_MAX_CODE_POINTS) {
+    const unit = value.charCodeAt(index);
+    if (unit >= 55296 && unit < 56320 && index + 1 < value.length) {
+      const low = value.charCodeAt(index + 1);
+      if (low >= 56320 && low < 57344) index++;
+    }
+    index++;
+    counted++;
+  }
+  return value.slice(0, index);
+}
+function toComparableSortValue(value) {
+  if (typeof value === "string") return truncateSortString(value);
+  if (typeof value === "number") return Number.isFinite(value) ? value : null;
+  if (typeof value === "boolean") return value;
+  return null;
+}
+function numericReduction(values, mode) {
+  const numbers = [];
+  for (const element of values) {
+    if (typeof element === "number" && Number.isFinite(element)) numbers.push(element);
+  }
+  if (numbers.length === 0) return null;
+  if (mode === "avg") {
+    let mean = 0;
+    for (let index = 0; index < numbers.length; index++) {
+      mean += (numbers[index] - mean) / (index + 1);
+    }
+    return mean;
+  }
+  numbers.sort((a, b) => a - b);
+  const middle = numbers.length >> 1;
+  if (numbers.length % 2 === 1) return numbers[middle];
+  return numbers[middle - 1] / 2 + numbers[middle] / 2;
+}
+function toReducedSortValue(value, mode) {
+  if (!Array.isArray(value)) return toComparableSortValue(value);
+  if (mode === "avg" || mode === "median") return numericReduction(value, mode);
+  let chosen = null;
+  for (const element of value) {
+    const comparable = toComparableSortValue(element);
+    if (comparable === null) continue;
+    if (chosen === null) {
+      chosen = comparable;
+      continue;
+    }
+    const comparison = comparePresentValues(comparable, chosen);
+    if (mode === "min" ? comparison < 0 : comparison > 0) chosen = comparable;
+  }
+  return chosen;
+}
+function readSortField(document2, path) {
+  const segments = path.split(".");
+  let current = document2;
+  for (const segment of segments) {
+    if (current === null || current === void 0 || typeof current !== "object") return void 0;
+    if (!Object.hasOwn(current, segment)) return void 0;
+    current = current[segment];
+  }
+  return current;
+}
+function typeRank(value) {
+  if (typeof value === "number") return 0;
+  if (typeof value === "string") return 1;
+  return 2;
+}
+function comparePresentValues(a, b) {
+  const rankDifference = typeRank(a) - typeRank(b);
+  if (rankDifference !== 0) return rankDifference;
+  if (typeof a === "number" && typeof b === "number") return a - b;
+  if (typeof a === "string" && typeof b === "string") return compareSortStrings(a, b);
+  if (a === b) return 0;
+  return a ? 1 : -1;
+}
+function compareComparableValues(a, b, direction) {
+  if (a === null && b === null) return 0;
+  if (a === null) return 1;
+  if (b === null) return -1;
+  const comparison = comparePresentValues(a, b);
+  if (comparison === 0) return 0;
+  return direction === "desc" ? -comparison : comparison;
+}
+function compareComparableKeys(aKey, bKey, directions) {
+  for (let i = 0; i < directions.length; i++) {
+    const comparison = compareComparableValues(aKey[i] ?? null, bKey[i] ?? null, directions[i]);
+    if (comparison !== 0) return comparison;
+  }
+  return 0;
+}
+function compareSortValues(aValues, bValues, directions) {
+  for (let i = 0; i < directions.length; i++) {
+    const a = toComparableSortValue(aValues[i]);
+    const b = toComparableSortValue(bValues[i]);
+    if (a === null && b === null) continue;
+    if (a === null) return 1;
+    if (b === null) return -1;
+    const comparison = comparePresentValues(a, b);
+    if (comparison !== 0) return directions[i] === "desc" ? -comparison : comparison;
+  }
+  return 0;
+}
+
 // src/schema/constants.ts
 var MAX_NESTING_DEPTH = 4;
 var MAX_DOCUMENT_NESTING_DEPTH = 32;
@@ -477,6 +769,18 @@ function schemaFieldsOf(schema) {
   parsedSchemas.set(schema, frozen);
   return frozen;
 }
+var partialFieldsBySchema = /* @__PURE__ */ new WeakMap();
+function partialFieldsOf(schema) {
+  const cached = partialFieldsBySchema.get(schema);
+  if (cached !== void 0) return cached;
+  const paths = [];
+  for (const field of schemaFieldsOf(schema)) {
+    if (field.partial) paths.push(field.path);
+  }
+  const frozen = Object.freeze(paths.sort(compareCodePoints));
+  partialFieldsBySchema.set(schema, frozen);
+  return frozen;
+}
 function extractVectorFieldsFromSchema(schema) {
   const result = /* @__PURE__ */ new Map();
   for (const field of schemaFieldsOf(schema)) {
@@ -485,10 +789,70 @@ function extractVectorFieldsFromSchema(schema) {
   return result;
 }
 
-// src/core/pattern-index/registry.ts
+// src/core/partition/partial-words/registry.ts
 var registered = null;
+function isPartialWordSearchModule(value) {
+  return value !== null && typeof value === "object" && value.name === "partialWords" && "createGrowingSlot" in value && typeof value.createGrowingSlot === "function" && "createFrozenSlot" in value && typeof value.createFrozenSlot === "function" && "buildTable" in value && typeof value.buildTable === "function" && "expand" in value && typeof value.expand === "function";
+}
+function registerPartialWordSearch(module) {
+  if (!isPartialWordSearchModule(module)) {
+    throw new NarsilError(
+      ErrorCodes.CONFIG_INVALID,
+      'Pass registerPartialWordSearch the partialWordSearch object that "@delali/narsil/partial-words" exports'
+    );
+  }
+  registered = module;
+}
+function availablePartialWordSearch() {
+  return registered ?? platformPartialWordSearch();
+}
+function requirePartialWordSearchFor(schema) {
+  const fields = partialFieldsOf(schema);
+  if (fields.length === 0 || availablePartialWordSearch() !== null) return;
+  throw new NarsilError(
+    ErrorCodes.CONFIG_INVALID,
+    `The type of field "${fields[0]}" includes "partial", but this bundle contains no partial-word search code. Add import { partialWordSearch } from '@delali/narsil/partial-words', then call registerPartialWordSearch(partialWordSearch) before you create or load the index`,
+    { field: fields[0] }
+  );
+}
+var EMPTY_GROWING_SLOT = {
+  readerFor: () => null,
+  spellings: () => null,
+  bytes: () => 0,
+  afterDocument: () => void 0,
+  afterMerge: () => void 0,
+  forgetSpellings: () => void 0,
+  clear: () => void 0
+};
+var EMPTY_FROZEN_SLOT = {
+  readerFor: () => null,
+  spellings: () => null,
+  bytes: () => 0,
+  afterRemoval: () => void 0
+};
+function createGrowingPartialWords(view) {
+  return availablePartialWordSearch()?.createGrowingSlot(view) ?? EMPTY_GROWING_SLOT;
+}
+function createFrozenPartialWords(initial, tokenTable, documents) {
+  return availablePartialWordSearch()?.createFrozenSlot(initial, tokenTable, documents) ?? EMPTY_FROZEN_SLOT;
+}
+function buildPartialWordTableFrom(source, tokenTable) {
+  return availablePartialWordSearch()?.buildTable(source, tokenTable) ?? null;
+}
+function expandPartialWords(subs, analysis, requests) {
+  const module = availablePartialWordSearch();
+  return module === null ? requests.map(() => []) : module.expand(subs, analysis, requests);
+}
+
+// src/core/pattern-index/platform.browser.ts
+function platformPatternSearch() {
+  return null;
+}
+
+// src/core/pattern-index/registry.ts
+var registered2 = null;
 function isPatternSearchModule(value) {
-  return value !== null && typeof value === "object" && value.name === "pattern" && "createIndex" in value && typeof value.createIndex === "function" && "readArrays" in value && typeof value.readArrays === "function" && "mergeArrays" in value && typeof value.mergeArrays === "function" && "matchInto" in value && typeof value.matchInto === "function";
+  return value !== null && typeof value === "object" && value.name === "pattern" && "createIndex" in value && typeof value.createIndex === "function" && "readArrays" in value && typeof value.readArrays === "function" && "mergeArrays" in value && typeof value.mergeArrays === "function" && "matchInto" in value && typeof value.matchInto === "function" && "checkExpression" in value && typeof value.checkExpression === "function" && "expressionFootprint" in value && typeof value.expressionFootprint === "function";
 }
 function registerPatternSearch(module) {
   if (!isPatternSearchModule(module)) {
@@ -497,10 +861,10 @@ function registerPatternSearch(module) {
       'registerPatternSearch takes the patternSearch object that "@delali/narsil/pattern" exports'
     );
   }
-  registered = module;
+  registered2 = module;
 }
 function availablePatternSearch() {
-  return registered ?? platformPatternSearch();
+  return registered2 ?? platformPatternSearch();
 }
 function requirePatternSearchFor(schema) {
   for (const { path, pattern } of schemaFieldsOf(schema)) {
@@ -2268,61 +2632,7 @@ var MATCHER_STATE_OVERHEAD_BYTES = 96;
 var PATTERN_WORK_FLUSH_UNITS = 65536;
 var PATTERN_RUN_CODE_POINTS = 3;
 var PATTERN_TEST_OPERATORS = ["eq", "ne", "in", "nin", "startsWith", "endsWith", "contains"];
-
-// src/core/ordering/code-points.ts
-function exceedsCodePoints(value, maximum) {
-  if (value.length <= maximum) return false;
-  let counted = 0;
-  let i = 0;
-  while (i < value.length) {
-    const unit = value.charCodeAt(i);
-    if (unit >= 55296 && unit < 56320 && i + 1 < value.length) {
-      const low = value.charCodeAt(i + 1);
-      if (low >= 56320 && low < 57344) i++;
-    }
-    i++;
-    counted++;
-    if (counted > maximum) return true;
-  }
-  return false;
-}
-var SURROGATE_UNIT = /[\ud800-\udfff]/;
-function holdsUnpairedSurrogate(value) {
-  if (!SURROGATE_UNIT.test(value)) return false;
-  for (let i = 0; i < value.length; i++) {
-    const unit = value.charCodeAt(i);
-    if (unit < 55296 || unit >= 57344) continue;
-    if (unit >= 56320) return true;
-    const low = value.charCodeAt(i + 1);
-    if (!(low >= 56320 && low < 57344)) return true;
-    i++;
-  }
-  return false;
-}
-function codePointCount(value) {
-  let counted = 0;
-  for (let i = 0; i < value.length; i++) {
-    const unit = value.charCodeAt(i);
-    if (unit >= 55296 && unit < 56320 && i + 1 < value.length) {
-      const low = value.charCodeAt(i + 1);
-      if (low >= 56320 && low < 57344) i++;
-    }
-    counted++;
-  }
-  return counted;
-}
-function adjustUtf16Unit(unit) {
-  if (unit < 55296) return unit;
-  if (unit < 57344) return unit + 8192;
-  return unit - 2048;
-}
-function compareCodePoints(a, b) {
-  const shorter = a.length < b.length ? a.length : b.length;
-  let i = 0;
-  while (i < shorter && a.charCodeAt(i) === b.charCodeAt(i)) i++;
-  if (i === shorter) return a.length - b.length;
-  return adjustUtf16Unit(a.charCodeAt(i)) - adjustUtf16Unit(b.charCodeAt(i));
-}
+var PATTERN_EXPRESSION_OPERATORS = ["wildcard", "regex"];
 
 // src/geo/constants.ts
 var DEG_TO_RAD = Math.PI / 180;
@@ -2845,243 +3155,6 @@ function validateVectorPromotion(config) {
   }
 }
 
-// src/core/ordering/fold-table.ts
-var SINGLE_FOLDS = "1t,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;2j,lj;b,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;2,w;1,w;1,w;1,w;1,w;1,w;1,w;y,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;4,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-3d;1,1;2,1;2,1;2,-7g;2,5u;1,1;2,1;2,5q;1,1;2,5p;1,5p;1,1;3,27;1,5m;1,5n;1,1;2,5p;1,5r;2,5v;1,5t;1,1;4,5v;1,5x;2,5y;1,1;2,1;2,1;2,62;1,1;2,62;3,1;2,62;1,1;2,61;1,61;1,1;2,1;2,63;1,1;4,1;8,2;1,1;2,2;1,1;2,2;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,2;1,1;2,1;2,-2p;1,-1k;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-3m;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;8,8bv;1,1;2,-4j;1,8bs;3,1;2,-5f;1,1x;1,1z;1,1;2,1;2,1;2,1;2,1;6v,38;17,1;2,1;4,1;9,38;7,12;2,11;1,11;1,11;2,1s;2,1r;1,1r;2,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;2,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;n,1;d,8;1,-u;1,-p;4,-f;1,-m;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-1i;1,-1c;3,-1o;1,-1s;2,1;2,-7;1,1;3,-3m;1,-3m;1,-3m;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,28;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1d,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;a,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,f;1,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;28a,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;1,5ls;2,5ls;6,5ls;mj,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1oj,-4su;1,-4st;1,-4sk;1,-4si;1,-4si;1,-4sj;1,-4sc;1,-4ro;1,r7n;1,1;7,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;1,-2bk;3,-2bk;1,-2bk;1,-2bk;8x,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;7,-1m;5,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;a,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;b,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;c,-8;2,-8;2,-8;2,-8;9,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;1,-8;21,-8;1,-8;1,-22;1,-22;3,-5j9;a,-2e;1,-2e;1,-2e;1,-2e;d,-8;1,-8;1,-2s;1,-2s;d,-8;1,-8;1,-34;1,-34;1,-7;c,-3k;1,-3k;1,-3i;1,-3i;8b,-5st;4,-6gv;1,-6di;7,s;1a,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;1,g;k,1;mr,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1,q;1f5,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1,1c;1d,1;2,-8af;1,-2xy;1,-89z;3,1;2,1;2,1;2,-8bg;1,-8al;1,-8bj;1,-8bi;2,1;3,1;9,-8cf;1,-8cf;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;9,1;2,1;5,1;nym,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;k,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;3s,1;2,1;2,1;2,1;2,1;2,1;2,1;4,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;b,1;2,1;2,-r9g;1,1;2,1;2,1;2,1;2,1;5,1;2,-wmg;3,1;2,1;4,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-wn8;1,-wnj;1,-wnf;1,-wn5;1,-wn8;2,-wlu;1,-wmi;1,-wlx;1,ps;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-1c;1,-wn7;1,-raw;1,1;2,1;2,-wo7;1,1;2,1;2,1;2,1;2,1;2,1;2,1;2,1;2,-wu9;p,1;or,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;1,-tzk;ggy,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;xy,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;3t,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;1,14;4d,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;2,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;1,13;2,13;1,13;1,13;1,13;1,13;1,13;1,13;2,13;1,13;1d7,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;1,1s;4e,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;27v,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;gw1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1,w;1t,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;1,r;o5k,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;1,y;";
-var MULTI_FOLDS = "67,37,37;29,2x,lj;p,jg,32;4n,2y,lo;bk,qh,lk,ld;w,qt,lk,ld;d3,12d,136;4y7,2w,mp;1,38,lk;1,3b,lm;1,3d,lm;1,2p,ji;4,37,37;4y,qt,lv;2,qt,lv,lc;2,qt,lv,ld;2,qt,lv,n6;16,64g,qh;1,64h,qh;1,64i,qh;1,64j,qh;1,64k,qh;1,64l,qh;1,64m,qh;1,64n,qh;1,64g,qh;1,64h,qh;1,64i,qh;1,64j,qh;1,64k,qh;1,64l,qh;1,64m,qh;1,64n,qh;1,65c,qh;1,65d,qh;1,65e,qh;1,65f,qh;1,65g,qh;1,65h,qh;1,65i,qh;1,65j,qh;1,65c,qh;1,65d,qh;1,65e,qh;1,65f,qh;1,65g,qh;1,65h,qh;1,65i,qh;1,65j,qh;1,674,qh;1,675,qh;1,676,qh;1,677,qh;1,678,qh;1,679,qh;1,67a,qh;1,67b,qh;1,674,qh;1,675,qh;1,676,qh;1,677,qh;1,678,qh;1,679,qh;1,67a,qh;1,67b,qh;3,67k,qh;1,q9,qh;1,q4,qh;2,q9,n6;1,q9,n6,qh;5,q9,qh;6,67o,qh;1,qf,qh;1,q6,qh;2,qf,n6;1,qf,n6,qh;5,qf,qh;6,qh,lk,lc;1,qh,lk,ld;3,qh,n6;1,qh,lk,n6;b,qt,lk,lc;1,qt,lk,ld;1,qp,lv;2,qt,n6;1,qt,lk,n6;b,67w,qh;1,qx,qh;1,r2,qh;2,qx,n6;1,qx,n6,qh;5,qx,qh;179g,2u,2u;1,2u,2x;1,2u,30;1,2u,2u,2x;1,2u,2u,30;1,37,38;1,37,38;d,12s,12u;1,12s,12d;1,12s,12j;1,132,12u;1,12s,12l;";
-var singleTable = null;
-var multiTable = null;
-function singleFoldTable() {
-  if (singleTable === null) {
-    singleTable = /* @__PURE__ */ new Map();
-    let source = 0;
-    for (const entry of SINGLE_FOLDS.split(";")) {
-      if (entry.length === 0) continue;
-      const [delta, offset] = entry.split(",");
-      source += Number.parseInt(delta, 36);
-      singleTable.set(source, source + Number.parseInt(offset, 36));
-    }
-  }
-  return singleTable;
-}
-function multiFoldTable() {
-  if (multiTable === null) {
-    multiTable = /* @__PURE__ */ new Map();
-    let source = 0;
-    for (const entry of MULTI_FOLDS.split(";")) {
-      if (entry.length === 0) continue;
-      const parts = entry.split(",");
-      source += Number.parseInt(parts[0], 36);
-      multiTable.set(
-        source,
-        parts.slice(1).map((cp) => Number.parseInt(cp, 36))
-      );
-    }
-  }
-  return multiTable;
-}
-
-// src/core/ordering/fold-compare.ts
-var EXHAUSTED = -1;
-function foldOf(codePoint, single, multi) {
-  if (codePoint < 128) return codePoint >= 65 && codePoint <= 90 ? codePoint + 32 : codePoint;
-  return single.get(codePoint) ?? multi.get(codePoint) ?? codePoint;
-}
-function nextFoldedCodePoint(text, cursor, single, multi) {
-  if (cursor.pending !== null) {
-    const cp2 = cursor.pending[cursor.pendingIndex];
-    cursor.pendingIndex++;
-    if (cursor.pendingIndex === cursor.pending.length) {
-      cursor.pending = null;
-      cursor.pendingIndex = 0;
-    }
-    return cp2;
-  }
-  if (cursor.index >= text.length) return EXHAUSTED;
-  let cp = text.charCodeAt(cursor.index);
-  cursor.index++;
-  if (cp >= 55296 && cp < 56320 && cursor.index < text.length) {
-    const low = text.charCodeAt(cursor.index);
-    if (low >= 56320 && low < 57344) {
-      cp = 65536 + (cp - 55296 << 10) + (low - 56320);
-      cursor.index++;
-    }
-  }
-  const folded = foldOf(cp, single, multi);
-  if (typeof folded === "number") return folded;
-  if (folded.length > 1) {
-    cursor.pending = folded;
-    cursor.pendingIndex = 1;
-  }
-  return folded[0];
-}
-function compareCaseFolded(a, b) {
-  const shorter = a.length < b.length ? a.length : b.length;
-  let start = 0;
-  while (start < shorter && a.charCodeAt(start) === b.charCodeAt(start)) start++;
-  if (start === a.length && start === b.length) return 0;
-  if (start > 0) {
-    const previous = a.charCodeAt(start - 1);
-    if (previous >= 55296 && previous < 56320) start--;
-  }
-  const single = singleFoldTable();
-  const multi = multiFoldTable();
-  const aCursor = { index: start, pending: null, pendingIndex: 0 };
-  const bCursor = { index: start, pending: null, pendingIndex: 0 };
-  for (; ; ) {
-    const aCp = nextFoldedCodePoint(a, aCursor, single, multi);
-    const bCp = nextFoldedCodePoint(b, bCursor, single, multi);
-    if (aCp !== bCp) return aCp - bCp;
-    if (aCp === EXHAUSTED) return 0;
-  }
-}
-function compareSortStrings(a, b) {
-  const folded = compareCaseFolded(a, b);
-  if (folded !== 0) return folded;
-  return compareCodePoints(a, b);
-}
-function appendFoldedCodePoint(codePoint, out) {
-  const folded = foldOf(codePoint, singleFoldTable(), multiFoldTable());
-  if (typeof folded === "number") {
-    out.push(folded);
-    return;
-  }
-  for (const foldedCodePoint of folded) out.push(foldedCodePoint);
-}
-function appendFoldedCodePoints(text, out) {
-  const single = singleFoldTable();
-  const multi = multiFoldTable();
-  const cursor = { index: 0, pending: null, pendingIndex: 0 };
-  for (let codePoint = nextFoldedCodePoint(text, cursor, single, multi); codePoint !== EXHAUSTED; ) {
-    out.push(codePoint);
-    codePoint = nextFoldedCodePoint(text, cursor, single, multi);
-  }
-}
-function foldedCodePointCount(text) {
-  const folded = [];
-  appendFoldedCodePoints(text, folded);
-  return folded.length;
-}
-
-// src/core/ordering/constants.ts
-var SORT_VALUE_MAX_CODE_POINTS = 512;
-
-// src/core/ordering/sort-values.ts
-var SORT_MODES = ["min", "max", "avg", "median"];
-function isSortMode(value) {
-  return value === "min" || value === "max" || value === "avg" || value === "median";
-}
-function defaultSortMode(direction) {
-  return direction === "desc" ? "max" : "min";
-}
-function sortModeOf(entry) {
-  return entry.mode ?? defaultSortMode(entry.direction);
-}
-function truncateSortString(value) {
-  if (value.length <= SORT_VALUE_MAX_CODE_POINTS) return value;
-  let index = 0;
-  let counted = 0;
-  while (index < value.length && counted < SORT_VALUE_MAX_CODE_POINTS) {
-    const unit = value.charCodeAt(index);
-    if (unit >= 55296 && unit < 56320 && index + 1 < value.length) {
-      const low = value.charCodeAt(index + 1);
-      if (low >= 56320 && low < 57344) index++;
-    }
-    index++;
-    counted++;
-  }
-  return value.slice(0, index);
-}
-function toComparableSortValue(value) {
-  if (typeof value === "string") return truncateSortString(value);
-  if (typeof value === "number") return Number.isFinite(value) ? value : null;
-  if (typeof value === "boolean") return value;
-  return null;
-}
-function numericReduction(values, mode) {
-  const numbers = [];
-  for (const element of values) {
-    if (typeof element === "number" && Number.isFinite(element)) numbers.push(element);
-  }
-  if (numbers.length === 0) return null;
-  if (mode === "avg") {
-    let mean = 0;
-    for (let index = 0; index < numbers.length; index++) {
-      mean += (numbers[index] - mean) / (index + 1);
-    }
-    return mean;
-  }
-  numbers.sort((a, b) => a - b);
-  const middle = numbers.length >> 1;
-  if (numbers.length % 2 === 1) return numbers[middle];
-  return numbers[middle - 1] / 2 + numbers[middle] / 2;
-}
-function toReducedSortValue(value, mode) {
-  if (!Array.isArray(value)) return toComparableSortValue(value);
-  if (mode === "avg" || mode === "median") return numericReduction(value, mode);
-  let chosen = null;
-  for (const element of value) {
-    const comparable = toComparableSortValue(element);
-    if (comparable === null) continue;
-    if (chosen === null) {
-      chosen = comparable;
-      continue;
-    }
-    const comparison = comparePresentValues(comparable, chosen);
-    if (mode === "min" ? comparison < 0 : comparison > 0) chosen = comparable;
-  }
-  return chosen;
-}
-function readSortField(document2, path) {
-  const segments = path.split(".");
-  let current = document2;
-  for (const segment of segments) {
-    if (current === null || current === void 0 || typeof current !== "object") return void 0;
-    if (!Object.hasOwn(current, segment)) return void 0;
-    current = current[segment];
-  }
-  return current;
-}
-function typeRank(value) {
-  if (typeof value === "number") return 0;
-  if (typeof value === "string") return 1;
-  return 2;
-}
-function comparePresentValues(a, b) {
-  const rankDifference = typeRank(a) - typeRank(b);
-  if (rankDifference !== 0) return rankDifference;
-  if (typeof a === "number" && typeof b === "number") return a - b;
-  if (typeof a === "string" && typeof b === "string") return compareSortStrings(a, b);
-  if (a === b) return 0;
-  return a ? 1 : -1;
-}
-function compareComparableValues(a, b, direction) {
-  if (a === null && b === null) return 0;
-  if (a === null) return 1;
-  if (b === null) return -1;
-  const comparison = comparePresentValues(a, b);
-  if (comparison === 0) return 0;
-  return direction === "desc" ? -comparison : comparison;
-}
-function compareComparableKeys(aKey, bKey, directions) {
-  for (let i = 0; i < directions.length; i++) {
-    const comparison = compareComparableValues(aKey[i] ?? null, bKey[i] ?? null, directions[i]);
-    if (comparison !== 0) return comparison;
-  }
-  return 0;
-}
-function compareSortValues(aValues, bValues, directions) {
-  for (let i = 0; i < directions.length; i++) {
-    const a = toComparableSortValue(aValues[i]);
-    const b = toComparableSortValue(bValues[i]);
-    if (a === null && b === null) continue;
-    if (a === null) return 1;
-    if (b === null) return -1;
-    const comparison = comparePresentValues(a, b);
-    if (comparison !== 0) return directions[i] === "desc" ? -comparison : comparison;
-  }
-  return 0;
-}
-
 // src/core/document-store.ts
 function detachedView(view) {
   if (view.byteOffset === 0 && view.byteLength === view.buffer.byteLength) return view;
@@ -3436,8 +3509,6 @@ function compactList(list) {
         }
       }
       writeIdx++;
-    } else {
-      list.totalTermFrequency -= list.termFrequencies[i];
     }
   }
   list.docIds.length = writeIdx;
@@ -3462,8 +3533,6 @@ function compactDocEntries(list, internalId) {
         }
       }
       writeIdx++;
-    } else {
-      list.totalTermFrequency -= list.termFrequencies[i];
     }
   }
   list.docIds.length = writeIdx;
@@ -3549,12 +3618,13 @@ function createInvertedIndex(fieldNameTable) {
       }
       list.length++;
     },
-    remove(token, internalId) {
+    remove(token, internalId, occurrences) {
       const list = index.get(token);
       if (!list || !list.docIdSet.has(internalId)) return;
       list.structureRevision++;
       list.docIdSet.delete(internalId);
       list.deletedDocs.add(internalId);
+      list.totalTermFrequency = Math.max(0, list.totalTermFrequency - occurrences);
       if (list.docIdSet.size === 0) {
         index.delete(token);
         untrackToken(token);
@@ -3587,6 +3657,9 @@ function createInvertedIndex(fieldNameTable) {
     lookup(token) {
       return index.get(token);
     },
+    documentFrequency(token) {
+      return index.get(token)?.docIdSet.size ?? 0;
+    },
     fuzzyLookup(token, tolerance, prefixLength) {
       if (tolerance === 0) {
         const exact = index.get(token);
@@ -4334,7 +4407,24 @@ function computeFacets(state, matched, config, schema) {
 }
 
 // src/core/pattern-index/host.ts
-var PATTERN_HOST = { appendFoldedCodePoint };
+var NO_SOURCES = [];
+var foldSources = null;
+function sourcesByFold() {
+  if (foldSources !== null) return foldSources;
+  const sources = /* @__PURE__ */ new Map();
+  const add = (source, folded) => {
+    const known = sources.get(folded);
+    if (known === void 0) sources.set(folded, [source]);
+    else known.push(source);
+  };
+  for (const [source, folded] of singleFoldTable()) add(source, folded);
+  foldSources = sources;
+  return sources;
+}
+function singleFoldSources(folded) {
+  return sourcesByFold().get(folded) ?? NO_SOURCES;
+}
+var PATTERN_HOST = { appendFoldedCodePoint, singleFoldSources };
 function patternIndexOf(indexes, fieldPath) {
   let index = indexes.get(fieldPath);
   if (index === void 0) {
@@ -5177,6 +5267,53 @@ function createNumericIndex() {
   };
 }
 
+// src/core/partition/partial-words/spellings.ts
+function countSpelling(counts, token, spelling, change) {
+  let byToken = counts.get(token);
+  if (byToken === void 0) {
+    byToken = /* @__PURE__ */ new Map();
+    counts.set(token, byToken);
+  }
+  const next = (byToken.get(spelling) ?? 0) + change;
+  if (next > 0) {
+    byToken.set(spelling, next);
+    return;
+  }
+  byToken.delete(spelling);
+  if (byToken.size === 0) counts.delete(token);
+}
+function textsOf(value) {
+  if (typeof value === "string") return [value];
+  if (!Array.isArray(value)) return [];
+  return value.filter((element) => typeof element === "string");
+}
+function countDocumentSpellings(counts, document2, analysis, direction) {
+  const tokenizing = { ...tokenizeOptions(analysis.options), collectSurfaces: true };
+  for (const field of analysis.fields) {
+    for (const text of textsOf(getNestedValue(document2, field))) {
+      for (const occurrence of tokenizeIterator(text, analysis.language, tokenizing)) {
+        countSpelling(counts, occurrence.token, occurrence.surface ?? occurrence.token, direction);
+      }
+    }
+  }
+}
+function spellingCountsOf(documents, analysis) {
+  const counts = /* @__PURE__ */ new Map();
+  for (const document2 of documents) countDocumentSpellings(counts, document2, analysis, 1);
+  return counts;
+}
+function encodePartialSpellings(fields, counts) {
+  const encoded = { fields: [...fields], tokens: [], spellings: [], counts: [] };
+  for (const [token, byToken] of counts) {
+    for (const [spelling, count] of byToken) {
+      encoded.tokens.push(token);
+      encoded.spellings.push(spelling);
+      encoded.counts.push(count);
+    }
+  }
+  return encoded;
+}
+
 // src/core/partition/value-sizes.ts
 function keepsValueSize(base) {
   return base === "string" || base === "verbatim" || base.endsWith("[]");
@@ -5250,6 +5387,13 @@ function resolveInternalId(state, docId) {
   }
   return internalId;
 }
+function emptyIndexedText(fields) {
+  const holdsPartialField = fields.some((field) => field.partial);
+  return { fieldLengths: {}, tokensByField: {}, partialSpellings: holdsPartialField ? /* @__PURE__ */ new Map() : null };
+}
+function partialSpellingsFor(field, indexed) {
+  return field.partial ? indexed.partialSpellings : null;
+}
 function countSurface(counts, surface, token) {
   if (surface === void 0 || surface.length === 0) return;
   const existing = counts.get(surface);
@@ -5259,6 +5403,18 @@ function countSurface(counts, surface, token) {
     counts.set(surface, { token, count: 1 });
   }
 }
+function countOccurrence(counts, spellings, surface, token) {
+  countSurface(counts, surface, token);
+  if (spellings !== null) countSpelling(spellings, token, surface ?? token, 1);
+}
+function addFieldOccurrences(occurrencesByToken, fieldTokens) {
+  const fieldCounts = /* @__PURE__ */ new Map();
+  for (const token of fieldTokens) fieldCounts.set(token, (fieldCounts.get(token) ?? 0) + 1);
+  for (const [token, count] of fieldCounts) {
+    const stored = count > MAX_TERM_FREQUENCY ? MAX_TERM_FREQUENCY : count;
+    occurrencesByToken.set(token, (occurrencesByToken.get(token) ?? 0) + stored);
+  }
+}
 function applySurfaceCounts(state, counts, direction) {
   for (const [surface, entry] of counts) {
     if (direction === 1) {
@@ -5268,7 +5424,7 @@ function applySurfaceCounts(state, counts, direction) {
     }
   }
 }
-function indexStringField(state, internalId, fieldPath, text, language, options, fieldLengths, tokensByField) {
+function indexStringField(state, internalId, fieldPath, text, language, options, fieldLengths, tokensByField, spellings = null) {
   const fieldTokenList = [];
   const fieldNameIndex2 = getOrCreateFieldNameIndex(state.fieldNameTable, fieldPath);
   const opts = tokenizeOptions(options);
@@ -5284,7 +5440,7 @@ function indexStringField(state, internalId, fieldPath, text, language, options,
         tokenFreqs.set(t.token, { count: 1, positions: [t.position] });
       }
       fieldTokenList.push(t.token);
-      countSurface(surfaceCounts, t.surface, t.token);
+      countOccurrence(surfaceCounts, spellings, t.surface, t.token);
     }
     for (const [token, freq] of tokenFreqs) {
       state.invertedIdx.insert(token, internalId, freq.count, fieldNameIndex2, freq.positions);
@@ -5294,7 +5450,7 @@ function indexStringField(state, internalId, fieldPath, text, language, options,
     for (const t of tokenizeIterator(text, language, opts)) {
       tokenCounts.set(t.token, (tokenCounts.get(t.token) ?? 0) + 1);
       fieldTokenList.push(t.token);
-      countSurface(surfaceCounts, t.surface, t.token);
+      countOccurrence(surfaceCounts, spellings, t.surface, t.token);
     }
     for (const [token, count] of tokenCounts) {
       state.invertedIdx.insert(token, internalId, count, fieldNameIndex2, null);
@@ -5304,7 +5460,7 @@ function indexStringField(state, internalId, fieldPath, text, language, options,
   fieldLengths[fieldPath] = fieldTokenList.length;
   tokensByField[fieldPath] = fieldTokenList;
 }
-function indexStringArrayField(state, internalId, fieldPath, arr, language, options, fieldLengths, tokensByField) {
+function indexStringArrayField(state, internalId, fieldPath, arr, language, options, fieldLengths, tokensByField, spellings = null) {
   const fieldTokenList = [];
   const fieldNameIndex2 = getOrCreateFieldNameIndex(state.fieldNameTable, fieldPath);
   const opts = tokenizeOptions(options);
@@ -5323,7 +5479,7 @@ function indexStringArrayField(state, internalId, fieldPath, arr, language, opti
           tokenFreqs.set(t.token, { count: 1, positions: [positionOffset + t.position] });
         }
         fieldTokenList.push(t.token);
-        countSurface(surfaceCounts, t.surface, t.token);
+        countOccurrence(surfaceCounts, spellings, t.surface, t.token);
         itemTokenCount++;
       }
       positionOffset += itemTokenCount;
@@ -5338,7 +5494,7 @@ function indexStringArrayField(state, internalId, fieldPath, arr, language, opti
       for (const t of tokenizeIterator(item, language, opts)) {
         tokenCounts.set(t.token, (tokenCounts.get(t.token) ?? 0) + 1);
         fieldTokenList.push(t.token);
-        countSurface(surfaceCounts, t.surface, t.token);
+        countOccurrence(surfaceCounts, spellings, t.surface, t.token);
       }
     }
     fieldLengths[fieldPath] = fieldTokenList.length;
@@ -5350,17 +5506,28 @@ function indexStringArrayField(state, internalId, fieldPath, arr, language, opti
   tokensByField[fieldPath] = fieldTokenList;
 }
 function indexDocument(state, docId, document2, fields, language, options) {
-  const fieldLengths = {};
-  const tokensByField = {};
+  const indexed = emptyIndexedText(fields);
+  const { fieldLengths, tokensByField } = indexed;
   const internalId = resolveInternalId(state, docId);
-  for (const { path: fieldPath, base, pattern } of fields) {
+  for (const field of fields) {
+    const { path: fieldPath, base, pattern } = field;
     const value = getNestedValue(document2, fieldPath);
     if (value === void 0 || value === null) continue;
     recordValueSize(state.sizeIndexes, internalId, fieldPath, base, value);
     ensureFieldIndex(state, fieldPath, base);
     if (pattern) patternIndexOf(state.patternIndexes, fieldPath).add(internalId, value);
     if (base === "string") {
-      indexStringField(state, internalId, fieldPath, value, language, options, fieldLengths, tokensByField);
+      indexStringField(
+        state,
+        internalId,
+        fieldPath,
+        value,
+        language,
+        options,
+        fieldLengths,
+        tokensByField,
+        partialSpellingsFor(field, indexed)
+      );
     } else if (base === "number") {
       getOrCreateNumericIndex(state, fieldPath).insert(internalId, value);
     } else if (base === "boolean") {
@@ -5379,7 +5546,8 @@ function indexDocument(state, docId, document2, fields, language, options) {
         language,
         options,
         fieldLengths,
-        tokensByField
+        tokensByField,
+        partialSpellingsFor(field, indexed)
       );
     } else if (base === "number[]") {
       const numIdx = getOrCreateNumericIndex(state, fieldPath);
@@ -5394,15 +5562,17 @@ function indexDocument(state, docId, document2, fields, language, options) {
       }
     }
   }
-  return { fieldLengths, tokensByField };
+  return indexed;
 }
 function removeFromIndexes(state, docId, storedDoc, schemaFields, language, options) {
-  const fieldLengths = {};
-  const tokensByField = {};
+  const removed = emptyIndexedText(schemaFields);
+  const { fieldLengths, tokensByField } = removed;
   const fields = storedDoc.fields;
   const internalId = resolveInternalId(state, docId);
   const opts = tokenizeOptions(options);
-  for (const { path: fieldPath, base, pattern } of schemaFields) {
+  const occurrencesByToken = /* @__PURE__ */ new Map();
+  for (const field of schemaFields) {
+    const { path: fieldPath, base, pattern } = field;
     const value = getNestedValue(fields, fieldPath);
     if (value === void 0 || value === null) continue;
     forgetValueSize(state.sizeIndexes, internalId, fieldPath, base, value);
@@ -5410,16 +5580,15 @@ function removeFromIndexes(state, docId, storedDoc, schemaFields, language, opti
     if (base === "string") {
       const result = tokenize(value, language, opts);
       fieldLengths[fieldPath] = result.tokens.length;
-      const uniqueTokens = /* @__PURE__ */ new Set();
       const fieldTokenList = [];
       const surfaceCounts = /* @__PURE__ */ new Map();
+      const spellings = partialSpellingsFor(field, removed);
       for (let i = 0; i < result.tokens.length; i++) {
         const t = result.tokens[i];
-        uniqueTokens.add(t.token);
         fieldTokenList.push(t.token);
-        countSurface(surfaceCounts, result.surfaces?.[i], t.token);
+        countOccurrence(surfaceCounts, spellings, result.surfaces?.[i], t.token);
       }
-      for (const token of uniqueTokens) state.invertedIdx.remove(token, internalId);
+      addFieldOccurrences(occurrencesByToken, fieldTokenList);
       applySurfaceCounts(state, surfaceCounts, -1);
       tokensByField[fieldPath] = fieldTokenList;
     } else if (base === "number") {
@@ -5432,20 +5601,19 @@ function removeFromIndexes(state, docId, storedDoc, schemaFields, language, opti
       state.geoIndexes.get(fieldPath)?.remove(internalId);
     } else if (base === "string[]") {
       const arr = value;
-      const uniqueTokens = /* @__PURE__ */ new Set();
       const fieldTokenList = [];
       const surfaceCounts = /* @__PURE__ */ new Map();
+      const spellings = partialSpellingsFor(field, removed);
       for (const item of arr) {
         const result = tokenize(item, language, opts);
         for (let i = 0; i < result.tokens.length; i++) {
           const t = result.tokens[i];
-          uniqueTokens.add(t.token);
           fieldTokenList.push(t.token);
-          countSurface(surfaceCounts, result.surfaces?.[i], t.token);
+          countOccurrence(surfaceCounts, spellings, result.surfaces?.[i], t.token);
         }
       }
       fieldLengths[fieldPath] = fieldTokenList.length;
-      for (const token of uniqueTokens) state.invertedIdx.remove(token, internalId);
+      addFieldOccurrences(occurrencesByToken, fieldTokenList);
       applySurfaceCounts(state, surfaceCounts, -1);
       tokensByField[fieldPath] = fieldTokenList;
     } else if (base === "number[]") {
@@ -5465,7 +5633,8 @@ function removeFromIndexes(state, docId, storedDoc, schemaFields, language, opti
       }
     }
   }
-  return { fieldLengths, tokensByField };
+  for (const [token, occurrences] of occurrencesByToken) state.invertedIdx.remove(token, internalId, occurrences);
+  return removed;
 }
 
 // src/core/partition/field-updates.ts
@@ -5568,7 +5737,7 @@ function excluding(context, fieldPath, excluded) {
   const universe = bitsetAnd(context.presentBitset(fieldPath), context.allDocIdsBitset);
   return bitsetAnd(universe, bitsetNot(excluded, context.capacity));
 }
-function textsOf(operand) {
+function textsOf2(operand) {
   const texts = /* @__PURE__ */ new Set();
   if (!Array.isArray(operand)) return texts;
   for (const text of operand) if (typeof text === "string") texts.add(text);
@@ -5583,11 +5752,13 @@ function evaluatePatternTests(fieldPath, filter, context, bitsets) {
   };
   if (typeof filter.eq === "string") bitsets.push(matching("eq", [filter.eq]));
   if (typeof filter.ne === "string") bitsets.push(excluding(context, fieldPath, matching("eq", [filter.ne])));
-  if (filter.in !== void 0) bitsets.push(matching("eq", textsOf(filter.in)));
-  if (filter.nin !== void 0) bitsets.push(excluding(context, fieldPath, matching("eq", textsOf(filter.nin))));
+  if (filter.in !== void 0) bitsets.push(matching("eq", textsOf2(filter.in)));
+  if (filter.nin !== void 0) bitsets.push(excluding(context, fieldPath, matching("eq", textsOf2(filter.nin))));
   if (typeof filter.startsWith === "string") bitsets.push(matching("startsWith", [filter.startsWith]));
   if (typeof filter.endsWith === "string") bitsets.push(matching("endsWith", [filter.endsWith]));
   if (typeof filter.contains === "string") bitsets.push(matching("contains", [filter.contains]));
+  if (typeof filter.wildcard === "string") bitsets.push(matching("wildcard", [filter.wildcard]));
+  if (typeof filter.regex === "string") bitsets.push(matching("regex", [filter.regex]));
 }
 
 // src/filters/field-tests.ts
@@ -5792,6 +5963,8 @@ var FIELD_FILTER_OPERATORS = [
   "startsWith",
   "endsWith",
   "contains",
+  "wildcard",
+  "regex",
   "caseFold",
   "containsAll",
   "matchesAny",
@@ -6007,14 +6180,16 @@ function requirePatternField(fieldPath, operator, type) {
     operator
   );
 }
+function requireTextLength(fieldPath, operator, text) {
+  if (!exceedsCodePoints(text, MAX_PATTERN_TEXT_CODE_POINTS)) return;
+  invalid(
+    `The text of "${operator}" on pattern field "${fieldPath}" holds more than ${MAX_PATTERN_TEXT_CODE_POINTS} code points`,
+    fieldPath,
+    operator
+  );
+}
 function requirePatternText(fieldPath, operator, text, caseFold) {
-  if (exceedsCodePoints(text, MAX_PATTERN_TEXT_CODE_POINTS)) {
-    invalid(
-      `The text of "${operator}" on pattern field "${fieldPath}" holds more than ${MAX_PATTERN_TEXT_CODE_POINTS} code points`,
-      fieldPath,
-      operator
-    );
-  }
+  requireTextLength(fieldPath, operator, text);
   if (caseFold && foldedCodePointCount(text) > MAX_PATTERN_POSITIONS) {
     invalid(
       `The text of "${operator}" on pattern field "${fieldPath}" has a case fold of more than ${MAX_PATTERN_POSITIONS} code points, while a pattern holds at most ${MAX_PATTERN_POSITIONS} positions`,
@@ -6024,6 +6199,23 @@ function requirePatternText(fieldPath, operator, text, caseFold) {
   }
 }
 var ELEMENT_OPERATORS2 = ["matchesAny", "containsAll"];
+function requireExpressions(fieldPath, filter, type) {
+  for (const operator of PATTERN_EXPRESSION_OPERATORS) {
+    const pattern = filter[operator];
+    if (pattern === void 0) continue;
+    if (typeof pattern !== "string")
+      invalid(`"${operator}" on field "${fieldPath}" must be a string`, fieldPath, operator);
+    requirePatternField(fieldPath, operator, type);
+    requireTextLength(fieldPath, operator, pattern);
+    requirePatternSearch(fieldPath).checkExpression(
+      operator,
+      pattern,
+      filter.caseFold === true,
+      fieldPath,
+      PATTERN_HOST
+    );
+  }
+}
 function requirePatternOperands(fieldPath, filter, type) {
   if (filter.contains !== void 0) {
     if (typeof filter.contains !== "string") {
@@ -6037,6 +6229,7 @@ function requirePatternOperands(fieldPath, filter, type) {
     }
     requirePatternField(fieldPath, "caseFold", type);
   }
+  requireExpressions(fieldPath, filter, type);
   if (parsedTypeOf(type)?.pattern !== true) return;
   const caseFold = filter.caseFold === true;
   for (const operator of PATTERN_TEST_OPERATORS) {
@@ -7016,6 +7209,67 @@ function partitionFilterMatches(state, filters, schema, meter) {
   };
 }
 
+// src/core/scorer.ts
+var DEFAULT_K1 = 1.2;
+var DEFAULT_B = 0.75;
+function computeIDF(docFrequency, totalDocs) {
+  if (totalDocs === 0) return 0;
+  return Math.log((totalDocs - docFrequency + 0.5) / (docFrequency + 0.5) + 1);
+}
+function bm25PruningSound(params) {
+  const k1 = params?.k1 ?? DEFAULT_K1;
+  const b = params?.b ?? DEFAULT_B;
+  return Number.isFinite(k1) && k1 >= 0 && b >= 0 && b <= 1;
+}
+function resolveBM25Params(params) {
+  return { k1: params?.k1 ?? DEFAULT_K1, b: params?.b ?? DEFAULT_B };
+}
+function computeBM25WithIDF(termFrequency, idf, fieldLength, avgFieldLength, k1, b) {
+  if (avgFieldLength === 0) return 0;
+  const numerator = termFrequency * (k1 + 1);
+  const denominator = termFrequency + k1 * (1 - b + b * fieldLength / avgFieldLength);
+  if (denominator === 0) return 0;
+  return idf * (numerator / denominator);
+}
+function computeBM25(termFrequency, docFrequency, totalDocs, fieldLength, avgFieldLength, params) {
+  if (totalDocs === 0) return 0;
+  const k1 = params?.k1 ?? DEFAULT_K1;
+  const b = params?.b ?? DEFAULT_B;
+  return computeBM25WithIDF(termFrequency, computeIDF(docFrequency, totalDocs), fieldLength, avgFieldLength, k1, b);
+}
+
+// src/core/partition/field-scoring.ts
+function loadFieldScoring(state, fields, boost, averageFieldLengths) {
+  const fieldNames = state.fieldNameTable.names;
+  const scoring = {
+    searchable: new Uint8Array(fieldNames.length),
+    boosts: new Float64Array(fieldNames.length),
+    averageLengths: new Float64Array(fieldNames.length),
+    lengthColumns: new Array(fieldNames.length).fill(null)
+  };
+  for (let fieldIndex = 0; fieldIndex < fieldNames.length; fieldIndex++) {
+    const fieldName = fieldNames[fieldIndex];
+    scoring.searchable[fieldIndex] = fields === void 0 || fields.includes(fieldName) ? 1 : 0;
+    scoring.boosts[fieldIndex] = boost?.[fieldName] ?? 1;
+    scoring.averageLengths[fieldIndex] = averageFieldLengths[fieldName] ?? 1;
+    scoring.lengthColumns[fieldIndex] = state.docStore.fieldLengthColumn(fieldName);
+  }
+  return scoring;
+}
+function fieldLengthOf(columns, fieldIndex, internalId, averageLength) {
+  const column = fieldIndex < columns.length ? columns[fieldIndex] : null;
+  if (column === null || internalId >= column.length) return averageLength;
+  const stored = column[internalId];
+  return stored > 0 ? stored : averageLength;
+}
+function bestSearchable(searchable, values) {
+  let best = 0;
+  for (let index = 0; index < searchable.length; index++) {
+    if (searchable[index] === 1 && values[index] > best) best = values[index];
+  }
+  return best;
+}
+
 // src/core/partition/posting-columns.ts
 function postingColumns(list) {
   const deletedDocs = list.deletedDocs;
@@ -7029,39 +7283,174 @@ function postingColumns(list) {
   };
 }
 
+// src/core/partition/scoring.ts
+var EMPTY_COMPONENTS = Object.freeze({});
+function recordComponents(components, internalId, fieldName, token, termFrequency, fieldLength, idf) {
+  const existing = components.get(internalId);
+  if (existing) {
+    existing.termFrequencies[`${fieldName}:${token}`] = termFrequency;
+    existing.fieldLengths[fieldName] = fieldLength;
+    existing.idf[token] = idf;
+    return;
+  }
+  components.set(internalId, {
+    termFrequencies: { [`${fieldName}:${token}`]: termFrequency },
+    fieldLengths: { [fieldName]: fieldLength },
+    idf: { [token]: idf }
+  });
+}
+function mergeGroupComponents(components, internalId, contribution) {
+  const existing = components.get(internalId);
+  if (existing) {
+    Object.assign(existing.termFrequencies, contribution.termFrequencies);
+    Object.assign(existing.fieldLengths, contribution.fieldLengths);
+    existing.idf[contribution.token] = contribution.idf;
+    return;
+  }
+  components.set(internalId, {
+    termFrequencies: contribution.termFrequencies,
+    fieldLengths: contribution.fieldLengths,
+    idf: { [contribution.token]: contribution.idf }
+  });
+}
+
+// src/core/partition/group-scoring.ts
+function partialFieldMarks(fieldNames, partialFields) {
+  const marks = new Uint8Array(fieldNames.length);
+  if (partialFields === void 0 || partialFields.length === 0) return marks;
+  for (let fieldIndex = 0; fieldIndex < fieldNames.length; fieldIndex++) {
+    if (partialFields.includes(fieldNames[fieldIndex])) marks[fieldIndex] = 1;
+  }
+  return marks;
+}
+function termGroupOf(groups, token) {
+  if (groups === void 0) return void 0;
+  for (const group of groups) {
+    if (group.token === token) return group;
+  }
+  return void 0;
+}
+function typoMatchesFor(index, token, group, exact, tolerance, prefixLength) {
+  if (group !== void 0) {
+    if (!group.typoMatches || exact || tolerance === 0) return [];
+    return index.fuzzyLookup(token, tolerance, prefixLength).filter((match) => match.token !== token);
+  }
+  if (!exact) return index.fuzzyLookup(token, tolerance, prefixLength);
+  const postingList = index.lookup(token);
+  return postingList ? [{ token, postingList }] : [];
+}
+function resolveGroupMatches(context, group) {
+  let groupDocumentFrequency = 0;
+  const found = [];
+  for (const member of group.members) {
+    const documents = context.globalFrequency(member.token) ?? context.index.documentFrequency(member.token);
+    if (documents > groupDocumentFrequency) groupDocumentFrequency = documents;
+    const postingList = context.index.lookup(member.token);
+    if (postingList === void 0) continue;
+    found.push({ token: member.token, factor: member.factor, partialFactor: member.partialFactor, postingList });
+  }
+  if (found.length === 0) return [];
+  const idf = computeIDF(groupDocumentFrequency, context.totalDocs);
+  return found.map((entry) => ({ ...entry, idf }));
+}
+function groupPostingCount(matches) {
+  let total = 0;
+  for (const match of matches) total += match.postingList.length;
+  return total;
+}
+function computeGroupContributions(context, matches, collect) {
+  const { fields, fieldNames, filterBitset, partialMarks, k1, b } = context;
+  const scoresAreZero = context.totalDocs === 0;
+  const best = /* @__PURE__ */ new Map();
+  for (const match of matches) {
+    const perTerm = /* @__PURE__ */ new Map();
+    const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
+      match.postingList
+    );
+    for (let pi = 0; pi < count; pi++) {
+      const internalId = docIds[pi];
+      if (hasDeleted && deletedDocs.has(internalId)) continue;
+      if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
+      const fieldIndex = fieldNameIndices[pi];
+      if (fields.searchable[fieldIndex] === 0) continue;
+      const factor = partialMarks[fieldIndex] === 1 ? match.partialFactor : match.factor;
+      if (factor === 0) continue;
+      const fieldName = fieldNames[fieldIndex];
+      const termFrequency = termFrequencies[pi];
+      const fieldBoost = fields.boosts[fieldIndex];
+      const avgLen = fields.averageLengths[fieldIndex];
+      const actualFieldLength = fieldLengthOf(fields.lengthColumns, fieldIndex, internalId, avgLen);
+      const termScore = (scoresAreZero ? 0 : computeBM25WithIDF(termFrequency, match.idf, actualFieldLength, avgLen, k1, b)) * fieldBoost * factor;
+      const existing = perTerm.get(internalId);
+      if (existing) {
+        existing.score += termScore;
+        if (collect) {
+          existing.termFrequencies[`${fieldName}:${match.token}`] = termFrequency;
+          existing.fieldLengths[fieldName] = actualFieldLength;
+        }
+      } else if (collect) {
+        perTerm.set(internalId, {
+          score: termScore,
+          token: match.token,
+          idf: match.idf,
+          termFrequencies: { [`${fieldName}:${match.token}`]: termFrequency },
+          fieldLengths: { [fieldName]: actualFieldLength }
+        });
+      } else {
+        perTerm.set(internalId, {
+          score: termScore,
+          token: match.token,
+          idf: match.idf,
+          termFrequencies: EMPTY_COMPONENTS,
+          fieldLengths: EMPTY_COMPONENTS
+        });
+      }
+    }
+    for (const [internalId, contribution] of perTerm) {
+      const current = best.get(internalId);
+      if (!current || contribution.score > current.score) {
+        best.set(internalId, contribution);
+      }
+    }
+  }
+  return best;
+}
+
 // src/core/partition/matches.ts
-function markPostingList(matched, list, fieldNames, fields, filterBitset) {
+function markPostingList(matched, list, markedFields, filterBitset) {
   const { docIds, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(list);
   for (let pi = 0; pi < count; pi++) {
     const internalId = docIds[pi];
     if (hasDeleted && deletedDocs.has(internalId)) continue;
     if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
-    if (fields && !fields.includes(fieldNames[fieldNameIndices[pi]])) continue;
+    if (markedFields[fieldNameIndices[pi]] === 0) continue;
     bitsetSet(matched, internalId);
   }
 }
+function searchedFieldMarks(fieldNames, fields) {
+  const marks = new Uint8Array(fieldNames.length);
+  for (let fieldIndex = 0; fieldIndex < fieldNames.length; fieldIndex++) {
+    if (fields === void 0 || fields.includes(fieldNames[fieldIndex])) marks[fieldIndex] = 1;
+  }
+  return marks;
+}
 function searchFulltextMatches(state, params) {
-  const { queryTokens, prefixExpansion, fields, tolerance = 0, prefixLength = 2, exact = false, filterBitset } = params;
+  const { queryTokens, termGroups, fields, tolerance = 0, prefixLength = 2, exact = false, filterBitset } = params;
   const fieldNames = state.fieldNameTable.names;
   const matched = createBitSet(state.docStore.internalIdCapacity());
+  const searched = searchedFieldMarks(fieldNames, fields);
+  const partial = partialFieldMarks(fieldNames, params.partialFields);
+  const searchedPartial = searched.map((mark, fieldIndex) => mark & partial[fieldIndex]);
   for (const qt of queryTokens) {
-    if (prefixExpansion && qt.token === prefixExpansion.token) {
-      const seen = /* @__PURE__ */ new Set();
-      for (const term of [qt.token, ...prefixExpansion.terms]) {
-        if (seen.has(term)) continue;
-        seen.add(term);
-        const postingList = state.invertedIdx.lookup(term);
-        if (postingList) markPostingList(matched, postingList, fieldNames, fields, filterBitset);
-      }
-      continue;
+    const group = termGroupOf(termGroups, qt.token);
+    for (const match of typoMatchesFor(state.invertedIdx, qt.token, group, exact, tolerance, prefixLength)) {
+      markPostingList(matched, match.postingList, searched, filterBitset);
     }
-    if (exact || tolerance === 0) {
-      const postingList = state.invertedIdx.lookup(qt.token);
-      if (postingList) markPostingList(matched, postingList, fieldNames, fields, filterBitset);
-      continue;
-    }
-    for (const match of state.invertedIdx.fuzzyLookup(qt.token, tolerance, prefixLength)) {
-      markPostingList(matched, match.postingList, fieldNames, fields, filterBitset);
+    if (group === void 0) continue;
+    for (const member of group.members) {
+      const postingList = state.invertedIdx.lookup(member.token);
+      if (postingList === void 0) continue;
+      markPostingList(matched, postingList, member.factor > 0 ? searched : searchedPartial, filterBitset);
     }
   }
   const docStore = state.docStore;
@@ -7149,6 +7538,7 @@ function estimatePartitionBytes(state) {
   bytes += docCount * state.geoIndexes.size * FIELD_ENTRY_OVERHEAD_BYTES;
   bytes += docCount * state.sizeIndexes.size * FIELD_ENTRY_OVERHEAD_BYTES;
   for (const index of state.patternIndexes.values()) bytes += index.bytes();
+  bytes += state.partialWords.bytes();
   return bytes + sortColumnBytes(state);
 }
 
@@ -7280,6 +7670,7 @@ function mergeSegmentState(target, source) {
   mergeFieldIndexes(target, source, idMapping);
   mergeStatistics(target, source);
   mergeSurfaceForms(target, source);
+  target.partialWords.afterMerge(source.partialWords.spellings(), [...idMapping.values()]);
   target.sortColumns = null;
   target.scoreBuffer = null;
 }
@@ -7339,70 +7730,10 @@ function rebuildTextIndex(state, schema, language, options) {
     }
   } finally {
     state.invertedIdx.endBatch();
+    state.partialWords.forgetSpellings();
   }
 }
 
-// src/core/scorer.ts
-var DEFAULT_K1 = 1.2;
-var DEFAULT_B = 0.75;
-function computeIDF(docFrequency, totalDocs) {
-  if (totalDocs === 0) return 0;
-  return Math.log((totalDocs - docFrequency + 0.5) / (docFrequency + 0.5) + 1);
-}
-function bm25PruningSound(params) {
-  const k1 = params?.k1 ?? DEFAULT_K1;
-  const b = params?.b ?? DEFAULT_B;
-  return Number.isFinite(k1) && k1 >= 0 && b >= 0 && b <= 1;
-}
-function resolveBM25Params(params) {
-  return { k1: params?.k1 ?? DEFAULT_K1, b: params?.b ?? DEFAULT_B };
-}
-function computeBM25WithIDF(termFrequency, idf, fieldLength, avgFieldLength, k1, b) {
-  if (avgFieldLength === 0) return 0;
-  const numerator = termFrequency * (k1 + 1);
-  const denominator = termFrequency + k1 * (1 - b + b * fieldLength / avgFieldLength);
-  if (denominator === 0) return 0;
-  return idf * (numerator / denominator);
-}
-function computeBM25(termFrequency, docFrequency, totalDocs, fieldLength, avgFieldLength, params) {
-  if (totalDocs === 0) return 0;
-  const k1 = params?.k1 ?? DEFAULT_K1;
-  const b = params?.b ?? DEFAULT_B;
-  return computeBM25WithIDF(termFrequency, computeIDF(docFrequency, totalDocs), fieldLength, avgFieldLength, k1, b);
-}
-
-// src/core/partition/field-scoring.ts
-function loadFieldScoring(state, fields, boost, averageFieldLengths) {
-  const fieldNames = state.fieldNameTable.names;
-  const scoring = {
-    searchable: new Uint8Array(fieldNames.length),
-    boosts: new Float64Array(fieldNames.length),
-    averageLengths: new Float64Array(fieldNames.length),
-    lengthColumns: new Array(fieldNames.length).fill(null)
-  };
-  for (let fieldIndex = 0; fieldIndex < fieldNames.length; fieldIndex++) {
-    const fieldName = fieldNames[fieldIndex];
-    scoring.searchable[fieldIndex] = fields === void 0 || fields.includes(fieldName) ? 1 : 0;
-    scoring.boosts[fieldIndex] = boost?.[fieldName] ?? 1;
-    scoring.averageLengths[fieldIndex] = averageFieldLengths[fieldName] ?? 1;
-    scoring.lengthColumns[fieldIndex] = state.docStore.fieldLengthColumn(fieldName);
-  }
-  return scoring;
-}
-function fieldLengthOf(columns, fieldIndex, internalId, averageLength) {
-  const column = fieldIndex < columns.length ? columns[fieldIndex] : null;
-  if (column === null || internalId >= column.length) return averageLength;
-  const stored = column[internalId];
-  return stored > 0 ? stored : averageLength;
-}
-function bestSearchable(searchable, values) {
-  let best = 0;
-  for (let index = 0; index < searchable.length; index++) {
-    if (searchable[index] === 1 && values[index] > best) best = values[index];
-  }
-  return best;
-}
-
 // src/core/partition/block-bounds.ts
 var ABSENT_FIELD_LENGTH_BOUND = 0;
 var boundsByList = /* @__PURE__ */ new WeakMap();
@@ -7498,37 +7829,6 @@ function blockBoundsFor(list, columns) {
   return built;
 }
 
-// src/core/partition/scoring.ts
-var EMPTY_COMPONENTS = Object.freeze({});
-function recordComponents(components, internalId, fieldName, token, termFrequency, fieldLength, idf) {
-  const existing = components.get(internalId);
-  if (existing) {
-    existing.termFrequencies[`${fieldName}:${token}`] = termFrequency;
-    existing.fieldLengths[fieldName] = fieldLength;
-    existing.idf[token] = idf;
-    return;
-  }
-  components.set(internalId, {
-    termFrequencies: { [`${fieldName}:${token}`]: termFrequency },
-    fieldLengths: { [fieldName]: fieldLength },
-    idf: { [token]: idf }
-  });
-}
-function mergePrefixComponents(components, internalId, contribution) {
-  const existing = components.get(internalId);
-  if (existing) {
-    Object.assign(existing.termFrequencies, contribution.termFrequencies);
-    Object.assign(existing.fieldLengths, contribution.fieldLengths);
-    existing.idf[contribution.token] = contribution.idf;
-    return;
-  }
-  components.set(internalId, {
-    termFrequencies: contribution.termFrequencies,
-    fieldLengths: contribution.fieldLengths,
-    idf: { [contribution.token]: contribution.idf }
-  });
-}
-
 // src/core/partition/top-k-heap.ts
 function candidateWorse(a, b) {
   if (a.score !== b.score) return a.score < b.score;
@@ -7692,7 +7992,7 @@ function topKFromBuffer(buffer, k, resolver, components) {
 // src/core/partition/multi-term-topk.ts
 function prunableMultiTermLists(params, index) {
   if (params.queryTokens.length < 2) return null;
-  if (params.prefixExpansion !== void 0) return null;
+  if (params.termGroups !== void 0 && params.termGroups.length > 0) return null;
   if (params.exact !== true && (params.tolerance ?? 0) !== 0) return null;
   if (params.termMatch !== void 0 && params.termMatch !== "any") return null;
   if (params.collectComponents !== false) return null;
@@ -7864,87 +8164,6 @@ function multiTermTopK(request) {
   return { scored: pageFromBuffer(scans, buffer, selection, resolver), totalMatched };
 }
 
-// src/core/partition/prefix-scoring.ts
-function resolvePrefixMatches(context, token, expansionTerms) {
-  const found = [];
-  const seen = /* @__PURE__ */ new Set();
-  for (const term of [token, ...expansionTerms]) {
-    if (seen.has(term)) continue;
-    seen.add(term);
-    const postingList = context.index.lookup(term);
-    if (!postingList) continue;
-    found.push({ token: term, postingList, docFreq: context.documentFrequency(term, postingList) });
-  }
-  if (found.length === 0) return [];
-  let blendedDf = 0;
-  for (const f of found) {
-    if (f.docFreq > blendedDf) blendedDf = f.docFreq;
-  }
-  const blendedIdf = computeIDF(blendedDf, context.totalDocs);
-  return found.map((f) => ({
-    token: f.token,
-    factor: Math.min(1, token.length / f.token.length),
-    postingList: f.postingList,
-    docFreq: blendedDf,
-    idf: blendedIdf
-  }));
-}
-function computePrefixContributions(context, matches, collect) {
-  const { fields, fieldNames, filterBitset, k1, b } = context;
-  const scoresAreZero = context.totalDocs === 0;
-  const best = /* @__PURE__ */ new Map();
-  for (const match of matches) {
-    const perTerm = /* @__PURE__ */ new Map();
-    const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
-      match.postingList
-    );
-    for (let pi = 0; pi < count; pi++) {
-      const internalId = docIds[pi];
-      if (hasDeleted && deletedDocs.has(internalId)) continue;
-      if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
-      const fieldIndex = fieldNameIndices[pi];
-      if (fields.searchable[fieldIndex] === 0) continue;
-      const fieldName = fieldNames[fieldIndex];
-      const termFrequency = termFrequencies[pi];
-      const fieldBoost = fields.boosts[fieldIndex];
-      const avgLen = fields.averageLengths[fieldIndex];
-      const actualFieldLength = fieldLengthOf(fields.lengthColumns, fieldIndex, internalId, avgLen);
-      const termScore = (scoresAreZero ? 0 : computeBM25WithIDF(termFrequency, match.idf, actualFieldLength, avgLen, k1, b)) * fieldBoost * match.factor;
-      const existing = perTerm.get(internalId);
-      if (existing) {
-        existing.score += termScore;
-        if (collect) {
-          existing.termFrequencies[`${fieldName}:${match.token}`] = termFrequency;
-          existing.fieldLengths[fieldName] = actualFieldLength;
-        }
-      } else if (collect) {
-        perTerm.set(internalId, {
-          score: termScore,
-          token: match.token,
-          idf: match.idf,
-          termFrequencies: { [`${fieldName}:${match.token}`]: termFrequency },
-          fieldLengths: { [fieldName]: actualFieldLength }
-        });
-      } else {
-        perTerm.set(internalId, {
-          score: termScore,
-          token: match.token,
-          idf: match.idf,
-          termFrequencies: EMPTY_COMPONENTS,
-          fieldLengths: EMPTY_COMPONENTS
-        });
-      }
-    }
-    for (const [internalId, contribution] of perTerm) {
-      const current = best.get(internalId);
-      if (!current || contribution.score > current.score) {
-        best.set(internalId, contribution);
-      }
-    }
-  }
-  return best;
-}
-
 // src/core/partition/single-term-topk.ts
 function fieldsCoverEvery(fields, fieldNames) {
   if (fields === void 0) return true;
@@ -7955,7 +8174,7 @@ function fieldsCoverEvery(fields, fieldNames) {
 }
 function prunableSingleTermList(params, index, fieldNames) {
   if (params.queryTokens.length !== 1) return null;
-  if (params.prefixExpansion !== void 0) return null;
+  if (params.termGroups !== void 0 && params.termGroups.length > 0) return null;
   if (params.exact !== true && (params.tolerance ?? 0) !== 0) return null;
   if (params.termMatch !== void 0 && params.termMatch !== "any") return null;
   if (params.collectComponents !== false) return null;
@@ -8065,15 +8284,11 @@ function singleTermTopK(request) {
 function globalDocFreqFor(docFreqs, term, fallback) {
   return Object.hasOwn(docFreqs, term) ? docFreqs[term] : fallback;
 }
-function matchesFor(index, token, exact, tolerance, prefixLength) {
-  if (!exact) return index.fuzzyLookup(token, tolerance, prefixLength);
-  const postingList = index.lookup(token);
-  return postingList ? [{ token, postingList }] : [];
-}
 function searchFulltext(state, params) {
   const {
     queryTokens,
-    prefixExpansion,
+    termGroups,
+    partialFields,
     fields,
     boost,
     tolerance = 0,
@@ -8105,19 +8320,75 @@ function searchFulltext(state, params) {
   function documentFrequency(token, list) {
     return globalStats ? globalDocFreqFor(globalStats.docFrequencies, token, list.docIdSet.size) : list.docIdSet.size;
   }
-  const prefixContext = {
+  const groupContext = {
     index: state.invertedIdx,
     fields: fieldScoring,
+    partialMarks: partialFieldMarks(fieldNames, partialFields),
     fieldNames,
     totalDocs,
     k1,
     b,
     filterBitset,
-    documentFrequency
+    globalFrequency(token) {
+      if (globalStats === void 0 || !Object.hasOwn(globalStats.docFrequencies, token)) return void 0;
+      return globalStats.docFrequencies[token];
+    }
   };
-  function mergePrefixContribution(internalId, contribution) {
+  function mergeGroupContribution(internalId, contribution) {
     addScore(scoreBuffer, internalId, contribution.score);
-    if (components !== null) mergePrefixComponents(components, internalId, contribution);
+    if (components !== null) mergeGroupComponents(components, internalId, contribution);
+  }
+  function resolveMatch(token, postingList) {
+    const docFreq = documentFrequency(token, postingList);
+    return { token, docFreq, idf: computeIDF(docFreq, totalDocs), postingList };
+  }
+  function scorePostings(match, onlyScored) {
+    const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
+      match.postingList
+    );
+    if (!onlyScored && !hasDeleted && filterBitset === void 0 && components === null) {
+      for (let pi = 0; pi < count; pi++) {
+        const internalId = docIds[pi];
+        const fieldIndex = fieldNameIndices[pi];
+        if (searchable[fieldIndex] === 0) continue;
+        const avgLen = averageLengths[fieldIndex];
+        const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
+        const termScore = scoresAreZero ? 0 : computeBM25WithIDF(termFrequencies[pi], match.idf, actualFieldLength, avgLen, k1, b);
+        addScore(scoreBuffer, internalId, termScore * boosts[fieldIndex]);
+      }
+      return;
+    }
+    for (let pi = 0; pi < count; pi++) {
+      const internalId = docIds[pi];
+      if (hasDeleted && deletedDocs.has(internalId)) continue;
+      if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
+      if (onlyScored && !hasScore(scoreBuffer, internalId)) continue;
+      const fieldIndex = fieldNameIndices[pi];
+      if (searchable[fieldIndex] === 0) continue;
+      const termFrequency = termFrequencies[pi];
+      const avgLen = averageLengths[fieldIndex];
+      const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
+      const termScore = scoresAreZero ? 0 : computeBM25WithIDF(termFrequency, match.idf, actualFieldLength, avgLen, k1, b);
+      addScore(scoreBuffer, internalId, termScore * boosts[fieldIndex]);
+      if (components !== null) {
+        recordComponents(
+          components,
+          internalId,
+          fieldNames[fieldIndex],
+          match.token,
+          termFrequency,
+          actualFieldLength,
+          match.idf
+        );
+      }
+    }
+  }
+  function scoreGroup(group, onlyScored) {
+    if (group === null) return;
+    for (const [internalId, contribution] of computeGroupContributions(groupContext, group, collectComponents)) {
+      if (onlyScored && !hasScore(scoreBuffer, internalId)) continue;
+      mergeGroupContribution(internalId, contribution);
+    }
   }
   const prunableList = prunableSingleTermList(params, state.invertedIdx, fieldNames);
   if (prunableList !== null && maxResults !== void 0) {
@@ -8147,127 +8418,30 @@ function searchFulltext(state, params) {
   }
   if (useIntersection) {
     const resolved = [];
-    let prefixMatches = [];
     for (const qt of queryTokens) {
-      if (prefixExpansion && qt.token === prefixExpansion.token) {
-        prefixMatches = resolvePrefixMatches(prefixContext, qt.token, prefixExpansion.terms);
-        let totalPostings2 = 0;
-        for (const m of prefixMatches) {
-          totalPostings2 += m.postingList.length;
-        }
-        resolved.push({ token: qt.token, matches: [], totalPostings: totalPostings2, isPrefix: true });
-        continue;
-      }
-      const rawMatches = matchesFor(state.invertedIdx, qt.token, exact, tolerance, prefixLength);
-      let totalPostings = 0;
+      const group = termGroupOf(termGroups, qt.token);
+      const groupMatches = group === void 0 ? null : resolveGroupMatches(groupContext, group);
+      let totalPostings = groupMatches === null ? 0 : groupPostingCount(groupMatches);
       const matches = [];
-      for (const m of rawMatches) {
-        const docFreq = documentFrequency(m.token, m.postingList);
-        const idf = computeIDF(docFreq, totalDocs);
+      for (const m of typoMatchesFor(state.invertedIdx, qt.token, group, exact, tolerance, prefixLength)) {
         totalPostings += m.postingList.length;
-        matches.push({ token: m.token, docFreq, idf, postingList: m.postingList });
+        matches.push(resolveMatch(m.token, m.postingList));
       }
-      resolved.push({ token: qt.token, matches, totalPostings });
+      resolved.push({ token: qt.token, matches, totalPostings, group: groupMatches });
     }
     resolved.sort((a, b2) => a.totalPostings - b2.totalPostings);
     for (let tokenIndex = 0; tokenIndex < resolved.length; tokenIndex++) {
-      if (resolved[tokenIndex].isPrefix) {
-        const contributions = computePrefixContributions(prefixContext, prefixMatches, collectComponents);
-        for (const [internalId, contribution] of contributions) {
-          if (tokenIndex > 0 && !hasScore(scoreBuffer, internalId)) continue;
-          mergePrefixContribution(internalId, contribution);
-        }
-        continue;
-      }
-      for (const match of resolved[tokenIndex].matches) {
-        const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
-          match.postingList
-        );
-        for (let pi = 0; pi < count; pi++) {
-          const internalId = docIds[pi];
-          if (hasDeleted && deletedDocs.has(internalId)) continue;
-          if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
-          if (tokenIndex > 0 && !hasScore(scoreBuffer, internalId)) continue;
-          const fieldIndex = fieldNameIndices[pi];
-          if (searchable[fieldIndex] === 0) continue;
-          const termFrequency = termFrequencies[pi];
-          const fieldBoost = boosts[fieldIndex];
-          const avgLen = averageLengths[fieldIndex];
-          const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
-          let termScore = scoresAreZero ? 0 : computeBM25WithIDF(termFrequency, match.idf, actualFieldLength, avgLen, k1, b);
-          termScore *= fieldBoost;
-          addScore(scoreBuffer, internalId, termScore);
-          if (components !== null) {
-            recordComponents(
-              components,
-              internalId,
-              fieldNames[fieldIndex],
-              match.token,
-              termFrequency,
-              actualFieldLength,
-              match.idf
-            );
-          }
-        }
-      }
+      const onlyScored = tokenIndex > 0;
+      for (const match of resolved[tokenIndex].matches) scorePostings(match, onlyScored);
+      scoreGroup(resolved[tokenIndex].group, onlyScored);
     }
   } else {
     for (const qt of queryTokens) {
-      if (prefixExpansion && qt.token === prefixExpansion.token) {
-        const contributions = computePrefixContributions(
-          prefixContext,
-          resolvePrefixMatches(prefixContext, qt.token, prefixExpansion.terms),
-          collectComponents
-        );
-        for (const [internalId, contribution] of contributions) {
-          mergePrefixContribution(internalId, contribution);
-        }
-        continue;
-      }
-      const matchingPostings = matchesFor(state.invertedIdx, qt.token, exact, tolerance, prefixLength);
-      for (const match of matchingPostings) {
-        const idf = computeIDF(documentFrequency(match.token, match.postingList), totalDocs);
-        const { docIds, termFrequencies, fieldNameIndices, deletedDocs, hasDeleted, count } = postingColumns(
-          match.postingList
-        );
-        if (!hasDeleted && filterBitset === void 0 && components === null) {
-          for (let pi = 0; pi < count; pi++) {
-            const internalId = docIds[pi];
-            const fieldIndex = fieldNameIndices[pi];
-            if (searchable[fieldIndex] === 0) continue;
-            const avgLen = averageLengths[fieldIndex];
-            const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
-            const termScore = scoresAreZero ? 0 : computeBM25WithIDF(termFrequencies[pi], idf, actualFieldLength, avgLen, k1, b);
-            addScore(scoreBuffer, internalId, termScore * boosts[fieldIndex]);
-          }
-          continue;
-        }
-        for (let pi = 0; pi < count; pi++) {
-          const internalId = docIds[pi];
-          if (hasDeleted && deletedDocs.has(internalId)) continue;
-          if (filterBitset && !bitsetHas(filterBitset, internalId)) continue;
-          const fieldIndex = fieldNameIndices[pi];
-          if (searchable[fieldIndex] === 0) continue;
-          const termFrequency = termFrequencies[pi];
-          const fieldBoost = boosts[fieldIndex];
-          const avgLen = averageLengths[fieldIndex];
-          const actualFieldLength = fieldLengthOf(lengthColumns, fieldIndex, internalId, avgLen);
-          let termScore = scoresAreZero ? 0 : computeBM25WithIDF(termFrequency, idf, actualFieldLength, avgLen, k1, b);
-          termScore *= fieldBoost;
-          addScore(scoreBuffer, internalId, termScore);
-          if (components !== null) {
-            recordComponents(
-              components,
-              internalId,
-              fieldNames[fieldIndex],
-              match.token,
-              termFrequency,
-              actualFieldLength,
-              idf
-            );
-          }
-        }
+      const group = termGroupOf(termGroups, qt.token);
+      for (const m of typoMatchesFor(state.invertedIdx, qt.token, group, exact, tolerance, prefixLength)) {
+        scorePostings(resolveMatch(m.token, m.postingList), false);
       }
+      if (group !== void 0) scoreGroup(resolveGroupMatches(groupContext, group), false);
     }
   }
   const totalMatched = scoreBuffer.touchedCount;
@@ -8476,6 +8650,7 @@ function encodeSegmentState(state) {
     totalFieldLengths: fieldLengths.totals,
     docFrequencies,
     surfaceForms: state.surfaceRegistry.size() === 0 ? null : state.surfaceRegistry.serialize(),
+    partialSpellings: state.partialWords.spellings(),
     ...encodeFieldIndexes(state, remap)
   };
 }
@@ -8594,6 +8769,8 @@ function mergeSegmentPayload(target, payload, documents) {
       target.surfaceRegistry.add(surface, value[1], value[0]);
     }
   }
+  const mergedIds = Array.from({ length: payload.docIds.length }, (_, at) => ordinalBase + at);
+  target.partialWords.afterMerge(payload.partialSpellings, mergedIds);
   target.sortColumns = null;
   target.scoreBuffer = null;
 }
@@ -8883,6 +9060,7 @@ function deserializePartition(state, data, clearFn, schema) {
   }
   loadPatternIndexes(state, data.fieldIndexes.pattern, schema);
   rebuildSizeIndexes(state, schema);
+  state.partialWords.forgetSpellings();
 }
 
 // src/core/partition/suggestions.ts
@@ -8928,27 +9106,33 @@ function suggestDisplayTerms(state, surfacePrefix, stemmedPrefix, limit) {
   if (results.length > limit) results.length = limit;
   return results;
 }
-function expandTermPrefix(state, surfacePrefix, stemmedToken, maxExpansions) {
+function partitionDocumentFrequency(subs, token) {
+  let documents = 0;
+  for (const sub of subs) documents += sub.invertedIdx.documentFrequency(token);
+  return documents;
+}
+function expandTermPrefix(subs, surfacePrefix, stemmedToken, maxExpansions) {
   if (maxExpansions <= 0 || surfacePrefix.length === 0) return [];
-  const dfByToken = /* @__PURE__ */ new Map();
-  for (const candidate of state.surfaceRegistry.candidatesForPrefix(surfacePrefix)) {
-    if (dfByToken.has(candidate.token)) continue;
-    const postingList = state.invertedIdx.lookup(candidate.token);
-    if (!postingList || postingList.docIdSet.size === 0) continue;
-    dfByToken.set(candidate.token, postingList.docIdSet.size);
-  }
-  const termPrefixes = state.surfaceRegistry.size() === 0 && stemmedToken !== surfacePrefix && stemmedToken.length > 0 ? [surfacePrefix, stemmedToken] : [surfacePrefix];
-  for (const prefix of termPrefixes) {
-    for (const suggestion of state.invertedIdx.prefixSearch(prefix, Number.MAX_SAFE_INTEGER)) {
-      if (dfByToken.has(suggestion.term)) continue;
-      if (verbatimOccurrences(state, suggestion.term) === 0) continue;
-      dfByToken.set(suggestion.term, suggestion.documentFrequency);
+  const candidates = /* @__PURE__ */ new Set();
+  const holdsSurfaceForms = subs.some((sub) => sub.surfaceRegistry.size() > 0);
+  const termPrefixes = !holdsSurfaceForms && stemmedToken !== surfacePrefix && stemmedToken.length > 0 ? [surfacePrefix, stemmedToken] : [surfacePrefix];
+  for (const sub of subs) {
+    for (const candidate of sub.surfaceRegistry.candidatesForPrefix(surfacePrefix)) candidates.add(candidate.token);
+    for (const prefix of termPrefixes) {
+      for (const suggestion of sub.invertedIdx.prefixSearch(prefix, Number.MAX_SAFE_INTEGER)) {
+        if (candidates.has(suggestion.term)) continue;
+        if (verbatimOccurrences(sub, suggestion.term) > 0) candidates.add(suggestion.term);
+      }
     }
   }
-  const entries = Array.from(dfByToken.entries());
-  entries.sort((a, b) => b[1] - a[1] || compareCodePoints(a[0], b[0]));
-  if (entries.length > maxExpansions) entries.length = maxExpansions;
-  return entries.map((e) => e[0]);
+  const ranked = [];
+  for (const token of candidates) {
+    const documents = partitionDocumentFrequency(subs, token);
+    if (documents > 0) ranked.push({ token, documents });
+  }
+  ranked.sort((a, b) => b.documents - a.documents || compareCodePoints(a.token, b.token));
+  if (ranked.length > maxExpansions) ranked.length = maxExpansions;
+  return ranked.map((entry) => entry.token);
 }
 
 // src/core/partition/index.ts
@@ -8965,9 +9149,10 @@ function partitionStateOf(partition) {
 }
 function createPartitionIndex(partitionId, trackPositions = true) {
   const fieldNameTable = { names: [], indexMap: /* @__PURE__ */ new Map() };
+  const docStore = createDocumentStore();
   const state = {
     invertedIdx: createInvertedIndex(fieldNameTable),
-    docStore: createDocumentStore(),
+    docStore,
     stats: createPartitionStats(),
     surfaceRegistry: createSurfaceRegistry(),
     numericIndexes: /* @__PURE__ */ new Map(),
@@ -8977,6 +9162,7 @@ function createPartitionIndex(partitionId, trackPositions = true) {
     patternIndexes: /* @__PURE__ */ new Map(),
     sizeIndexes: /* @__PURE__ */ new Map(),
     fieldNameTable,
+    partialWords: createGrowingPartialWords({ docStore }),
     flatSchemaCache: null,
     lastSchemaRef: null,
     trackPositions,
@@ -8997,6 +9183,7 @@ function createPartitionIndex(partitionId, trackPositions = true) {
     state.geoIndexes.clear();
     state.patternIndexes.clear();
     state.sizeIndexes.clear();
+    state.partialWords.clear();
     state.stats.deserialize({ totalDocuments: 0, totalFieldLengths: {}, averageFieldLengths: {}, docFrequencies: {} });
     state.flatSchemaCache = null;
     state.lastSchemaRef = null;
@@ -9025,7 +9212,7 @@ function createPartitionIndex(partitionId, trackPositions = true) {
         }
       }
       const internalId = state.docStore.ensureInternalId(docId);
-      const { fieldLengths, tokensByField } = indexDocument(
+      const { fieldLengths, tokensByField, partialSpellings } = indexDocument(
         state,
         docId,
         document2,
@@ -9039,6 +9226,7 @@ function createPartitionIndex(partitionId, trackPositions = true) {
         state.docStore.store(docId, document2, fieldLengths);
       }
       state.stats.addDocument(fieldLengths, tokensByField);
+      state.partialWords.afterDocument(partialFieldsOf(schema), internalId, partialSpellings, 1);
       recordSortValues(state, internalId, document2);
     },
     remove(docId, schema, language, options) {
@@ -9049,7 +9237,7 @@ function createPartitionIndex(partitionId, trackPositions = true) {
           partitionId
         });
       }
-      const { fieldLengths, tokensByField } = removeFromIndexes(
+      const { fieldLengths, tokensByField, partialSpellings } = removeFromIndexes(
         state,
         docId,
         stored,
@@ -9060,6 +9248,9 @@ function createPartitionIndex(partitionId, trackPositions = true) {
       const internalId = state.docStore.getInternalId(docId);
       state.docStore.remove(docId);
       state.stats.removeDocument(fieldLengths, tokensByField);
+      if (internalId !== void 0) {
+        state.partialWords.afterDocument(partialFieldsOf(schema), internalId, partialSpellings, -1);
+      }
       forgetSortValues(state, internalId);
     },
     beginBatch() {
@@ -9095,29 +9286,19 @@ function createPartitionIndex(partitionId, trackPositions = true) {
       const fields = schemaFieldsOf(schema);
       const needsTextReindex = textFieldsChanged(stored.fields, document2, fields);
       if (needsTextReindex) {
-        const { fieldLengths: oldFieldLengths, tokensByField: oldTokens } = removeFromIndexes(
-          state,
-          docId,
-          stored,
-          fields,
-          language,
-          options
-        );
-        state.stats.removeDocument(oldFieldLengths, oldTokens);
+        const previous = removeFromIndexes(state, docId, stored, fields, language, options);
+        state.stats.removeDocument(previous.fieldLengths, previous.tokensByField);
         const previousInternalId = state.docStore.getInternalId(docId);
+        if (previousInternalId !== void 0) {
+          state.partialWords.afterDocument(partialFieldsOf(schema), previousInternalId, previous.partialSpellings, -1);
+        }
         state.docStore.remove(docId);
         forgetSortValues(state, previousInternalId);
         const internalId = state.docStore.ensureInternalId(docId);
-        const { fieldLengths: newFieldLengths, tokensByField: newTokens } = indexDocument(
-          state,
-          docId,
-          document2,
-          fields,
-          language,
-          options
-        );
-        state.docStore.store(docId, document2, newFieldLengths);
-        state.stats.addDocument(newFieldLengths, newTokens);
+        const next = indexDocument(state, docId, document2, fields, language, options);
+        state.docStore.store(docId, document2, next.fieldLengths);
+        state.stats.addDocument(next.fieldLengths, next.tokensByField);
+        state.partialWords.afterDocument(partialFieldsOf(schema), internalId, next.partialSpellings, 1);
         recordSortValues(state, internalId, document2);
       } else {
         updateFieldIndexOnly(state, docId, stored.fields, document2, fields);
@@ -9188,7 +9369,13 @@ function createPartitionIndex(partitionId, trackPositions = true) {
       return suggestDisplayTerms(state, surfacePrefix, stemmedPrefix, limit);
     },
     expandTermPrefix(surfacePrefix, stemmedToken, maxExpansions) {
-      return expandTermPrefix(state, surfacePrefix, stemmedToken, maxExpansions);
+      return expandTermPrefix([state], surfacePrefix, stemmedToken, maxExpansions);
+    },
+    expandPartialWords(analysis, requests) {
+      return expandPartialWords([state], analysis, requests);
+    },
+    preparePartialWords(analysis) {
+      expandPartialWords([state], analysis, []);
     },
     serialize(indexName, totalPartitions, language, schema) {
       return serializePartition(state, partitionId, indexName, totalPartitions, language, schema);
@@ -9939,6 +10126,8 @@ var MAX_SORT_FIELDS = 8;
 var MAX_SORT_FIELD_NAME_LENGTH = 255;
 var MAX_CURSOR_ANCHOR_CODE_POINTS = 512;
 var PREFIX_MAX_EXPANSIONS = 50;
+var PARTIAL_WORDS_ADDED_PER_QUERY = 50;
+var PARTIAL_WORD_MIN_CODE_POINTS = 3;
 var DEFAULT_FUZZY_PREFIX_LENGTH = 2;
 var MAX_TOLERANCE = 10;
 var MAX_PREFIX_LENGTH = 1024;
@@ -10256,36 +10445,120 @@ function applyPagination(results, limit, offset, binding, cursor, sort, pinnedId
   return { paginated: sliced, nextCursor };
 }
 
-// src/search/fulltext.ts
-function resolvePrefixExpansion(partition, params, language, options, queryTokens, lastToken) {
-  const term = params.term;
-  if (term === void 0) return void 0;
+// src/search/term-groups.ts
+function writtenWordsByPosition(term, language, analysis) {
   const unstemmed = tokenize(term, language, {
     stem: false,
     removeStopWords: true,
-    customTokenizer: options?.customTokenizer,
-    stopWordOverride: options?.stopWords
+    customTokenizer: analysis?.customTokenizer,
+    stopWordOverride: analysis?.stopWords
   });
-  let surfacePrefix;
-  for (const t of unstemmed.tokens) {
-    if (t.position === lastToken.position) {
-      surfacePrefix = t.token;
-      break;
+  const written = /* @__PURE__ */ new Map();
+  for (const token of unstemmed.tokens) {
+    if (!written.has(token.position)) written.set(token.position, token.token);
+  }
+  return written;
+}
+function groupFor(groups, token, typoMatches) {
+  let group = groups.get(token);
+  if (group === void 0) {
+    group = { token, members: [{ token, factor: 1, partialFactor: 1 }], typoMatches };
+    groups.set(token, group);
+  }
+  return group;
+}
+function addCompletions(groups, partition, lastToken, typedPrefix) {
+  if (typedPrefix === void 0 || typedPrefix.length === 0) return;
+  const group = groupFor(groups, lastToken.token, false);
+  const ownLength = codePointCount(lastToken.token);
+  for (const completion of partition.expandTermPrefix(typedPrefix, lastToken.token, PREFIX_MAX_EXPANSIONS)) {
+    if (completion === lastToken.token) continue;
+    const factor = Math.min(1, ownLength / codePointCount(completion));
+    group.members.push({ token: completion, factor, partialFactor: factor });
+  }
+}
+function addPartialWords(group, added) {
+  const membersByToken = /* @__PURE__ */ new Map();
+  for (const member of group.members) membersByToken.set(member.token, member);
+  for (const word of added) {
+    const member = membersByToken.get(word.token);
+    if (member === void 0) {
+      group.members.push({ token: word.token, factor: 0, partialFactor: word.factor });
+    } else if (word.factor > member.partialFactor) {
+      member.partialFactor = word.factor;
     }
   }
-  if (surfacePrefix === void 0 || surfacePrefix.length === 0) return void 0;
-  const expansions = partition.expandTermPrefix(surfacePrefix, lastToken.token, PREFIX_MAX_EXPANSIONS);
-  const terms = [];
-  for (const expanded of expansions) {
-    if (expanded !== lastToken.token) terms.push(expanded);
+}
+function partialWordAnalysisOf(fields, language, analysis) {
+  return {
+    fields,
+    language,
+    options: {
+      stopWordOverride: analysis?.stopWords,
+      customTokenizer: analysis?.customTokenizer,
+      collectSurfaces: true
+    }
+  };
+}
+function searchesAPartialField(params, partialFields) {
+  if (params.fields === void 0) return true;
+  for (const field of params.fields) {
+    if (partialFields.includes(field)) return true;
   }
-  for (const qt of queryTokens) {
-    if (qt.token === lastToken.token) {
-      return { token: qt.token, terms };
+  return false;
+}
+function partialWordRequests(params, queryTokens, written, prefixToken) {
+  const eligible = [];
+  for (const queryToken of queryTokens) {
+    const word = written.get(queryToken.position);
+    if (word === void 0 || codePointCount(word) < PARTIAL_WORD_MIN_CODE_POINTS) continue;
+    eligible.push({ token: queryToken.token, written: word });
+    if (eligible.length === PARTIAL_WORDS_ADDED_PER_QUERY) break;
+  }
+  const count = eligible.length;
+  if (count === 0) return [];
+  const evenShare = Math.floor(PARTIAL_WORDS_ADDED_PER_QUERY / count);
+  const remainder = PARTIAL_WORDS_ADDED_PER_QUERY % count;
+  return eligible.map((entry, order) => ({
+    token: entry.token,
+    request: {
+      written: entry.written,
+      ownToken: entry.token,
+      share: evenShare + (order < remainder ? 1 : 0),
+      tolerance: entry.token === prefixToken ? 0 : params.tolerance ?? 0,
+      prefixLength: params.prefixLength ?? DEFAULT_FUZZY_PREFIX_LENGTH
+    }
+  }));
+}
+function resolveTermGroups(partition, params, language, schema, queryTokens, lastToken, analysis) {
+  const term = params.term;
+  if (term === void 0 || params.exact === true) return {};
+  const usesPrefix = params.prefix === true;
+  const partialFields = params.partialWords === true ? partialFieldsOf(schema) : [];
+  const usesPartialWords = partialFields.length > 0 && searchesAPartialField(params, partialFields);
+  if (!usesPrefix && !usesPartialWords) return {};
+  const written = writtenWordsByPosition(term, language, analysis);
+  const groups = /* @__PURE__ */ new Map();
+  if (usesPrefix) addCompletions(groups, partition, lastToken, written.get(lastToken.position));
+  const prefixToken = groups.has(lastToken.token) ? lastToken.token : void 0;
+  if (usesPartialWords) {
+    const requests = partialWordRequests(params, queryTokens, written, prefixToken);
+    const added = partition.expandPartialWords(
+      partialWordAnalysisOf(partialFields, language, analysis),
+      requests.map((entry) => entry.request)
+    );
+    for (let at = 0; at < requests.length; at++) {
+      if (added[at].length === 0) continue;
+      const token = requests[at].token;
+      addPartialWords(groupFor(groups, token, token !== prefixToken), added[at]);
     }
   }
-  return void 0;
+  const termGroups = [...groups.values()];
+  if (termGroups.length === 0) return {};
+  return usesPartialWords ? { termGroups, partialFields: [...partialFields] } : { termGroups };
 }
+
+// src/search/fulltext.ts
 function prepareFulltextQuery(partition, params, language, schema, options) {
   if (!params.term || params.term.trim().length === 0) return null;
   if (params.fields && params.fields.length === 0) return null;
@@ -10301,11 +10574,6 @@ function prepareFulltextQuery(partition, params, language, schema, options) {
   });
   if (queryTokenResult.tokens.length === 0) return null;
   const queryTokens = deduplicateTokens(queryTokenResult.tokens);
-  let prefixExpansion;
-  if (params.prefix === true && params.exact !== true) {
-    const lastToken = queryTokenResult.tokens[queryTokenResult.tokens.length - 1];
-    prefixExpansion = resolvePrefixExpansion(partition, params, language, options, queryTokens, lastToken);
-  }
   let filterBitset;
   if (params.filters) {
     filterBitset = partition.applyFiltersBitset(
@@ -10315,14 +10583,17 @@ function prepareFulltextQuery(partition, params, language, schema, options) {
     );
     if (bitsetIsEmpty(filterBitset)) return null;
   }
-  return { queryTokens, prefixExpansion, filterBitset };
+  const lastToken = queryTokenResult.tokens[queryTokenResult.tokens.length - 1];
+  const groups = resolveTermGroups(partition, params, language, schema, queryTokens, lastToken, options);
+  return { queryTokens, ...groups, filterBitset };
 }
 function fulltextMatches(partition, params, language, schema, options) {
   const prepared = prepareFulltextQuery(partition, params, language, schema, options);
   if (prepared === null) return null;
   return partition.searchFulltextMatches({
     queryTokens: prepared.queryTokens,
-    prefixExpansion: prepared.prefixExpansion,
+    termGroups: prepared.termGroups,
+    partialFields: prepared.partialFields,
     fields: params.fields,
     tolerance: params.tolerance ?? 0,
     prefixLength: params.prefixLength ?? DEFAULT_FUZZY_PREFIX_LENGTH,
@@ -10335,14 +10606,15 @@ function fulltextSearch(partition, params, language, schema, options) {
   if (prepared === null) {
     return { scored: [], totalMatched: 0 };
   }
-  const { queryTokens, prefixExpansion, filterBitset } = prepared;
+  const { queryTokens, termGroups, partialFields, filterBitset } = prepared;
   const needsAllResults = params.minScore !== void 0 || params.termMatch !== void 0 && params.termMatch !== "any" || params.sort !== void 0 || params.group !== void 0 || params.pinned !== void 0 || params.searchAfter !== void 0;
   const maxResults = needsAllResults ? void 0 : clampRowCount(params.limit, DEFAULT_PAGE_SIZE) + clampRowCount(params.offset, 0) + 1;
   const collectMatchedSet = params.facets !== void 0 && !needsAllResults ? "ordinals" : void 0;
   const collectComponents = params.includeScoreComponents === true || params.termMatch !== void 0 && params.termMatch !== "any";
   const rawResult = partition.searchFulltext({
     queryTokens,
-    prefixExpansion,
+    termGroups,
+    partialFields,
     fields: params.fields,
     boost: params.boost,
     tolerance: params.tolerance ?? 0,
@@ -10366,7 +10638,8 @@ function fulltextSearch(partition, params, language, schema, options) {
       params.tolerance ?? 0,
       params.prefixLength ?? DEFAULT_FUZZY_PREFIX_LENGTH,
       params.exact ?? false,
-      prefixExpansion
+      termGroups,
+      partialFields ?? []
     );
   }
   if (params.minScore !== void 0 && params.minScore > 0) {
@@ -10408,45 +10681,48 @@ function deduplicateTokens(tokens) {
   }
   return result;
 }
-function filterByTermCoverage(scored, queryTokens, policy, tolerance, prefixLength, exact, prefixExpansion) {
+function filterByTermCoverage(scored, queryTokens, policy, tolerance, prefixLength, exact, termGroups, partialFields) {
   const requiredCount = policy === "all" ? queryTokens.length : policy;
   if (requiredCount <= 0) return scored;
   if (requiredCount > queryTokens.length) return [];
-  const expansionTerms = prefixExpansion ? new Set(prefixExpansion.terms) : void 0;
+  const groups = /* @__PURE__ */ new Map();
+  for (const group of termGroups ?? []) {
+    const partialOnly = /* @__PURE__ */ new Set();
+    for (const member of group.members) {
+      if (member.factor === 0) partialOnly.add(member.token);
+    }
+    groups.set(group.token, {
+      members: new Set(group.members.map((member) => member.token)),
+      partialOnly,
+      typoMatches: group.typoMatches
+    });
+  }
   return scored.filter((doc) => {
-    const matched = countDocTermMatches(
-      doc,
-      queryTokens,
-      tolerance,
-      prefixLength,
-      exact,
-      prefixExpansion?.token,
-      expansionTerms
-    );
+    const matched = countDocTermMatches(doc, queryTokens, tolerance, prefixLength, exact, groups, partialFields);
     return matched >= requiredCount;
   });
 }
-function countDocTermMatches(doc, queryTokens, tolerance, prefixLength, exact, prefixToken, expansionTerms) {
+function countDocTermMatches(doc, queryTokens, tolerance, prefixLength, exact, groups, partialFields) {
   const indexTokens = Object.keys(doc.idf);
   if (indexTokens.length === 0) return 0;
   let count = 0;
   for (const qt of queryTokens) {
-    if (prefixToken !== void 0 && qt.token === prefixToken) {
-      if (prefixTokenSatisfied(qt.token, indexTokens, expansionTerms)) {
-        count++;
-      }
-      continue;
-    }
-    if (queryTermSatisfied(qt.token, indexTokens, tolerance, prefixLength, exact)) {
-      count++;
-    }
+    const group = groups.get(qt.token);
+    const satisfied = group === void 0 ? queryTermSatisfied(qt.token, indexTokens, tolerance, prefixLength, exact) : groupSatisfied(group, doc, indexTokens, partialFields) || group.typoMatches && queryTermSatisfied(qt.token, indexTokens, tolerance, prefixLength, exact);
+    if (satisfied) count++;
   }
   return count;
 }
-function prefixTokenSatisfied(prefixToken, indexTokens, expansionTerms) {
+function matchedInPartialField(doc, token, partialFields) {
+  for (const field of partialFields) {
+    if (doc.termFrequencies[`${field}:${token}`] !== void 0) return true;
+  }
+  return false;
+}
+function groupSatisfied(group, doc, indexTokens, partialFields) {
   for (const indexToken of indexTokens) {
-    if (indexToken === prefixToken) return true;
-    if (expansionTerms?.has(indexToken)) return true;
+    if (!group.members.has(indexToken)) continue;
+    if (!group.partialOnly.has(indexToken) || matchedInPartialField(doc, indexToken, partialFields)) return true;
   }
   return false;
 }
@@ -10598,7 +10874,7 @@ function frozenSegmentBytes(segment) {
     bytes += entry.docIds.byteLength + entry.latitudes.byteLength + entry.longitudes.byteLength;
   }
   for (const reader of segment.patternIndexes.values()) bytes += reader.bytes();
-  return bytes;
+  return bytes + segment.partialWords.bytes();
 }
 
 // src/core/partition/composite/compaction.ts
@@ -10733,20 +11009,19 @@ function subMatchesView(matches, layout, subIndex) {
 
 // src/core/partition/composite/stats.ts
 function collectCandidateTerms(subs, params) {
-  const { queryTokens, prefixExpansion, tolerance = 0, prefixLength = 2, exact = false } = params;
+  const { queryTokens, termGroups, tolerance = 0, prefixLength = 2, exact = false } = params;
   const terms = /* @__PURE__ */ new Set();
   for (const qt of queryTokens) {
-    if (prefixExpansion && qt.token === prefixExpansion.token) {
-      terms.add(qt.token);
-      for (const term of prefixExpansion.terms) terms.add(term);
-      continue;
+    const group = termGroupOf(termGroups, qt.token);
+    if (group !== void 0) {
+      for (const member of group.members) terms.add(member.token);
     }
-    if (exact || tolerance === 0) {
+    if (group === void 0 && (exact || tolerance === 0)) {
       terms.add(qt.token);
       continue;
     }
     for (const sub of subs) {
-      for (const match of sub.invertedIdx.fuzzyLookup(qt.token, tolerance, prefixLength)) {
+      for (const match of typoMatchesFor(sub.invertedIdx, qt.token, group, exact, tolerance, prefixLength)) {
         terms.add(match.token);
       }
     }
@@ -10756,11 +11031,7 @@ function collectCandidateTerms(subs, params) {
 function resolveQueryTermFrequencies(subs, params) {
   const frequencies = /* @__PURE__ */ Object.create(null);
   for (const term of collectCandidateTerms(subs, params)) {
-    let total = 0;
-    for (const sub of subs) {
-      const list = sub.invertedIdx.lookup(term);
-      if (list !== void 0) total += list.docIdSet.size;
-    }
+    const total = partitionDocumentFrequency(subs, term);
     if (total > 0) frequencies[term] = total;
   }
   return frequencies;
@@ -10946,9 +11217,10 @@ function compositeSortValues(subs, docId, fields, fieldTypes, modes) {
 
 // src/core/partition/composite/suggest.ts
 function compositeSuggestTerms(subs, surfacePrefix, stemmedPrefix, limit) {
+  if (limit <= 0) return [];
   const merged = /* @__PURE__ */ new Map();
   for (const sub of subs) {
-    for (const suggestion of suggestDisplayTerms(sub, surfacePrefix, stemmedPrefix, limit)) {
+    for (const suggestion of suggestDisplayTerms(sub, surfacePrefix, stemmedPrefix, Number.MAX_SAFE_INTEGER)) {
       let entry = merged.get(suggestion.token);
       if (entry === void 0) {
         entry = { documentFrequency: 0, surfaceOccurrences: /* @__PURE__ */ new Map() };
@@ -10973,19 +11245,6 @@ function compositeSuggestTerms(subs, surfacePrefix, stemmedPrefix, limit) {
   if (suggestions.length > limit) suggestions.length = limit;
   return suggestions;
 }
-function compositeExpandTermPrefix(subs, surfacePrefix, stemmedToken, maxExpansions) {
-  const expansions = [];
-  const seen = /* @__PURE__ */ new Set();
-  for (const sub of subs) {
-    for (const term of expandTermPrefix(sub, surfacePrefix, stemmedToken, maxExpansions)) {
-      if (seen.has(term)) continue;
-      seen.add(term);
-      expansions.push(term);
-      if (expansions.length === maxExpansions) return expansions;
-    }
-  }
-  return expansions;
-}
 
 // src/core/partition/composite/index.ts
 function isCompositePartition(partition) {
@@ -11189,7 +11448,13 @@ function createCompositePartition(partitionId, trackPositions = true, existingLi
       return compositeSuggestTerms(subs(), surfacePrefix, stemmedPrefix, limit);
     },
     expandTermPrefix(surfacePrefix, stemmedToken, maxExpansions) {
-      return compositeExpandTermPrefix(subs(), surfacePrefix, stemmedToken, maxExpansions);
+      return expandTermPrefix(subs(), surfacePrefix, stemmedToken, maxExpansions);
+    },
+    expandPartialWords(analysis, requests) {
+      return expandPartialWords(subs(), analysis, requests);
+    },
+    preparePartialWords(analysis) {
+      expandPartialWords(subs(), analysis, []);
     },
     get(docId, projection) {
       const owner = frozenOwner(docId);
@@ -11250,6 +11515,11 @@ function createCompositePartition(partitionId, trackPositions = true, existingLi
 }
 
 // src/partitioning/insert-options.ts
+function resolvePartialWordAnalysis(config, language, analysis) {
+  const fields = partialFieldsOf(config.schema);
+  if (fields.length === 0) return null;
+  return { fields, language, options: resolvePartitionInsertOptions(config, analysis) };
+}
 function resolvePartitionInsertOptions(config, analysis, options) {
   const applyStrict = config.strict === true;
   const applyAnalyzer = analysis.stopWords !== void 0 || analysis.customTokenizer !== void 0;
@@ -11327,8 +11597,10 @@ function setNestedValue(obj, path, value) {
 // src/partitioning/manager/index.ts
 function createPartitionManager(indexName, config, language, router, initialPartitionCount, vectorIndexes) {
   requirePatternSearchFor(config.schema);
+  requirePartialWordSearchFor(config.schema);
   const count = initialPartitionCount ?? 1;
   const analysis = resolveIndexAnalysis(config);
+  const partialWordAnalysis = resolvePartialWordAnalysis(config, language, analysis);
   const trackPositions = config.trackPositions ?? true;
   const vecIndexes = vectorIndexes ?? /* @__PURE__ */ new Map();
   let partitions = [];
@@ -11348,6 +11620,9 @@ function createPartitionManager(indexName, config, language, router, initialPart
   function resolveInsertOptions(options) {
     return resolvePartitionInsertOptions(config, analysis, options);
   }
+  function preparePartialWords(partitionId) {
+    if (partialWordAnalysis !== null) partitions[partitionId].preparePartialWords(partialWordAnalysis);
+  }
   function locateDocument(docId) {
     return docPartitionMap.get(docId);
   }
@@ -11403,6 +11678,9 @@ function createPartitionManager(indexName, config, language, router, initialPart
     get analysis() {
       return analysis;
     },
+    get partialWordAnalysis() {
+      return partialWordAnalysis;
+    },
     getPartition(partitionId) {
       validatePartitionId(partitionId);
       return partitions[partitionId];
@@ -11479,6 +11757,7 @@ function createPartitionManager(indexName, config, language, router, initialPart
     rebuildTextIndex(partitionId) {
       validatePartitionId(partitionId);
       partitions[partitionId].rebuildTextIndex(config.schema, language, resolveInsertOptions());
+      preparePartialWords(partitionId);
     },
     beginBatchRemove() {
       for (let i = 0; i < partitions.length; i++) {
@@ -11580,6 +11859,7 @@ function createPartitionManager(indexName, config, language, router, initialPart
     deserializePartition(partitionId, data) {
       validatePartitionId(partitionId);
       partitions[partitionId].deserialize(data, config.schema);
+      preparePartialWords(partitionId);
       rebuildDocPartitionMapForPartition(partitionId);
     },
     getAggregateStats() {
@@ -18050,6 +18330,15 @@ function decodeStoredDocument(bytes, discardedFields) {
   }
   return document2;
 }
+function* storedDocumentsOf(data) {
+  const count = data.offsets.length - 1;
+  for (let ordinal = 0; ordinal < count; ordinal++) {
+    yield decodeStoredDocument(
+      data.blob.subarray(data.offsets[ordinal], data.offsets[ordinal + 1]),
+      data.discardedFields
+    );
+  }
+}
 function decodeEveryStoredDocument(data) {
   const count = data.offsets.length - 1;
   for (let ordinal = 0; ordinal < count; ordinal++) {
@@ -18093,6 +18382,9 @@ function wrapEncodedDocumentTable(data) {
         decodedBytes += documentValueBytes(document2);
       }
       return document2;
+    },
+    readAt(ordinal) {
+      return decoded[ordinal] ?? decodeStoredDocument(blob.subarray(offsets[ordinal], offsets[ordinal + 1]), data.discardedFields);
     }
   };
 }
@@ -18106,6 +18398,9 @@ function wrapDocumentArray(documents) {
     byteLength: residentBytes,
     docAt(ordinal) {
       return documents[ordinal];
+    },
+    readAt(ordinal) {
+      return documents[ordinal];
     }
   };
 }
@@ -18492,6 +18787,10 @@ function createFrozenInvertedReader(table, views) {
       if (at < 0) return void 0;
       return views.viewReadOnce(table.payloadSlot(at), table.documentFrequencyAt(at));
     },
+    documentFrequency(token) {
+      const at = table.find(token);
+      return at < 0 ? 0 : table.documentFrequencyAt(at);
+    },
     fuzzyLookup(token, tolerance, prefixLength) {
       if (tolerance === 0) {
         const at = table.find(token);
@@ -18814,6 +19113,35 @@ function sharedSurfaceTable(payload) {
   if (table.counts.length === 0) return null;
   return { blob: sharedUint8(table.blob), offsets: sharedUint32(table.offsets), counts: sharedUint32(table.counts) };
 }
+function sharePartialWordTable(table) {
+  if (typeof SharedArrayBuffer !== "function") return table;
+  return {
+    fields: [...table.fields],
+    spellings: sharedUint8(table.spellings),
+    spellingOffsets: sharedUint32(table.spellingOffsets),
+    spellingTokens: sharedUint32(table.spellingTokens),
+    spellingCounts: sharedUint32(table.spellingCounts),
+    runs: sharedUint32(table.runs),
+    runOffsets: sharedUint32(table.runOffsets),
+    runEntries: sharedUint32(table.runEntries)
+  };
+}
+function sharedPartialWordsOf(tokenData, spellings, documentData, analysis) {
+  let source = spellings;
+  if (source === null && analysis !== null && analysis.fields.length > 0) {
+    source = encodePartialSpellings(analysis.fields, spellingCountsOf(storedDocumentsOf(documentData), analysis));
+  }
+  if (source === null || source.fields.length === 0) return null;
+  const table = buildPartialWordTableFrom(source, wrapFrozenTokenTable(tokenData));
+  return table === null ? null : sharePartialWordTable(table);
+}
+function shareSegmentArrays(arrays, analysis, segmentId) {
+  return {
+    ...arrays,
+    segmentId: segmentId ?? generateId(),
+    partialWords: sharedPartialWordsOf(arrays.tokenTable, null, arrays.documentTable, analysis)
+  };
+}
 function segmentArraysOf(payload, documentData) {
   const tokenTable = encodeFrozenTokenTableData(payload.tokens, payload.docFrequencies);
   const idTable = encodeExternalIdTableData(payload.docIds);
@@ -18842,11 +19170,11 @@ function segmentArraysOf(payload, documentData) {
     surfaceTable: surfaceTable === null || surfaceTable.counts.length === 0 ? null : surfaceTable
   };
 }
-function freezeSegmentShared(payload, documents, segmentId) {
+function freezeSegmentShared(payload, documents, segmentId, analysis = null) {
   if (typeof SharedArrayBuffer !== "function") return null;
-  return freezeEncodedSegmentShared(payload, encodeDocumentTableData(documents), segmentId);
+  return freezeEncodedSegmentShared(payload, encodeDocumentTableData(documents), segmentId, analysis);
 }
-function freezeEncodedSegmentShared(payload, documentData, segmentId) {
+function freezeEncodedSegmentShared(payload, documentData, segmentId, analysis = null) {
   if (typeof SharedArrayBuffer !== "function") return null;
   const tokenData = encodeFrozenTokenTableData(payload.tokens, payload.docFrequencies);
   const idData = encodeExternalIdTableData(payload.docIds);
@@ -18913,7 +19241,8 @@ function freezeEncodedSegmentShared(payload, documentData, segmentId) {
       offsets: sharedUint32(entry.offsets),
       postings: sharedUint32(entry.postings)
     })),
-    surfaceTable: sharedSurfaceTable(payload)
+    surfaceTable: sharedSurfaceTable(payload),
+    partialWords: sharedPartialWordsOf(tokenData, payload.partialSpellings, documentData, analysis)
   };
 }
 
@@ -18949,7 +19278,12 @@ function buildGeoReaders(entries) {
   }
   return readers;
 }
-function assembleFrozenSegment(segmentId, source, documentSource, sharedSnapshot) {
+function* survivingDocuments(documentSource, tombstones) {
+  for (let ordinal = 0; ordinal < documentSource.count; ordinal++) {
+    if (!tombstones.has(ordinal)) yield documentSource.readAt(ordinal);
+  }
+}
+function assembleFrozenSegment(segmentId, source, documentSource, sharedSnapshot, partialWordTable) {
   const tombstones = createFrozenTombstones();
   const postingViews = createFrozenPostingViews(source, tombstones);
   const lengthColumns = /* @__PURE__ */ new Map();
@@ -18957,6 +19291,10 @@ function assembleFrozenSegment(segmentId, source, documentSource, sharedSnapshot
     lengthColumns.set(source.fieldLengthNames[i], source.fieldLengthColumns[i]);
   }
   const docStore = createFrozenDocTable(source.idTable, lengthColumns, documentSource, tombstones);
+  const partialWords = createFrozenPartialWords(partialWordTable, source.tokenTable, {
+    documentAt: (ordinal) => documentSource.readAt(ordinal),
+    survivors: () => survivingDocuments(documentSource, tombstones)
+  });
   const numericIndexes = /* @__PURE__ */ new Map();
   for (const entry of source.numeric) numericIndexes.set(entry.fieldPath, createFrozenNumericReader(entry));
   const sizeIndexes = /* @__PURE__ */ new Map();
@@ -18989,6 +19327,7 @@ function assembleFrozenSegment(segmentId, source, documentSource, sharedSnapshot
     patternIndexes,
     sizeIndexes,
     fieldNameTable,
+    partialWords,
     trackPositions: source.positionOffsets !== null,
     flatSchemaCache: null,
     lastSchemaRef: null,
@@ -19008,6 +19347,7 @@ function assembleFrozenSegment(segmentId, source, documentSource, sharedSnapshot
       if (ordinal === void 0) return false;
       const added = tombstones.add(ordinal);
       if (added) {
+        partialWords.afterRemoval(ordinal);
         docStore.releaseSortedDocIds();
         segment.sortColumns = null;
         segment.scoreBuffer = null;
@@ -19023,18 +19363,20 @@ function assembleFrozenSegment(segmentId, source, documentSource, sharedSnapshot
   return segment;
 }
 function createFrozenSegment(payload, documents, segmentId) {
+  const tokenTable = buildFrozenTokenTable(payload.tokens, payload.docFrequencies);
   return assembleFrozenSegment(
     segmentId ?? generateId(),
     {
       ...payload,
-      tokenTable: buildFrozenTokenTable(payload.tokens, payload.docFrequencies),
+      tokenTable,
       idTable: buildExternalIdTable(payload.docIds),
       documentTable: null,
       readSurfaceForms: () => payload.surfaceForms,
       docFrequencies: () => payload.docFrequencies
     },
     wrapDocumentArray(documents),
-    null
+    null,
+    payload.partialSpellings === null ? null : buildPartialWordTableFrom(payload.partialSpellings, tokenTable)
   );
 }
 function createSharedFrozenSegment(snapshot) {
@@ -19056,7 +19398,8 @@ function createSharedFrozenSegment(snapshot) {
       }
     },
     wrapEncodedDocumentTable(snapshot.documentTable),
-    snapshot
+    snapshot,
+    snapshot.partialWords
   );
 }
 var FORBIDDEN_KEYS = /* @__PURE__ */ new Set(["__proto__", "constructor", "prototype"]);
@@ -19638,10 +19981,10 @@ function mergeDocuments2(inputs, documentCount) {
   }
   return { blob, offsets };
 }
-function mergeFrozenSegments(segments) {
+function mergeFrozenSegments(segments, analysis) {
   if (typeof SharedArrayBuffer !== "function") return null;
   const merged = mergeSegmentContents(segments.map((segment) => ({ segment })));
-  return freezeEncodedSegmentShared(merged.payload, merged.documents);
+  return freezeEncodedSegmentShared(merged.payload, merged.documents, void 0, analysis);
 }
 function mergeSegmentContents(selections) {
   const docIds = [];
@@ -19670,6 +20013,7 @@ function mergeSegmentContents(selections) {
     totalFieldLengths: lengths.totalFieldLengths,
     docFrequencies: postings.docFrequencies,
     surfaceForms: mergeSurfaceForms2(inputs),
+    partialSpellings: null,
     ...mergeFieldIndexes2(inputs)
   };
   return { payload, documents: mergeDocuments2(inputs, documentCount) };
@@ -19970,14 +20314,18 @@ function buildSegmentPayload(documents, schema, language, options, trackPosition
     patternIndexes: /* @__PURE__ */ new Map(),
     sizeIndexes: /* @__PURE__ */ new Map()
   };
+  const partialFields = partialFieldsOf(schema);
+  const spellings = /* @__PURE__ */ new Map();
+  let fieldSpellings = null;
   let positionOffset = 0;
   const addToken = (token, position, surface) => {
     postings.addToken(token, positionOffset + position);
     surfaces.count(surface, token);
+    if (fieldSpellings !== null) countSpelling(fieldSpellings, token, surface ?? token, 1);
   };
   for (let ordinal = 0; ordinal < documents.length; ordinal++) {
     const document2 = documents[ordinal].document;
-    for (const { path: fieldPath, base: fieldType, pattern } of fields) {
+    for (const { path: fieldPath, base: fieldType, pattern, partial } of fields) {
       const value = getNestedValue(document2, fieldPath);
       if (value === void 0 || value === null) continue;
       recordValueSize(filters.sizeIndexes, ordinal, fieldPath, fieldType, value);
@@ -19986,6 +20334,7 @@ function buildSegmentPayload(documents, schema, language, options, trackPosition
         indexFilterValue(filters, ordinal, fieldPath, fieldType, value);
         continue;
       }
+      fieldSpellings = partial ? spellings : null;
       postings.beginField();
       positionOffset = 0;
       for (const text of fieldType === "string" ? [value] : value) {
@@ -20006,6 +20355,7 @@ function buildSegmentPayload(documents, schema, language, options, trackPosition
     fieldLengthColumns: lengths.columns,
     totalFieldLengths: lengths.totalsByName(),
     surfaceForms: surfaces.encode(),
+    partialSpellings: partialFields.length === 0 ? null : encodePartialSpellings(partialFields, spellings),
     ...encodeFieldIndexes(filters, identity)
   };
 }
@@ -20072,7 +20422,7 @@ function runSegmentAction(entry, action) {
     }
     case "compactSegments": {
       const partition = requireComposite(entry, action.indexName, action.partitionId, "compact");
-      return mergeFrozenSegments(partition.frozenSegmentsById(action.segmentIds));
+      return mergeFrozenSegments(partition.frozenSegmentsById(action.segmentIds), entry.manager.partialWordAnalysis);
     }
     case "swapSegments": {
       requireComposite(entry, action.indexName, action.partitionId, "swap");
@@ -23465,7 +23815,7 @@ function selectionOfMask(segment, keep) {
 }
 function frozenLiveTail(live, shared2) {
   if (live.count() === 0) return null;
-  const payload = live.encodeSegment();
+  const payload = { ...live.encodeSegment(), partialSpellings: null };
   const documents = survivorDocumentsOf(partitionStateOf(live), payload);
   if (shared2) {
     const snapshot = freezeSegmentShared(payload, documents);
@@ -24981,6 +25331,7 @@ function emptyPayload() {
     totalFieldLengths: {},
     docFrequencies: {},
     surfaceForms: null,
+    partialSpellings: null,
     numeric: [],
     boolean: [],
     enums: [],
@@ -25086,7 +25437,7 @@ function chooseWindow(segments, wantedLength) {
   return null;
 }
 function frozenOf(contents) {
-  return createSharedFrozenSegment({ ...contents.arrays, segmentId: generateId() });
+  return createSharedFrozenSegment(shareSegmentArrays(contents.arrays, null));
 }
 function applyTimeOrder(frozen, contents) {
   for (let newer = 1; newer < frozen.length; newer++) {
@@ -25354,7 +25705,7 @@ async function loadPartitionSegments(store, partition, manager, options) {
     const contents = await readSegmentFile(store, ref);
     requireAgreedSchema(options.schema, contents.schema, ref.key);
     if (options.decodesEveryDocument) decodeEveryStoredDocument(contents.arrays.documentTable);
-    const segment = createSharedFrozenSegment({ ...contents.arrays, segmentId: generateId() });
+    const segment = createSharedFrozenSegment(shareSegmentArrays(contents.arrays, manager.partialWordAnalysis));
     removeWhatTheSegmentReplaces(manager, segment, contents);
     if (contents.arrays.documentCount > 0) manager.attachFrozenSegment(partition.partitionId, segment);
     await yieldToEventLoop6();
@@ -25787,7 +26138,7 @@ function validateHnswMetric2(value) {
   }
   return void 0;
 }
-function storedDocumentsOf(raw) {
+function storedDocumentsOf2(raw) {
   requireValidFieldTypes(raw.schema ?? {});
   const documents = {};
   for (const [docId, doc] of Object.entries(raw.documents ?? {})) {
@@ -25801,11 +26152,11 @@ function storedDocumentsOf(raw) {
 }
 function documentsOfPayloadV2(data) {
   const raw = decode(data);
-  return { documents: storedDocumentsOf(raw), schema: raw.schema ?? {} };
+  return { documents: storedDocumentsOf2(raw), schema: raw.schema ?? {} };
 }
 function deserializePayloadV2(data) {
   const raw = decode(data);
-  const documents = storedDocumentsOf(raw);
+  const documents = storedDocumentsOf2(raw);
   const fieldNames = raw.inverted_index?.field_names ?? [];
   const invertedIndex = {};
   for (const [token, list] of Object.entries(raw.inverted_index?.entries ?? {})) {
@@ -27873,6 +28224,16 @@ function validatePartitionConfig(partitions) {
     });
   }
 }
+function requireSurfaceFormsForPartialFields(schema, surfaceForms) {
+  if (surfaceForms !== false) return;
+  const partialFields = partialFieldsOf(schema);
+  if (partialFields.length === 0) return;
+  throw new NarsilError(
+    ErrorCodes.CONFIG_INVALID,
+    `Field "${partialFields[0]}" declares "partial", which compares words as the documents wrote them, so its index needs surfaceForms left on`,
+    { fields: [...partialFields], surfaceForms: false }
+  );
+}
 function validatePatternValueLimit(limit) {
   if (limit === void 0) return;
   if (typeof limit !== "number" || !Number.isInteger(limit) || limit < MIN_PATTERN_VALUE_LIMIT || limit > MAX_PATTERN_VALUE_LIMIT) {
@@ -27987,6 +28348,7 @@ async function createIndexFromMetadata(deps, metadata, loadData) {
   try {
     indexConfig.schema = validateSchema(indexConfig.schema);
     validatePatternValueLimit(indexConfig.patternValueLimit);
+    requireSurfaceFormsForPartialFields(indexConfig.schema, indexConfig.surfaceForms);
   } catch (err) {
     throw recoveryFailure(metadata, err);
   }
@@ -28700,7 +29062,7 @@ function checkHeapAfterRecovery(core) {
 }
 
 // src/core/partition/frozen/share.ts
-function shareFrozenSegment(segment) {
+function shareFrozenSegment(segment, analysis) {
   if (segment.sharedSnapshot !== null) {
     return { snapshot: segment.sharedSnapshot, tombstonedDocIds: segment.tombstonedDocIds() };
   }
@@ -28714,7 +29076,7 @@ function shareFrozenSegment(segment) {
     }
     return stored.fields;
   });
-  const snapshot = freezeSegmentShared(payload, documents, segment.segmentId);
+  const snapshot = freezeSegmentShared(payload, documents, segment.segmentId, analysis);
   return snapshot === null ? null : { snapshot, tombstonedDocIds: [] };
 }
 
@@ -28725,7 +29087,7 @@ function captureComposite(manager, partitionId) {
   const segmentIds = partition.frozenSegmentSizes().map((size) => size.segmentId);
   const frozen = [];
   for (const segment of partition.frozenSegmentsById(segmentIds)) {
-    const shared2 = shareFrozenSegment(segment);
+    const shared2 = shareFrozenSegment(segment, manager.partialWordAnalysis);
     if (shared2 === null) return null;
     frozen.push(shared2);
   }
@@ -29130,7 +29492,7 @@ function liveTailCount(manager, partitionId) {
 }
 function freezeIntoSharedSegment(manager, partitionId) {
   return manager.freezeLiveTail(partitionId, (payload, documents) => {
-    const snapshot = freezeSegmentShared(payload, documents);
+    const snapshot = freezeSegmentShared(payload, documents, void 0, manager.partialWordAnalysis);
     return snapshot === null ? null : createSharedFrozenSegment(snapshot);
   });
 }
@@ -29253,7 +29615,7 @@ async function compactPartitionSegments2(state, indexName, manager, partitionId,
   const mainCanMerge = composite !== null && mainHoldsAll(composite, segmentIds);
   let snapshot = await compactOnWorker(state, indexName, partitionId, segmentIds);
   if (snapshot === null && mainCanMerge && composite !== null) {
-    snapshot = mergeFrozenSegments(composite.frozenSegmentsById(segmentIds));
+    snapshot = mergeFrozenSegments(composite.frozenSegmentsById(segmentIds), manager.partialWordAnalysis);
   }
   if (snapshot === null) {
     if (!mainCanMerge) forgetLedgerSegments(state, indexName, partitionId, segmentIds);
@@ -30333,57 +30695,61 @@ var POSITIONS_PER_WORD = 32;
 function positionWords(positions) {
   return Math.max(1, Math.ceil(positions / POSITIONS_PER_WORD));
 }
-function automatonBytes(positions) {
-  return 2 * positionWords(positions) * Uint32Array.BYTES_PER_ELEMENT + positions * MATCHER_CODE_POINT_BYTES;
-}
 function smallestMatcherBytes(positions) {
-  return automatonBytes(positions) + positions * MATCHER_SIMULATION_BYTES_PER_POSITION + MATCHER_STATE_OVERHEAD_BYTES + positions * Uint32Array.BYTES_PER_ELEMENT;
+  return 2 * positionWords(positions) * Uint32Array.BYTES_PER_ELEMENT + positions * MATCHER_CODE_POINT_BYTES + positions * MATCHER_SIMULATION_BYTES_PER_POSITION + MATCHER_STATE_OVERHEAD_BYTES + positions * Uint32Array.BYTES_PER_ELEMENT;
 }
-function widestPatternSplit(positions) {
-  return Math.max(1, Math.floor(MATCHER_STATE_BUDGET_BYTES / smallestMatcherBytes(positions)));
+function widestPatternSplit(footprintBytes) {
+  return Math.max(1, Math.floor(MATCHER_STATE_BUDGET_BYTES / Math.max(1, footprintBytes)));
 }
 
 // src/core/pattern-index/query-positions.ts
 function isRecord6(value) {
   return value !== null && typeof value === "object" && !Array.isArray(value);
 }
-function textPositions(text, caseFold) {
-  if (typeof text !== "string") return 0;
-  return caseFold ? foldedCodePointCount(text) : codePointCount(text);
+function literalFootprint(text, caseFold) {
+  if (typeof text !== "string") return null;
+  return smallestMatcherBytes(caseFold ? foldedCodePointCount(text) : codePointCount(text));
 }
 function larger(left, right) {
   if (left === null) return right;
   if (right === null) return left;
   return Math.max(left, right);
 }
-function largestTestOf(filter) {
+function largestTestOf(filter, module) {
   const caseFold = filter.caseFold === true;
   let largest = null;
   for (const operator of PATTERN_TEST_OPERATORS) {
     const operand = filter[operator];
     if (operand === void 0) continue;
     const texts = Array.isArray(operand) ? operand : [operand];
-    for (const text of texts) largest = larger(largest, textPositions(text, caseFold));
+    for (const text of texts) largest = larger(largest, literalFootprint(text, caseFold));
+  }
+  for (const operator of PATTERN_EXPRESSION_OPERATORS) {
+    const pattern = filter[operator];
+    if (typeof pattern !== "string") continue;
+    largest = larger(largest, module.expressionFootprint(operator, pattern, caseFold, PATTERN_HOST));
   }
   return largest;
 }
-function largestIn(expression, patternFields) {
+function largestIn(expression, patternFields, module) {
   let largest = null;
   if (isRecord6(expression.fields)) {
     for (const [fieldPath, filter] of Object.entries(expression.fields)) {
-      if (patternFields.has(fieldPath) && isRecord6(filter)) largest = larger(largest, largestTestOf(filter));
+      if (patternFields.has(fieldPath) && isRecord6(filter)) largest = larger(largest, largestTestOf(filter, module));
     }
   }
   const nested = [...expression.and ?? [], ...expression.or ?? []];
   if (expression.not !== void 0) nested.push(expression.not);
-  for (const child of nested) largest = larger(largest, largestIn(child, patternFields));
+  for (const child of nested) largest = larger(largest, largestIn(child, patternFields, module));
   return largest;
 }
-function largestPatternTest(expression, schema) {
+function largestPatternFootprint(expression, schema) {
   if (expression === void 0) return null;
+  const module = availablePatternSearch();
+  if (module === null) return null;
   const patternFields = /* @__PURE__ */ new Set();
   for (const { path, pattern } of schemaFieldsOf(schema)) if (pattern) patternFields.add(path);
-  return patternFields.size === 0 ? null : largestIn(expression, patternFields);
+  return patternFields.size === 0 ? null : largestIn(expression, patternFields, module);
 }
 
 // src/engine/orchestration/search.ts
@@ -30450,7 +30816,7 @@ function isWorkCapError(err) {
 function patternSplitWidth(state, indexName, params) {
   const schema = state.indexRegistry.get(indexName)?.config.schema;
   if (schema === void 0) return Number.POSITIVE_INFINITY;
-  const largest = largestPatternTest(params.filters, schema);
+  const largest = largestPatternFootprint(params.filters, schema);
   if (largest === null) return Number.POSITIVE_INFINITY;
   if (typeof SharedArrayBuffer !== "function") return 1;
   return widestPatternSplit(largest);
@@ -31226,7 +31592,9 @@ async function createEngineIndex(core, config, name, requestedConfig, creation =
   if (appliesCreationLimits) requireCreatableSchema(schema);
   const indexConfig = schema === requestedConfig.schema ? requestedConfig : { ...requestedConfig, schema };
   requirePatternSearchFor(schema);
+  requirePartialWordSearchFor(schema);
   validatePatternValueLimit(indexConfig.patternValueLimit);
+  requireSurfaceFormsForPartialFields(schema, indexConfig.surfaceForms);
   validateVectorPromotion(indexConfig.vectorPromotion);
   validateVectorStorage(indexConfig.vectorPromotion, core.filesystemDurability);
   validateBM25Params(indexConfig.bm25);
@@ -31256,10 +31624,10 @@ async function createEngineIndex(core, config, name, requestedConfig, creation =
     const fields = indexConfig.embedding.fields;
     if (typeof configuredAdapter === "string") {
       embeddingAdapterName = configuredAdapter;
-      const registered2 = core.embeddingAdapters.get(configuredAdapter);
-      if (registered2 !== void 0) {
+      const registered3 = core.embeddingAdapters.get(configuredAdapter);
+      if (registered3 !== void 0) {
         resolvedEmbeddingAdapter = validateEmbeddingConfig(
-          { fields, adapter: registered2 },
+          { fields, adapter: registered3 },
           indexConfig.schema,
           config?.embedding
         );
@@ -34552,6 +34920,7 @@ function prepareRestoredIndex(configuration, deps, reject2) {
   const language = getLanguage(languageName);
   const schema = validateSchema(configuration.schema);
   validatePatternValueLimit(configFields.patternValueLimit);
+  requireSurfaceFormsForPartialFields(schema, configFields.surfaceForms);
   validateVectorPromotion(configFields.vectorPromotion);
   validateVectorStorage(configFields.vectorPromotion, deps.filesystemDurability);
   if (configFields.required !== void 0 && configFields.required.length > 0) {
@@ -35109,7 +35478,7 @@ function boundVectorOf(vector) {
   return bound;
 }
 var FILTERS_SLOT = 2;
-var BOUND_SLOT_COUNT = 15;
+var BOUND_SLOT_COUNT = 16;
 function bindingOf(values) {
   const stream = { bytes: new Uint8Array(256), length: 0 };
   for (const value of values) {
@@ -35128,6 +35497,7 @@ function queryBindingOf(params) {
     params.tolerance,
     params.prefixLength,
     params.prefix,
+    params.partialWords,
     params.exact,
     params.pinned,
     params.mode,
@@ -35296,9 +35666,18 @@ function requireKnownMode(params) {
     { mode: String(params.mode), modes: [...SEARCH_MODES] }
   );
 }
+function requireBooleanPartialWords(params) {
+  const setting = params.partialWords;
+  if (setting === void 0 || typeof setting === "boolean") return;
+  throw new NarsilError(ErrorCodes.CONFIG_INVALID, 'The "partialWords" query option takes true or false', {
+    option: "partialWords",
+    received: setting === null ? "null" : typeof setting
+  });
+}
 function requireValidQueryOptions(params, config) {
   const strict = config.strict === true;
   requireValidTypoTolerance(params);
+  requireBooleanPartialWords(params);
   requireSortableFields(params.sort, config.schema, strict);
   requireValidQueryFilter(params.filters, config.schema);
   requireUsableQueryFields(params, config.schema, strict);
@@ -35650,6 +36029,31 @@ function applySnippetTruncation(taggedText, originalText, positions, maxLen, pre
   if (needsTrailingEllipsis) snippet = `${snippet}...`;
   return { snippet, visiblePositions };
 }
+function containsPartialWord(spelling, words) {
+  for (const word of words) {
+    if (spelling.length > word.length && spelling.includes(word)) return true;
+  }
+  return false;
+}
+function partialWordMatcher(text, language, partial) {
+  const indexed = tokenize(text, language, {
+    stem: true,
+    removeStopWords: true,
+    collectSurfaces: true,
+    customTokenizer: partial.customTokenizer,
+    stopWordOverride: partial.stopWordOverride
+  });
+  const positions = /* @__PURE__ */ new Set();
+  const spellings = /* @__PURE__ */ new Set();
+  for (let at = 0; at < indexed.tokens.length; at++) {
+    const spelling = indexed.surfaces?.[at] ?? indexed.tokens[at].token;
+    if (!containsPartialWord(spelling, partial.words)) continue;
+    positions.add(indexed.tokens[at].position);
+    spellings.add(spelling);
+  }
+  if (partial.customTokenizer !== void 0) return (_position, fieldToken) => spellings.has(fieldToken);
+  return (position) => positions.has(position);
+}
 function highlightField(text, queryTokens, language, options) {
   const preTag = options?.preTag ?? "<mark>";
   const postTag = options?.postTag ?? "</mark>";
@@ -35686,11 +36090,13 @@ function highlightField(text, queryTokens, language, options) {
     matchByFieldToken.set(fieldToken, matches);
     return matches;
   };
+  const matchesInside = options?.partialWords === void 0 ? null : partialWordMatcher(text, language, options.partialWords);
   for (let i = 0; i < fieldResult.tokens.length; i++) {
     if (i >= charOffsets.length) break;
     const fieldToken = fieldResult.tokens[i].token;
     const prefixMatch = prefixToken !== void 0 && fieldToken.startsWith(prefixToken);
-    if (prefixMatch || matchesQuery(fieldToken)) {
+    const insideMatch = matchesInside?.(fieldResult.tokens[i].position, fieldToken) === true;
+    if (prefixMatch || insideMatch || matchesQuery(fieldToken)) {
       matchedRanges.push({ start: charOffsets[i].start, end: charOffsets[i].end });
     }
   }
@@ -35722,7 +36128,39 @@ function highlightField(text, queryTokens, language, options) {
 }
 
 // src/engine/query/highlight.ts
-function applyHighlights(hits, params, language, analysis, readStoredDocument) {
+function writtenWordsOf(params, language, analysis) {
+  return tokenize(params.term ?? "", language, {
+    stem: false,
+    removeStopWords: true,
+    customTokenizer: analysis.customTokenizer,
+    stopWordOverride: analysis.stopWords
+  }).tokens;
+}
+function partialWordTagging(params, schema, queryTokens, written, analysis) {
+  if (params.partialWords !== true || params.exact === true) return null;
+  const fields = partialFieldsOf(schema).filter((field) => params.fields === void 0 || params.fields.includes(field));
+  if (fields.length === 0) return null;
+  const writtenAt = /* @__PURE__ */ new Map();
+  for (const word of written) {
+    if (!writtenAt.has(word.position)) writtenAt.set(word.position, word.token);
+  }
+  const seenTokens = /* @__PURE__ */ new Set();
+  const words = [];
+  for (const queryToken of queryTokens) {
+    if (seenTokens.has(queryToken.token)) continue;
+    seenTokens.add(queryToken.token);
+    const word = writtenAt.get(queryToken.position);
+    if (word === void 0 || codePointCount(word) < PARTIAL_WORD_MIN_CODE_POINTS) continue;
+    words.push(word);
+    if (words.length === PARTIAL_WORDS_ADDED_PER_QUERY) break;
+  }
+  if (words.length === 0) return null;
+  return {
+    fields: new Set(fields),
+    highlight: { words, customTokenizer: analysis.customTokenizer, stopWordOverride: analysis.stopWords }
+  };
+}
+function applyHighlights(hits, params, language, analysis, schema, readStoredDocument) {
   if (!params.highlight) return;
   const queryTokenResult = tokenize(params.term ?? "", language, {
     stem: true,
@@ -35730,17 +36168,15 @@ function applyHighlights(hits, params, language, analysis, readStoredDocument) {
     customTokenizer: analysis.customTokenizer,
     stopWordOverride: analysis.stopWords
   });
+  const queryTokens = queryTokenResult.tokens;
+  const usesPrefix = params.prefix === true && params.exact !== true && queryTokens.length > 0;
+  const usesPartialWords = params.partialWords === true && params.exact !== true && queryTokens.length > 0;
+  const written = usesPrefix || usesPartialWords ? writtenWordsOf(params, language, analysis) : [];
   let prefixToken;
   let completedToken;
-  if (params.prefix === true && params.exact !== true && queryTokenResult.tokens.length > 0) {
-    const lastToken = queryTokenResult.tokens[queryTokenResult.tokens.length - 1];
-    const unstemmed = tokenize(params.term ?? "", language, {
-      stem: false,
-      removeStopWords: true,
-      customTokenizer: analysis.customTokenizer,
-      stopWordOverride: analysis.stopWords
-    });
-    for (const t of unstemmed.tokens) {
+  if (usesPrefix) {
+    const lastToken = queryTokens[queryTokens.length - 1];
+    for (const t of written) {
       if (t.position === lastToken.position) {
         prefixToken = t.token;
         completedToken = lastToken.token;
@@ -35748,6 +36184,7 @@ function applyHighlights(hits, params, language, analysis, readStoredDocument) {
       }
     }
   }
+  const partialWords = usesPartialWords ? partialWordTagging(params, schema, queryTokens, written, analysis) : null;
   for (const hit of hits) {
     const highlights = {};
     const projected = hit.document;
@@ -35759,14 +36196,15 @@ function applyHighlights(hits, params, language, analysis, readStoredDocument) {
         fieldValue = stored?.[field];
       }
       if (typeof fieldValue === "string") {
-        highlights[field] = highlightField(fieldValue, queryTokenResult.tokens, language, {
+        highlights[field] = highlightField(fieldValue, queryTokens, language, {
           preTag: params.highlight.preTag,
           postTag: params.highlight.postTag,
           maxSnippetLength: params.highlight.maxSnippetLength,
           prefixToken,
           completedToken,
           tolerance: params.exact === true ? 0 : params.tolerance ?? 0,
-          prefixLength: params.prefixLength ?? DEFAULT_FUZZY_PREFIX_LENGTH
+          prefixLength: params.prefixLength ?? DEFAULT_FUZZY_PREFIX_LENGTH,
+          partialWords: partialWords?.fields.has(field) === true ? partialWords.highlight : void 0
         });
       }
     }
@@ -36276,7 +36714,7 @@ async function executeQuery(params, callerContext) {
   if (params.highlight) {
     const dropped = params.highlight.fields.some((field) => !projectionKeepsField(projection, field));
     const readStoredDocument = dropped ? (docId) => manager.get(docId, { kind: "full" }) : void 0;
-    applyHighlights(paginated, params, language, manager.analysis, readStoredDocument);
+    applyHighlights(paginated, params, language, manager.analysis, manager.schema, readStoredDocument);
   }
   const elapsed = now() - startTime;
   return {
@@ -36868,4 +37306,4 @@ async function createNarsil(config) {
 // src/index.ts
 var VERSION = "0.1.0";
 
-export { ClientErrorCodes, ErrorCodes, NarsilError, ServerErrorCodes, VERSION, clearNormalizationCache, configureNormalizationCache, createNarsil, getLanguage, getNormalizationCacheSize, getStopWords, getTokenizer, hasStopWords, hasTokenizer, isNarsilError, isSimdAvailable, registerLanguage, registerPatternSearch, registerStopWords, registerTokenizer, resetNormalizationCache };
+export { ClientErrorCodes, ErrorCodes, NarsilError, ServerErrorCodes, VERSION, clearNormalizationCache, configureNormalizationCache, createNarsil, getLanguage, getNormalizationCacheSize, getStopWords, getTokenizer, hasStopWords, hasTokenizer, isNarsilError, isSimdAvailable, registerLanguage, registerPartialWordSearch, registerPatternSearch, registerStopWords, registerTokenizer, resetNormalizationCache };