VSAVM

NL to query compiler

This wiki entry defines a term used across VSAVM and explains why it matters in the architecture.

The diagram has a transparent background and highlights the operational meaning of the term inside VSAVM.

Related wiki pages: VM, event stream, VSA, bounded closure, consistency contract.

Definition

An NL to query compiler transforms natural language questions into executable query programs.

Role in VSAVM

In VSAVM, compilation is central because it makes questions operational and auditable. It enables answers derived by execution and bounded closure rather than by free-form continuation.

Mechanics and implications

The compiler retrieves candidate schemas, fills typed slots, emits a program, and evaluates candidates with early closure checks. Multiple candidates can be kept in a beam to handle ambiguity explicitly and to support conditional results.

Further reading

Program synthesis provides a useful analogy: propose programs and validate them against constraints. VSAVM applies this pattern to query programs guided by retrieval and compression pressure.

query-compiler diagram
Questions become executable programs via schemas, with search and closure validation enforcing correctness.

References

Program synthesis (Wikipedia) Beam search (Wikipedia) Information retrieval (Wikipedia)