---
title: "prag-vnconv-verbnet-restrictions — Mova code model"
description: "Mova code model of prag/src/vnconv.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/prag/src/vnconv.rs.groupant/verbnet.groupant/restrictions.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/prag/src/vnconv.rs.groupant/verbnet.groupant/restrictions.groupant/>

# prag-vnconv-verbnet-restrictions

The groupant beside prag/src/vnconv.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_fragment
- **status:** partial source bound model
- **source:** [`prag/src/vnconv.rs`](https://github.com/ElamurAI/mova-free/blob/main/prag/src/vnconv.rs)
- **source SHA-256:** `b5e9e5a2a3fc9359…`
- **covers:** Stack elements are (is_or,items). open pushes; item appends Value concatenated with type to top, or overwrites done if stack empty. close pops: an empty group contributes nothing; join with '|' for or else '&'; if nested and multiple items, parent receives parentheses; top-level completed groups combine with '&'. take clears stack and consumes done. (bytes 6664–7817)
- **part of:** [prag-vnconv-verbnet](https://md.groupants.elamur.ai/free/en/mova/prag/src/vnconv.rs.groupant/verbnet.groupant/)
- **repository folder:** [`prag/src/vnconv.rs.groupant/verbnet.groupant/restrictions.groupant`](https://github.com/ElamurAI/mova-free/tree/main/prag/src/vnconv.rs.groupant/verbnet.groupant/restrictions.groupant)
- **repository commit:** `855da7bd4a7b`

> **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 source model | [forward](#forward) |
| **ast** | partial | `../../syntax.json` |
| **composition** | partial source model | [composition](#composition) |
| **cost** | partial source model | [cost](#cost) |
| **descriptant** | partial source model | [epoch-memory](#epoch-memory) |
| **invariant** | partial source model | [invariant](#invariant) |
| **tests** | partial source model | [checks](#checks) |

## 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 |
|---|---|---|---|
| `prag-vnconv-verbnet-restrictions-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `prag-vnconv-verbnet-restrictions-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `prag-vnconv-verbnet-restrictions-specialization` | restriction_target | partial source model | [specialization](#specialization) |

## Model text


### forward
Stack elements are (is_or,items). open pushes; item appends Value concatenated with type to top, or overwrites done if stack empty. close pops: an empty group contributes nothing; join with '|' for or else '&'; if nested and multiple items, parent receives parentheses; top-level completed groups combine with '&'. take clears stack and consumes done.

### invariant
No logical simplification or precedence normalization. Parentheses are inserted only for nested multi-item groups. Closing an empty stack is a no-op. Literal signs and types are retained; incomplete pending groups are discarded by take.

### cost
O(K+L) stack operations plus copying expression strings at each ancestor; worst-case O(D*L) copied characters for depth D and final expression length L. O(D+L) live expression storage excluding events; no measured optimization.

### behavior-complement
Given the nested conjunction/disjunction fixture, flattened '+animate&+human|-solid' or reordered signed leaves are excluded candidates. Empty-group punctuation and a restriction leaking into a later target also violate the modeled take transition. Revision: this source hash. Observation: pure supplied-input outputs. This is a partial source-derived exclusion model with finite witness evidence, not a universal proof.

### reverse-reconstruction
The same expression can come from nested singleton groups or no singleton nesting, and omitted/empty groups leave no output. Reverse reconstruction retains all grouping stacks whose closes yield the string; precedence alone cannot identify original XML. The target is the full compatible fiber under forward and its stated domain, without unique recovery or an implemented complete solver.

### specialization
Restriction-target routing sends completed strings only to active role/NP/PREP; PREP without a value renders '{restriction}', while a value renders '{value}[restriction]'. Core stack logic is tested through a real role and syntax NP.

### composition
Children share the exact source and intermediate event/word identities. XML feeds the same class fold used by production; restriction expressions route through the active target. WordNet maps and index offsets must agree before selection and word-scoped frames. Reverse composition retains those intermediates jointly, not independently chosen marginals. Overlapping costs are counted once.

### checks
Seven vnconv::wave15_models tests exercise tiny original in-memory strings. Named old-code Unicode panic witness, compiled semantic-buffer mutation, exact restoration, twice debug and twice release with identical normalized outcomes; syntax generated twice. See root receipts.

### epoch-memory
2026-10-30: prospective review predicted unchanged valid XML/WordNet rows and no speed gain. A single checked range adds O(1) validation to pointer parsing. Public verbnet_xml and private nominal_rows expose existing production algorithms with no duplicate parser. Old pointer slice failed at byte 2 of a euro sign. Positive fixtures preserve quoted delimiters, literal escape behavior, nesting, source reset, first-sense semantics and index order. Partial syntax and source hashes identify this epoch, not semantic truth.

### limitations
This is a small tag reader, not general XML. No corpus files, live parser/teacher/GPU, converter jobs or filesystem writes executed by tests. PropBank/full NomBank conversion, external error paths and attribution truth remain unexecuted. Malformed huge counts, XML structural validation, universal Unicode linguistic handling and full lexicon correctness remain outside the finite domain. No speed, error-cap or full-system proof claim.