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

# prag-irony-scoring

The groupant beside prag/src/irony.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/irony.rs`](https://github.com/ElamurAI/mova-free/blob/main/prag/src/irony.rs)
- **source SHA-256:** `2855171f6b887782…`
- **covers:** Situations contribute one negative item; skip ADP/SCONJ lexical polarity. Negation flips sign except cannot-wait. Implicit positive-verb complement adds three; explicit preceding/governing positive-negative pair without intervening contrast adds two. Cue kinds add one each. Candidate requires pair. (bytes 8385–13881)
- **part of:** [prag-irony](https://md.groupants.elamur.ai/free/en/mova/prag/src/irony.rs.groupant/)
- **repository folder:** [`prag/src/irony.rs.groupant/scoring.groupant`](https://github.com/ElamurAI/mova-free/tree/main/prag/src/irony.rs.groupant/scoring.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-irony-scoring-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `prag-irony-scoring-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `prag-irony-scoring-coupling` | constraint_relation | partial source model | [coupling](#coupling) |

## Model text


### forward

Situations contribute one negative item; skip ADP/SCONJ lexical polarity. Negation flips sign except cannot-wait. Implicit positive-verb complement adds three; explicit preceding/governing positive-negative pair without intervening contrast adds two. Cue kinds add one each. Candidate requires pair.

### invariant

Cues alone cannot produce candidate. Positive+negative equals polar item count. Implicit pair takes precedence and candidate score is at least two.

### cost

O(N^3) conservative worst-case pair/ancestry/contrast scans, plus raw text scanning and O(N) temporary vectors.

### composition

Native supplied Words/text -> irony executes. CLI consumes candidates; hand-authored labels are finite assertions, not held-out assessment material.

### epoch-memory

2026-10-30 initial source-bound epoch. Irony malformed-head native witness panicked before bounds repair. Missing parent evidence now abstains while linear evidence remains. Lens/roles production unchanged. Costs are prospective asymptotic models; no optimization, percentage guarantee or timing claim.

### checks

cargo test -p prag --lib irony::wave12_models -- --test-threads=1. File-root evidence.md binds repeated profiles and mutants. No live parser/teacher/corpus or persisted exam evaluation.

### behavior-complement

Domain: finite inputs satisfying this fragment's forward premises and the parent API tag/state constraints; output is its scoped observation. Let J_fragment(x,y) impose the concrete relations: Situations contribute one negative item; skip ADP/SCONJ lexical polarity. Negation flips sign except cannot-wait. Implicit positive-verb complement adds three; explicit preceding/governing positive-negative pair without intervening contrast adds two. Cue kinds add one each. Candidate requires pair. Also require: Cues alone cannot produce candidate. Positive+negative equals polar item count. Implicit pair takes precedence and candidate score is at least two. The inner absent-behavior model is {(x,y): not J_fragment(x,y)}. This excludes wrong indices, selections or outputs, rather than treating a scope disclaimer as a behavioral predicate. Finite checks support selected cases; unknown external semantics remain outside this claim.

### reverse-reconstruction

Identical score admits different polarity/cue combinations; even features/pair retain many raw texts and trees. Candidate does not recover actual speaker intent. Relation B(y) retains every modeled compatible antecedent; no unique inverse or complete executed solver.

Formally retain every parent-tagged input and compatible intermediate state satisfying the forward relation with the observed fragment output. Do not merge antecedents merely because their projected result agrees; no unique inverse or complete executed solver is claimed.

### coupling

Finite oracle asserts counts, flips, longest run, polarity, score, pair and contrast/cue exclusion; supplied love/rain asserts implicit+explicit score five.

Typed entries bind the manifest revision, stated domain and observation, assuming stable compiled dependencies and bounded execution. Status is partial source-derived relation with finite named checks. Partial syntax leaves macro bodies opaque and is no semantic proof.