code wiki / _hdl_build / nx_bm25f_gate.nx

nx_bm25f_gate.nx

buildroot/runtime/_hdl_build/nx_bm25f_gate.nx

8694 B129 linesdepth 5pulls 5 transitivereach 0 importersview sourcekind gate/proof
docsdependenciesstructsconstsfunctions

about

nx_bm25f_gate.nx -- MEASURED proof that BM25F (fielded) beats plain BM25 on the property that matters for onsite search: a query term in the TITLE should win over the same term buried in the BODY. Two docs: doc0 title="estate planning services" body="we help utah families with care and guidance" (estate in TITLE) doc1 title="family law attorney" body="we also handle estate matters for clients today" (estate in BODY) Oracle (all checked from the live scorers, not asserted): R1 BM25F: query 'estate' -> doc0 (TITLE hit ranks #1) R2 plain BM25 body-only: query 'estate' -> doc1 (BODY hit) -- so BM25F FLIPPED the ranking toward the title R3 BM25F: query 'family' -> doc1 (its TITLE) R4 plain BM25 body-only: query 'family' -> -1 (NO body contains it) -- BM25F adds TITLE-FIELD RECALL the body-only ranker misses entirely GREEN iff 4/4. Durable knowledge/status/bm25f_gate.log. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_bm25f.nx nx_syscalls.nx nx_bm25f_gate.nx

imports: nx_bm25f.nxnx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main f_puts sys_write sys_mmap f_strlen bmf_best bmf_score re_count re_strlen bmf_contrib bmf_df re_count ↻ bm_idf_micro bm_ln_micro f_num sys_mmap ↻ sys_write ↻ sys_openat_append f_w sys_write ↻ f_wn sys_mmap ↻ sys_write ↻ sys_close sys_exit

structs

none

consts

none

functions

15func f_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
called by 1: main calls 1: sys_write
16func f_num(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(1,"-" as *u8,1)}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=(48 as u8);k=1}; while m>0{t[k]=((48+(m%10)) as u8);m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(1,bb,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
17func f_w(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 }
called by 1: main calls 1: sys_write
18func f_wn(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=(48 as u8);k=1}; while m>0{t[k]=((48+(m%10)) as u8);m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
19func f_strlen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: main
21func main() -> i64
calls 10: f_putssys_mmapf_strlenbmf_bestf_numsys_openat_append+4