Word-root query interface — graded belief over derivation edges, any language

NameDescription

Walk each root word of any language and ask for related children, answered with a yes, a confidence, and a conviction, filtered at a caller-provided threshold. Shipped as form-stdlib/word-roots.fk (PR #2900, band verdict 511 three-way): (word-children lang root thr), (word-related? lang root child thr) → (yes, confidence, conviction), (word-walk) with chained belief — confidence multiplies along derivation chains, conviction takes the minimum. Two belief lanes kept separate: confidence = evidence strength, conviction = breadth of independent attestation. Honest no carries its measures; unknown pairs answer (0, 0.0, 0.0). Edges are data (en give→forgiveness, de geben→Vergebung with Gift as the semantic-drift threshold test, sa √kṛ per IAST discipline); a new language is rows, never a code path. North star: edges migrate from in-recipe rows to WORD-domain substrate cells with root-of edges, queryable through /api/substrate doors; the full Dhātupāṭha and etymological corpora ingest as attested data.

Potential value (USD)Estimated cost (USD)Confidence (0–1)