code wiki / _hdl_build / nx_bm25_test.nx
nx_bm25_test.nx
buildroot/runtime/_hdl_build/nx_bm25_test.nx
about
nx_bm25_test.nx -- prove the team's integer BM25 reproduces the PRODUCTION ranking and corrects the
old TF-IDF ranker's length bias. Corpus is engineered so length-normalization FLIPS the winner:
doc0 "injury injury" (tf=2, dl=2 -- short + focused)
doc1 "injury injury injury f f f f f f f f f" (tf=3, dl=12 -- more hits but diluted)
Naive tf*idf (no length norm) picks doc1 (higher raw tf). BM25 picks doc0 (focused), which matches a
float reference BM25 -- the triangulation the runner checks. Exit 0 if the team's logic holds 5/5;
the runner then confirms the team's BM25_BEST == the Python reference's. license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_bm25.nxnx_research_extract.nxnx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 13 | func bt_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 14 | func bt_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;k=1}; while m>0 {t[k]=48+(m%10); 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 } |
| 16 | func main() -> i64 |