---
title: "translation-meta-rules — Mova code model"
description: "Mova code model of tools/translate/src/rules.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/tools/translate/src/rules.rs.groupant/"
---
Elamur: [Mova](https://md.mova.elamur.ai/free/en/) · [Dictionary](https://md.dictionary.elamur.ai/free/en/) · [Research](https://md.research.elamur.ai/free/en/) · **Groupants**

This page as HTML: <https://groupants.elamur.ai/free/en/mova/tools/translate/src/rules.rs.groupant/>

# translation-meta-rules

The groupant beside tools/translate/src/rules.rs in the Mova repository: what the code computes, what it never does, how to go back from its outputs, its invariants, cost and checks.

## Facts

- **kind:** groupant
- **status:** partial source bound model
- **source:** [`tools/translate/src/rules.rs`](https://github.com/ElamurAI/mova-free/blob/main/tools/translate/src/rules.rs)
- **source SHA-256:** `75efe37eaf50694d…`
- **repository folder:** [`tools/translate/src/rules.rs.groupant`](https://github.com/ElamurAI/mova-free/tree/main/tools/translate/src/rules.rs.groupant)
- **repository commit:** `48f2e6f74146`

> **Implementation material.** A Mova code model describes this code at one source revision: partial models, finite checks and their stated scope. It is not a reviewed general exposition, and its labels are shown as written, never raised.

## Components

| component | label | where |
|---|---|---|
| **approximant** | partial | [approximant](#approximant) |
| **ast** | partial | `syntax.json` |
| **composition** | partial | [composition](#composition) |
| **cost** | symbolic source derived | [invariant](#invariant) |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [invariant](#invariant) |
| **tests** | bounded native receipts | [tests](#tests) |

## Obernants

The typed relations around the forward model: the behaviour complement (what the code never does), the reverse reconstruction (every input compatible with an output) and specialised views.

| id | type | label | where |
|---|---|---|---|
| `behavior_complement` | behavior_complement | partial source derived model | [behavior_complement](#behavior-complement) |
| `reverse_reconstruction` | reverse_reconstruction | partial source derived model | [reverse_reconstruction](#reverse-reconstruction) |
| `drop_coordinate` | drop_coordinate | partial source derived model | [drop_coordinate](#drop-coordinate) |
| `fold_join` | fold_join | partial source derived model | [fold_join](#fold-join) |
| `candidate_support` | candidate_support | partial source derived model | [candidate_support](#candidate-support) |
| `signed_gain` | signed_gain | partial source derived model | [signed_gain](#signed-gain) |

## Parts

- [translation-meta-rules-apply](https://md.groupants.elamur.ai/free/en/mova/tools/translate/src/rules.rs.groupant/apply.groupant/)

## Model text


### descriptant

#### Description and epoch memory

Rule Concept/Tag rewrites matching tokens, Drop removes concepts and reattaches through deleted ancestors. candidates inspect reader residual Take patches then source leftovers. learn uses opposite-fold support, max30 per fold, positive total gain ranking, then greedy positive steps among first top.

##### Prospective epoch 2026-10-31

Models predicted metadata loss, bounded coordinate transport and deterministic tie selection before test changes. Production bytes are preserved; only five inline synthetic tests were appended across the group.

##### Observation epoch 2026-10-31

Selected named native tests are bound in tests.md; raw receipts are external under $MOVA_DATA/runs/octopus-wave32-tr_meta-2026-10-31. Syntax is generated twice and byte-compared. This is partial syntax without macro expansion or semantic resolution.

##### Gaps

No real annotator/model loads, corpus translation, teacher calls, GPU, full training/evaluation, or language-accuracy claim. No executable percentage surrogate is supplied: an appropriate reference metric/domain is not established. Supported future caps are1/2/5/10 percent only. Residual reconstruction is conditional on retained diagnostics and is not persistent learning.

### approximant

#### Forward relation

Rule Concept/Tag rewrites matching tokens, Drop removes concepts and reattaches through deleted ancestors. candidates inspect reader residual Take patches then source leftovers. learn uses opposite-fold support, max30 per fold, positive total gain ranking, then greedy positive steps among first top.

### invariant

#### Invariant and cost

##### Domain and preservation

Acyclic in-range dependency heads for Drop termination; fold0/1 intended; scalar reader gains finite. min_support/top arbitrary bounded usize; no full training run.

##### Cost

Concept/Tag O(n+bytes), Drop O(n²) worst chain and O(n) memory; learn O(V*reader_cost + C*V*(reader_cost+n²)) plus sorting; C<=60 distinct admitted fold candidates.

Counters and allocation arithmetic must remain representable. String/map costs include compared bytes; finite evidence is not a throughput estimate.

### composition

#### Local composition

The child isolates the translation-meta-rules-apply relation inside this source. Its observation is a projection of the complete file relation described in approximant.md; costs overlap and must not be added twice. The remaining code supplies context/table inputs and consumes outputs. External joins: meta MTok feeds profile, Hebrew encoder, fwt and rules; meta LCS feeds logic and alignment-based training; Strong labels optionally override IBM ownership. No runtime chain between all children is asserted.

### models

## Typed models

Subject: exact source hash in manifest; observation is one call or the stated finite training pass. All models are partial source-derived relations, not universal proof. Domain and resource assumptions are in invariant.md. The baseline exclusion is an inner source-derived claim on that domain; reverse is a compatible-antecedent relation. Specialized relations hold fixed the parameters and tables unless stated otherwise. Evidence uses the named checks in tests.md; individual assertions cover only finite parts, other branches remain prospective.

### behavior_complement

Untouched Concept/Tag cannot alter heads/spans. Greedy never accepts nonpositive step; filtering happens after take(top), so may keep fewer than top despite later useful rules.

### reverse_reconstruction

Concept/Tag preimages alias target values and matching source values; Drop loses removed tokens and ancestry paths. Found gain/support do not identify a unique corpus.

### drop_coordinate

new_id is prefix kept count; surviving head maps after climbing deleted ancestors.

### fold_join

Rules trained where fold!=test_fold, evaluated where fold==test_fold.

### candidate_support

Per verse candidates sorted/dedup before support increment.

### signed_gain

gain=baseline-after may be negative; only positive total retained then step recomputed.

### tests

#### Checks and evidence

- rules::tests::drop_reattaches_and_a_rule_that_fixes_gains

Exact cargo commands use package translate, binary translate, --offline --locked and -- --exact --test-threads=1. External native-commands.json lists every name; debug and release run twice, numerical status and named outcomes retained. Some tests target other portions of the file; this fragment has source reasoning plus only the overlapping assertions.

Compiled controls mutate production decision expressions and restore exact original bytes; see external mutations.json and restoration receipt. No assertion-only mutation is counted. The evidence summary is authoritative for completed receipts. Scoped source reasoning and finite tests do not establish total branch coverage.

##### Recorded 2026-10-31 result

This source contributes 1 exact named checks to the 18-check group. Every name passes twice in debug and twice in release, with identical sorted outcomes. A compiled production mutation in rules.rs was rejected by its selected runtime assertion; its original and restored SHA-256 match. All 18 checks pass again after all nine restorations. There were nine rejected production mutations, zero assertion-only mutations and zero surviving controls in this batch. Nine source projections matched byte-for-byte across two generations. No original production bytes changed.

The augmented-registry check has no owned source or fragment diagnostic. Only root-owned inference-core/mova child/source bindings await integration. A first isolated-registry experiment was unsuitable because the checker inspects unrelated existing sidecars; those failures are retained separately and are not counted as semantic controls.