Supernova Roman Restoration V4
High-performance deterministic Romanized Nepali restoration using the Supernova V2 + V3.1 systems with a Cython-optimized longest-match trie.
V4 is designed around one principle:
Use deterministic linguistic evidence instead of a large pretrained generative model when the task can be solved reliably with explicit mappings and rules.
🚀 Overview
Supernova Roman Restoration V4 combines:
INPUT
│
▼
Script / Language Route
│
┌───────────┴───────────┐
│ │
▼ ▼
Romanized Nepali General Text
│ │
▼ ▼
V3.1 V2
│ │
└───────────┬───────────┘
▼
Cython Longest-
Match Trie
│
▼
OUTPUT
- Downloads last month
- 16
Inference Providers NEW
This model isn't deployed by any Inference Provider. 🙋 Ask for provider support