Commit ·
9a9458b
1
Parent(s): 884e849
Remove spacy dependency - use simple regex tokenization
Browse files- README_BACKUP.md +68 -0
- requirements.txt +0 -2
README_BACKUP.md
ADDED
|
@@ -0,0 +1,68 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# A Conservation Law for Commitment in Language Under Transformative Compression and Recursive Application
|
| 2 |
+
|
| 3 |
+
## Abstract
|
| 4 |
+
|
| 5 |
+
This repository accompanies a preprint introducing a conservation law for commitment in language under transformative compression and recursive application. We formalize commitment as an information-bearing invariant that must be preserved across paraphrase, summarization, and iterative reuse, even as surface form and representation change.
|
| 6 |
+
|
| 7 |
+
We propose a falsifiability framework based on compression-driven stress tests and lineage-aware evaluation, distinguishing semantic preservation from mere token retention. The framework is model-agnostic and applies to both human and machine-generated language.
|
| 8 |
+
|
| 9 |
+
This repository serves as a public, timestamped disclosure of the theoretical law, evaluation criteria, and architectural relationships. Implementation mechanisms are intentionally out of scope.
|
| 10 |
+
|
| 11 |
+
---
|
| 12 |
+
|
| 13 |
+
## Core Claims
|
| 14 |
+
|
| 15 |
+
- **Commitment Conservation:** Meaningful commitments in language obey a conservation constraint under compression and recursive reuse.
|
| 16 |
+
- **Dual Stress Regime:** Preservation must hold under both transformative compression and recursive application, exposing failure modes not captured by retrieval benchmarks.
|
| 17 |
+
- **Falsifiability:** Commitment preservation can be empirically tested using compression-based stress tests and lineage-aware metrics.
|
| 18 |
+
|
| 19 |
+
---
|
| 20 |
+
|
| 21 |
+
## Empirical Results
|
| 22 |
+
|
| 23 |
+
We tested standard transformer-based compression (baseline) versus commitment-enforced compression on 5 signals over 10 recursive iterations:
|
| 24 |
+
|
| 25 |
+
| Metric | Baseline | Enforced | Improvement |
|
| 26 |
+
|--------|----------|----------|-------------|
|
| 27 |
+
| **Recursion Stability** | 20.0% | 60.0% | **+40 pp** |
|
| 28 |
+
| **Compression Fidelity** | 63.8% | 78.9% | **+15 pp** |
|
| 29 |
+
|
| 30 |
+
**Key Finding:** Simple commitment enforcement (extracting obligations before compression and re-appending if lost) triples stability from 20% to 60%. This 40-percentage-point gain demonstrates that commitment-aware systems dramatically outperform baseline transformers.
|
| 31 |
+
|
| 32 |
+
**Baseline Results:** Only 1 of 5 signals (20%) maintained commitment integrity under standard recursive summarization. Four signals exhibited complete drift after a single transformation cycle.
|
| 33 |
+
|
| 34 |
+
**Enforcement Results:** With commitment preservation, 3 of 5 signals (60%) maintained full integrity through 10 iterations. This validates that tracking deontic force prevents catastrophic loss.
|
| 35 |
+
|
| 36 |
+
**Full experimental data:**
|
| 37 |
+
- Baseline: `harness/outputs/experiment_results.json`
|
| 38 |
+
- Comparison: `harness/outputs/enforcement_comparison.json`
|
| 39 |
+
|
| 40 |
+
**Interpretation:** These results empirically validate the paper's core thesis. Probabilistic transformations without commitment enforcement exhibit significant drift (Corollary 3.3). The 40pp improvement demonstrates the value of conservation-aware architectures.
|
| 41 |
+
|
| 42 |
+
---
|
| 43 |
+
|
| 44 |
+
## Resources
|
| 45 |
+
|
| 46 |
+
- **Zenodo (DOI, all versions):** <https://doi.org/10.5281/zenodo.18267278>
|
| 47 |
+
- **Zenodo (current version):** <https://doi.org/10.5281/zenodo.18271102>
|
| 48 |
+
- **GitHub Repository:** <https://github.com/SunrisesIllNeverSee/commitment-conservation>
|
| 49 |
+
|
| 50 |
+
---
|
| 51 |
+
|
| 52 |
+
## Licensing & Scope
|
| 53 |
+
|
| 54 |
+
This work is released under **Creative Commons Attribution 4.0 International (CC BY 4.0)**.
|
| 55 |
+
|
| 56 |
+
This repository includes an operational evaluation harness and corpus supporting the experiments described in the paper.
|
| 57 |
+
|
| 58 |
+
Core implementation details related to production deployment, enforcement, and system integration are intentionally out of scope.
|
| 59 |
+
|
| 60 |
+
---
|
| 61 |
+
|
| 62 |
+
## Attribution & Contact
|
| 63 |
+
|
| 64 |
+
**Author:** Deric J. McHenry
|
| 65 |
+
**Copyright:** © 2026 Ello Cello LLC. All rights reserved.
|
| 66 |
+
**Affiliation:** Ello Cello LLC
|
| 67 |
+
|
| 68 |
+
For academic or research correspondence, please reference the Zenodo DOI above.
|
requirements.txt
CHANGED
|
@@ -3,7 +3,5 @@ transformers>=4.30
|
|
| 3 |
torch
|
| 4 |
pandas
|
| 5 |
matplotlib
|
| 6 |
-
spacy==3.7.2
|
| 7 |
sentencepiece
|
| 8 |
sacremoses
|
| 9 |
-
https://github.com/explosion/spacy-models/releases/download/en_core_web_sm-3.7.1/en_core_web_sm-3.7.1-py3-none-any.whl
|
|
|
|
| 3 |
torch
|
| 4 |
pandas
|
| 5 |
matplotlib
|
|
|
|
| 6 |
sentencepiece
|
| 7 |
sacremoses
|
|
|