mni / README.md
omarkamali's picture
Upload all models and assets for mni (latest)
3b4c568 verified
---
language: mni
language_name: Manipuri
language_family: tibetoburman_other
tags:
- wikilangs
- nlp
- tokenizer
- embeddings
- n-gram
- markov
- wikipedia
- feature-extraction
- sentence-similarity
- tokenization
- n-grams
- markov-chain
- text-mining
- fasttext
- babelvec
- vocabulous
- vocabulary
- monolingual
- family-tibetoburman_other
license: mit
library_name: wikilangs
pipeline_tag: text-generation
datasets:
- omarkamali/wikipedia-monthly
dataset_info:
name: wikipedia-monthly
description: Monthly snapshots of Wikipedia articles across 300+ languages
metrics:
- name: best_compression_ratio
type: compression
value: 4.321
- name: best_isotropy
type: isotropy
value: 0.6424
- name: vocabulary_size
type: vocab
value: 0
generated: 2026-01-10
---
# Manipuri - Wikilangs Models
## Comprehensive Research Report & Full Ablation Study
This repository contains NLP models trained and evaluated by Wikilangs, specifically on **Manipuri** Wikipedia data.
We analyze tokenizers, n-gram models, Markov chains, vocabulary statistics, and word embeddings.
## ๐Ÿ“‹ Repository Contents
### Models & Assets
- Tokenizers (8k, 16k, 32k, 64k)
- N-gram models (2, 3, 4, 5-gram)
- Markov chains (context of 1, 2, 3, 4 and 5)
- Subword N-gram and Markov chains
- Embeddings in various sizes and dimensions (aligned and unaligned)
- Language Vocabulary
- Language Statistics
![Performance Dashboard](visualizations/performance_dashboard.png)
### Analysis and Evaluation
- [1. Tokenizer Evaluation](#1-tokenizer-evaluation)
- [2. N-gram Model Evaluation](#2-n-gram-model-evaluation)
- [3. Markov Chain Evaluation](#3-markov-chain-evaluation)
- [4. Vocabulary Analysis](#4-vocabulary-analysis)
- [5. Word Embeddings Evaluation](#5-word-embeddings-evaluation)
- [6. Morphological Analysis (Experimental)](#6--morphological-analysis-experimental)
- [7. Summary & Recommendations](#7-summary--recommendations)
- [Metrics Glossary](#appendix-metrics-glossary--interpretation-guide)
- [Visualizations Index](#visualizations-index)
---
## 1. Tokenizer Evaluation
![Tokenizer Compression](visualizations/tokenizer_compression.png)
![Tokenizer Fertility](visualizations/tokenizer_fertility.png)
![Tokenizer OOV](visualizations/tokenizer_oov.png)
![Total Tokens](visualizations/tokenizer_total_tokens.png)
### Results
| Vocab Size | Compression | Avg Token Len | UNK Rate | Total Tokens |
|------------|-------------|---------------|----------|--------------|
| **8k** | 3.393x | 3.40 | 0.2560% | 174,579 |
| **16k** | 3.741x | 3.75 | 0.2824% | 158,309 |
| **32k** | 4.017x | 4.02 | 0.3031% | 147,458 |
| **64k** | 4.321x ๐Ÿ† | 4.33 | 0.3261% | 137,077 |
### Tokenization Examples
Below are sample sentences tokenized with each vocabulary size:
**Sample 1:** `๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ› ๊ฏ„๊ฏ”๊ฏค๊ฏก (๊ฏ•๊ฏจ๊ฏ› ๊ฏ๊ฏค๊ฏ”๊ฏค๊ฏ) ๊ฏ‘๊ฏ๊ฏค ๊ฏ‘๊ฏ‰๊ฏฅ๊ฏก๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค ๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ›๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค ๊ฏƒ๊ฏ…๊ฏจ๊ฏก๊ฏ—๊ฏ’๊ฏค ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏซ ๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ› โ–๊ฏ„๊ฏ”๊ฏค๊ฏก โ–( ๊ฏ•๊ฏจ๊ฏ› โ–๊ฏ๊ฏค๊ฏ”๊ฏค๊ฏ ) โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ‘๊ฏ‰๊ฏฅ๊ฏก๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ›๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ…๊ฏจ๊ฏก๊ฏ—๊ฏ’๊ฏค ... (+7 more)` | 17 |
| 16k | `โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ› โ–๊ฏ„๊ฏ”๊ฏค๊ฏก โ–( ๊ฏ•๊ฏจ๊ฏ› โ–๊ฏ๊ฏค๊ฏ”๊ฏค๊ฏ ) โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ‘๊ฏ‰๊ฏฅ๊ฏก๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ›๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ…๊ฏจ๊ฏก๊ฏ—๊ฏ’๊ฏค ... (+7 more)` | 17 |
| 32k | `โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ› โ–๊ฏ„๊ฏ”๊ฏค๊ฏก โ–( ๊ฏ•๊ฏจ๊ฏ› โ–๊ฏ๊ฏค๊ฏ”๊ฏค๊ฏ ) โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ‘๊ฏ‰๊ฏฅ๊ฏก๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ›๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ…๊ฏจ๊ฏก๊ฏ—๊ฏ’๊ฏค ... (+7 more)` | 17 |
| 64k | `โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ› โ–๊ฏ„๊ฏ”๊ฏค๊ฏก โ–( ๊ฏ•๊ฏจ๊ฏ› โ–๊ฏ๊ฏค๊ฏ”๊ฏค๊ฏ ) โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ‘๊ฏ‰๊ฏฅ๊ฏก๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ›๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ…๊ฏจ๊ฏก๊ฏ—๊ฏ’๊ฏค ... (+7 more)` | 17 |
**Sample 2:** `๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค๊ฏซ ๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏฑ ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ—๊ฏค ๊ฏ…๊ฏค๊ฏซ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ—๊ฏ’๊ฏค โ–๊ฏ๊ฏฆ๊ฏŸ๊ฏ… โ–๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏƒ๊ฏ…๊ฏค๊ฏซ โ–๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏฑ ... (+11 more)` | 21 |
| 16k | `โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ—๊ฏ’๊ฏค โ–๊ฏ๊ฏฆ๊ฏŸ๊ฏ… โ–๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏƒ๊ฏ…๊ฏค๊ฏซ โ–๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏฑ ... (+11 more)` | 21 |
| 32k | `โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ—๊ฏ’๊ฏค โ–๊ฏ๊ฏฆ๊ฏŸ๊ฏ… โ–๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏƒ๊ฏ…๊ฏค๊ฏซ โ–๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏฑ ... (+11 more)` | 21 |
| 64k | `โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ—๊ฏ’๊ฏค โ–๊ฏ๊ฏฆ๊ฏŸ๊ฏ… โ–๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏ‘๊ฏƒ๊ฏ…๊ฏค๊ฏซ โ–๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค โ–๊ฏƒ๊ฏ๊ฏค๊ฏก โ–๊ฏฑ ... (+11 more)` | 21 |
**Sample 3:** `๊ฏ‘๊ฏ‚๊ฏค ๊ฏ๊ฏฅ๊ฏ“๊ฏœ ๊ฏ‘๊ฏ๊ฏค ๊ฏ๊ฏŸ๊ฏ—๊ฏค๊ฏŒ๊ฏฅ๊ฏ’๊ฏค ๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค ๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ’๊ฏค ๊ฏ•๊ฏฃ๊ฏœ๊ฏ‚๊ฏค๊ฏ‹๊ฏจ๊ฏ— (๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค ๊ฏƒ๊ฏƒ๊ฏค ๊ฏ€๊ฏจ๊ฏ๊ฏƒ๊ฏฉ)๊ฏ’๊ฏค ๊ฏ๊ฏ›๊ฏ‡๊ฏ ๊ฏ‚๊ฏฅ๊ฏก๊ฏ• ๊ฏ๊ฏค๊ฏŸ๊ฏ‚๊ฏฃ๊ฏข ...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–๊ฏ‘ ๊ฏ‚๊ฏค โ–๊ฏ๊ฏฅ ๊ฏ“ ๊ฏœ โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ๊ฏŸ๊ฏ—๊ฏค๊ฏŒ๊ฏฅ๊ฏ’๊ฏค โ–๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค โ–๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ’๊ฏค โ–๊ฏ•๊ฏฃ๊ฏœ๊ฏ‚๊ฏค๊ฏ‹๊ฏจ๊ฏ— ... (+18 more)` | 28 |
| 16k | `โ–๊ฏ‘๊ฏ‚๊ฏค โ–๊ฏ๊ฏฅ ๊ฏ“ ๊ฏœ โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ๊ฏŸ๊ฏ—๊ฏค๊ฏŒ๊ฏฅ๊ฏ’๊ฏค โ–๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค โ–๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ’๊ฏค โ–๊ฏ•๊ฏฃ๊ฏœ๊ฏ‚๊ฏค๊ฏ‹๊ฏจ๊ฏ— โ–( ... (+17 more)` | 27 |
| 32k | `โ–๊ฏ‘๊ฏ‚๊ฏค โ–๊ฏ๊ฏฅ ๊ฏ“ ๊ฏœ โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ๊ฏŸ๊ฏ—๊ฏค๊ฏŒ๊ฏฅ๊ฏ’๊ฏค โ–๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค โ–๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ’๊ฏค โ–๊ฏ•๊ฏฃ๊ฏœ๊ฏ‚๊ฏค๊ฏ‹๊ฏจ๊ฏ— โ–( ... (+17 more)` | 27 |
| 64k | `โ–๊ฏ‘๊ฏ‚๊ฏค โ–๊ฏ๊ฏฅ๊ฏ“๊ฏœ โ–๊ฏ‘๊ฏ๊ฏค โ–๊ฏ๊ฏŸ๊ฏ—๊ฏค๊ฏŒ๊ฏฅ๊ฏ’๊ฏค โ–๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค โ–๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ’๊ฏค โ–๊ฏ•๊ฏฃ๊ฏœ๊ฏ‚๊ฏค๊ฏ‹๊ฏจ๊ฏ— โ–( ๊ฏ๊ฏค๊ฏŸ๊ฏ—๊ฏค โ–๊ฏƒ๊ฏƒ๊ฏค ... (+15 more)` | 25 |
### Key Findings
- **Best Compression:** 64k achieves 4.321x compression
- **Lowest UNK Rate:** 8k with 0.2560% unknown tokens
- **Trade-off:** Larger vocabularies improve compression but increase model size
- **Recommendation:** 32k vocabulary provides optimal balance for production use
---
## 2. N-gram Model Evaluation
![N-gram Perplexity](visualizations/ngram_perplexity.png)
![N-gram Unique](visualizations/ngram_unique.png)
![N-gram Coverage](visualizations/ngram_coverage.png)
### Results
| N-gram | Variant | Perplexity | Entropy | Unique N-grams | Top-100 Coverage | Top-1000 Coverage |
|--------|---------|------------|---------|----------------|------------------|-------------------|
| **2-gram** | Word | 1,742 | 10.77 | 10,310 | 35.2% | 72.4% |
| **2-gram** | Subword | 1,226 ๐Ÿ† | 10.26 | 15,112 | 41.9% | 79.3% |
| **3-gram** | Word | 1,239 | 10.28 | 9,547 | 36.7% | 82.6% |
| **3-gram** | Subword | 7,080 | 12.79 | 65,488 | 23.1% | 50.6% |
| **4-gram** | Word | 1,700 | 10.73 | 18,256 | 32.5% | 80.1% |
| **4-gram** | Subword | 22,325 | 14.45 | 195,890 | 16.2% | 37.5% |
| **5-gram** | Word | 1,478 | 10.53 | 14,280 | 31.6% | 83.2% |
| **5-gram** | Subword | 35,425 | 15.11 | 266,503 | 14.0% | 33.1% |
### Top 5 N-grams by Size
**2-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ` | 9,094 |
| 2 | `๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค` | 6,658 |
| 3 | `๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก` | 5,847 |
| 4 | `๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ•` | 5,424 |
| 5 | `๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ` | 4,237 |
**3-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก` | 5,408 |
| 2 | `๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ•` | 4,147 |
| 3 | `๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ` | 3,732 |
| 4 | `๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก` | 3,724 |
| 5 | `๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ…` | 2,348 |
**4-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก` | 4,146 |
| 2 | `๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ` | 3,723 |
| 3 | `๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ•` | 2,348 |
| 4 | `๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ…` | 2,348 |
| 5 | `๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค` | 1,590 |
**5-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก` | 2,348 |
| 2 | `๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ•` | 2,348 |
| 3 | `๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค` | 1,585 |
| 4 | `๊ฏ‘๊ฏ๊ฏค ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก` | 1,585 |
| 5 | `๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ•` | 1,582 |
**2-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ ๊ฏƒ` | 104,012 |
| 2 | `_ ๊ฏ‘` | 89,663 |
| 3 | `๊ฏก _` | 60,916 |
| 4 | `๊ฏ’๊ฏค _` | 53,149 |
| 5 | `๊ฏ๊ฏค ๊ฏก` | 47,278 |
**3-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ ๊ฏ‘ ๊ฏƒ` | 33,170 |
| 2 | `_ ๊ฏƒ ๊ฏ๊ฏค` | 28,206 |
| 3 | `๊ฏ๊ฏค ๊ฏก _` | 26,827 |
| 4 | `_ ๊ฏ‘ ๊ฏ๊ฏค` | 22,140 |
| 5 | `๊ฏƒ ๊ฏ๊ฏค ๊ฏก` | 19,797 |
**4-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ ๊ฏ‘ ๊ฏ๊ฏค _` | 18,348 |
| 2 | `_ ๊ฏƒ ๊ฏ๊ฏค ๊ฏก` | 16,785 |
| 3 | `๊ฏƒ ๊ฏ๊ฏค ๊ฏก _` | 16,509 |
| 4 | `๊ฏ๊ฏค ๊ฏก _ ๊ฏ‘` | 14,961 |
| 5 | `_ ๊ฏ‘ ๊ฏƒ ๊ฏ…๊ฏค` | 11,342 |
**5-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ ๊ฏƒ ๊ฏ๊ฏค ๊ฏก _` | 13,768 |
| 2 | `๊ฏƒ ๊ฏ๊ฏค ๊ฏก _ ๊ฏ‘` | 11,210 |
| 3 | `๊ฏ‘ ๊ฏƒ ๊ฏ๊ฏจ ๊ฏก _` | 10,162 |
| 4 | `_ ๊ฏ‘ ๊ฏƒ ๊ฏ๊ฏจ ๊ฏก` | 10,153 |
| 5 | `_ ๊ฏƒ ๊ฏ‡๊ฏฆ ๊ฏก _` | 9,972 |
### Key Findings
- **Best Perplexity:** 2-gram (subword) with 1,226
- **Entropy Trend:** Decreases with larger n-grams (more predictable)
- **Coverage:** Top-1000 patterns cover ~33% of corpus
- **Recommendation:** 4-gram or 5-gram for best predictive performance
---
## 3. Markov Chain Evaluation
![Markov Entropy](visualizations/markov_entropy.png)
![Markov Contexts](visualizations/markov_contexts.png)
![Markov Branching](visualizations/markov_branching.png)
### Results
| Context | Variant | Avg Entropy | Perplexity | Branching Factor | Unique Contexts | Predictability |
|---------|---------|-------------|------------|------------------|-----------------|----------------|
| **1** | Word | 0.7036 | 1.629 | 3.89 | 86,410 | 29.6% |
| **1** | Subword | 1.2295 | 2.345 | 13.46 | 2,717 | 0.0% |
| **2** | Word | 0.1754 | 1.129 | 1.33 | 335,779 | 82.5% |
| **2** | Subword | 0.8032 | 1.745 | 4.49 | 36,564 | 19.7% |
| **3** | Word | 0.0432 | 1.030 | 1.06 | 446,350 | 95.7% |
| **3** | Subword | 0.5398 | 1.454 | 2.69 | 164,127 | 46.0% |
| **4** | Word | 0.0126 ๐Ÿ† | 1.009 | 1.02 | 471,596 | 98.7% |
| **4** | Subword | 0.3671 | 1.290 | 1.81 | 440,820 | 63.3% |
### Generated Text Samples (Word-based)
Below are text samples generated from each word-based Markov chain model:
**Context Size 1:**
1. `๊ฏ‘๊ฏ๊ฏค ๊ฏ•๊ฏค ๊ฏ—๊ฏค ๊ฏ‘๊ฏฆ๊ฏ‚๊ฏฆ๊ฏ๊ฏ•๊ฏ”๊ฏ‡๊ฏ€๊ฏค ๊ฏ‘๊ฏฆ๊ฏŸ๊ฏ๊ฏฅ๊ฏ๊ฏ›๊ฏ‚๊ฏฃ๊ฏ„๊ฏค๊ฏ—๊ฏค ๊ฏ‘๊ฏƒ๊ฏ๊ฏจ๊ฏก ๊ฏ‚๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ๊ฏ‡๊ฏค๊ฏ› ๊ฏ‡๊ฏง๊ฏ…๊ฏ•๊ฏฅ ๊ฏ…๊ฏฅ๊ฏ ๊ฏ€๊ฏค ๊ฏ‘๊ฏฃ๊ฏ๊ฏ• ๊ฏ‹๊ฏฅ๊ฏŠ๊ฏฃ๊ฏ› ๊ฏ‚๊ฏ๊ฏ–๊ฏค๊ฏก ๊ฏ‚๊ฏ๊ฏ‡๊ฏฅ๊ฏ›๊ฏ„ ๊ฏ‘๊ฏ—๊ฏจ๊ฏ—๊ฏค ๊ฏ‘๊ฏ๊ฏจ๊ฏ๊ฏ๊ฏจ๊ฏ•`
2. `๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ๊ฏฅ๊ฏ๊ฏ„๊ฏ‡๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏฆ ๊ฏƒ๊ฏŠ๊ฏช๊ฏ€๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏธ๊ฏน๊ฏน ๊ฏ๊ฏฅ๊ฏŽ๊ฏ• ๊ฏ‚๊ฏฉ๊ฏ• ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค ๊ฏƒ๊ฏค๊ฏ‡๊ฏฉ๊ฏ€๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก ๊ฏ๊ฏŒ๊ฏฆ๊ฏ›๊ฏ… ๊ฏ๊ฏฆ๊ฏ๊ฏ„๊ฏ…๊ฏฆ`
3. `๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ๊ฏฅ๊ฏ๊ฏ„๊ฏ‡๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก ๊ฏ๊ฏŒ๊ฏฆ๊ฏ›๊ฏ… ๊ฏ๊ฏฆ๊ฏ๊ฏ„๊ฏ…๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏธ๊ฏฐ๊ฏฐ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏƒ๊ฏ„๊ฏฅ๊ฏŸ๊ฏ’ ๊ฏ๊ฏ๊ฏ…๊ฏ•๊ฏ๊ฏค๊ฏก out in ukrainian`
**Context Size 2:**
1. `๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏƒ๊ฏƒ๊ฏค ๊ฏ€๊ฏจ๊ฏ๊ฏƒ๊ฏฉ ๊ฏ๊ฏ›๊ฏ‡๊ฏ ๊ฏ‚๊ฏฅ๊ฏก๊ฏ•๊ฏค ๊ฏ‘๊ฏฃ๊ฏข๊ฏˆ๊ฏค ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ๊ฏ๊ฏฉ๊ฏ๊ฏค๊ฏก`
2. `๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ—๊ฏค ๊ฏ…๊ฏค ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ`
3. `๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ—๊ฏค ๊ฏ…๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ— ๊ฏŒ๊ฏฆ๊ฏก๊ฏ‚๊ฏ—๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค ๊ฏƒ๊ฏค๊ฏ‡๊ฏฉ๊ฏ€๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก ๊ฏ๊ฏŒ๊ฏฆ๊ฏ›๊ฏ… ๊ฏ๊ฏฆ๊ฏ๊ฏ„๊ฏ…๊ฏฆ ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏ๊ฏค`
**Context Size 3:**
1. `๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ—๊ฏค ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏ€๊ฏฅ๊ฏˆ๊ฏŸ ๊ฏด ๊ฏ‚๊ฏฉ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ`
2. `๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏค๊ฏ›๊ฏ๊ฏค๊ฏก khamlangba erengba puwaree neinarol by yaima lamgdum kakching ha...`
3. `๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ„๊ฏ…๊ฏฅ๊ฏ๊ฏค๊ฏก ๊ฏ„๊ฏ…๊ฏฅ`
**Context Size 4:**
1. `๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏƒ๊ฏŒ๊ฏฅ๊ฏ๊ฏ’๊ฏค ๊ฏ‘๊ฏ๊ฏจ๊ฏž๊ฏ„ ๊ฏ†๊ฏ ๊ฏ… ๊ฏ€๊ฏฅ๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ๊ฏค๊ฏก`
2. `๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏฑ ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ—๊ฏค ๊ฏ…๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ— ๊ฏŒ๊ฏฆ๊ฏก๊ฏ‚๊ฏ—๊ฏค`
3. `๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ ๊ฏ—๊ฏ’๊ฏค ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏ—๊ฏ’๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏฑ ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• ๊ฏƒ๊ฏ๊ฏค๊ฏก ๊ฏ—๊ฏค ๊ฏ…๊ฏค ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ†๊ฏฉ๊ฏ๊ฏค๊ฏก๊ฏ‚๊ฏฃ๊ฏŸ ๊ฏ— ๊ฏŒ๊ฏฆ๊ฏก๊ฏ‚๊ฏ—๊ฏค ๊ฏƒ๊ฏ๊ฏค๊ฏก`
### Generated Text Samples (Subword-based)
Below are text samples generated from each subword-based Markov chain model:
**Context Size 1:**
1. `_๊ฏฑ_๊ฏ‚๊ฏง๊ฏ๊ฏค๊ฏ…_๊ฏ‘๊ฏƒ๊ฏ๊ฏค๊ฏก๊ฏ„๊ฏค_๊ฏ…๊ฏฃ๊ฏ_`
2. `๊ฏƒ๊ฏ†๊ฏ ๊ฏ‡๊ฏฆ๊ฏ๊ฏŠ๊ฏฃ๊ฏ›๊ฏ€๊ฏค_๊ฏƒ๊ฏ—๊ฏค๊ฏ‚๊ฏฃ๊ฏŸ_๊ฏƒ๊ฏ›`
3. `๊ฏก_๊ฏƒ๊ฏฅ_๊ฏ๊ฏฃ๊ฏŸ_๊ฏ†๊ฏฅ๊ฏŽ๊ฏ†๊ฏฆ๊ฏŸ๊ฏ…๊ฏ”๊ฏค๊ฏ•_๊ฏ†๊ฏฅ`
**Context Size 2:**
1. `_๊ฏƒ๊ฏŒ๊ฏฆ๊ฏ›๊ฏ‡๊ฏค_"le_phe_ger`
2. `_๊ฏ‘๊ฏ๊ฏค_๊ฏ‘๊ฏฃ๊ฏ—๊ฏค๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค_๊ฏ๊ฏง๊ฏ”๊ฏ€๊ฏˆ๊ฏค_๊ฏซ_`
3. `๊ฏก_๊ฏ‘๊ฏ†๊ฏง๊ฏ„_๊ฏ€๊ฏช๊ฏ‚๊ฏฉ๊ฏ„๊ฏฅ๊ฏ›_๊ฏ‘๊ฏƒ๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ_`
**Context Size 3:**
1. `_๊ฏ‘๊ฏƒ๊ฏ๊ฏจ_๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ_๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก_๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ`
2. `_๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ_๊ฏŒ๊ฏฆ๊ฏก๊ฏ‰๊ฏจ_๊ฏด๊ฏฐ_(๊ฏ†๊ฏฅ๊ฏ๊ฏจ๊ฏ_(`
3. `๊ฏ๊ฏค๊ฏก_๊ฏ‘๊ฏƒ๊ฏ—๊ฏ’๊ฏค_๊ฏƒ๊ฏ๊ฏจ๊ฏ ๊ฏ‡,_๊ฏ๊ฏฆ๊ฏ—๊ฏค๊ฏ๊ฏ‡`
**Context Size 4:**
1. `_๊ฏ‘๊ฏ๊ฏค_๊ฏ‘๊ฏ†๊ฏง๊ฏ•_๊ฏ‘๊ฏ†๊ฏฅ๊ฏ„๊ฏฃ๊ฏ _๊ฏ‘๊ฏƒ๊ฏ—๊ฏฅ_๊ฏ‘๊ฏฃ๊ฏ„๊ฏฆ`
2. `๊ฏƒ๊ฏ๊ฏค๊ฏก_๊ฏ‘๊ฏฃ๊ฏ๊ฏ…_๊ฏŠ๊ฏ๊ฏ•_๊ฏŒ๊ฏฅ๊ฏ,_๊ฏƒ๊ฏ…๊ฏฅ-`
3. `๊ฏ๊ฏค๊ฏก_๊ฏ‘๊ฏ๊ฏค๊ฏ๊ฏจ_๊ฏŒ๊ฏฅ๊ฏ๊ฏ…_๊ฏ๊ฏจ๊ฏ”๊ฏจ๊ฏก๊ฏ๊ฏค๊ฏก๊ฏ—_๊ฏ…`
### Key Findings
- **Best Predictability:** Context-4 (word) with 98.7% predictability
- **Branching Factor:** Decreases with context size (more deterministic)
- **Memory Trade-off:** Larger contexts require more storage (440,820 contexts)
- **Recommendation:** Context-3 or Context-4 for text generation
---
## 4. Vocabulary Analysis
![Zipf's Law](visualizations/zipf_law.png)
![Top Words](visualizations/top20_words.png)
![Coverage Curve](visualizations/vocab_coverage.png)
### Statistics
| Metric | Value |
|--------|-------|
| Vocabulary Size | 35,928 |
| Total Tokens | 676,105 |
| Mean Frequency | 18.82 |
| Median Frequency | 3 |
| Frequency Std Dev | 209.83 |
### Most Common Words
| Rank | Word | Frequency |
|------|------|-----------|
| 1 | ๊ฏƒ๊ฏ๊ฏค๊ฏก | 18,949 |
| 2 | ๊ฏ‘๊ฏ๊ฏค | 18,391 |
| 3 | ๊ฏ‘๊ฏƒ๊ฏ…๊ฏค | 11,341 |
| 4 | ๊ฏ‘๊ฏƒ๊ฏ๊ฏจ๊ฏก | 10,185 |
| 5 | ๊ฏƒ๊ฏ‡๊ฏฆ๊ฏก | 10,150 |
| 6 | ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ | 9,121 |
| 7 | ๊ฏ๊ฏฆ๊ฏŸ๊ฏ… | 6,892 |
| 8 | ๊ฏ†๊ฏฅ๊ฏŽ๊ฏ• | 6,104 |
| 9 | ๊ฏƒ๊ฏ๊ฏค๊ฏ๊ฏจ | 5,695 |
| 10 | ๊ฏŒ๊ฏฆ๊ฏก๊ฏ•๊ฏค๊ฏŒ๊ฏจ | 4,565 |
### Least Common Words (from vocabulary)
| Rank | Word | Frequency |
|------|------|-----------|
| 1 | ๊ฏ–๊ฏก๊ฏ๊ฏŸ | 2 |
| 2 | ๊ฏ๊ฏญ๊ฏ€๊ฏฃ๊ฏœ๊ฏ€๊ฏฃ๊ฏž | 2 |
| 3 | ๊ฏƒ๊ฏฅ๊ฏ๊ฏ€๊ฏญ๊ฏ”๊ฏฃ๊ฏ‹๊ฏฆ๊ฏš | 2 |
| 4 | ๊ฏ๊ฏญ๊ฏ‹๊ฏ”๊ฏ  | 2 |
| 5 | ๊ฏƒ๊ฏค๊ฏ†๊ฏค๊ฏŒ๊ฏ | 2 |
| 6 | ๊ฏ…๊ฏฅ๊ฏ€๊ฏƒ๊ฏจ๊ฏ”๊ฏฅ | 2 |
| 7 | ๊ฏ๊ฏ”๊ฏ€๊ฏญ๊ฏŒ๊ฏจ๊ฏ  | 2 |
| 8 | ๊ฏ‡๊ฏŸ๊ฏ…๊ฏฆ๊ฏ‚๊ฏค๊ฏก | 2 |
| 9 | ๊ฏ๊ฏฅ๊ฏ๊ฏ€๊ฏƒ๊ฏฃ๊ฏ” | 2 |
| 10 | ๊ฏ—๊ฏฆ๊ฏ•๊ฏฅ๊ฏ๊ฏ | 2 |
### Zipf's Law Analysis
| Metric | Value |
|--------|-------|
| Zipf Coefficient | 1.0805 |
| Rยฒ (Goodness of Fit) | 0.996289 |
| Adherence Quality | **excellent** |
### Coverage Analysis
| Top N Words | Coverage |
|-------------|----------|
| Top 100 | 35.5% |
| Top 1,000 | 65.4% |
| Top 5,000 | 82.5% |
| Top 10,000 | 88.9% |
### Key Findings
- **Zipf Compliance:** Rยฒ=0.9963 indicates excellent adherence to Zipf's law
- **High Frequency Dominance:** Top 100 words cover 35.5% of corpus
- **Long Tail:** 25,928 words needed for remaining 11.1% coverage
---
## 5. Word Embeddings Evaluation
![Embedding Isotropy](visualizations/embedding_isotropy.png)
![Similarity Matrix](visualizations/embedding_similarity.png)
![t-SNE Words](visualizations/tsne_words.png)
![t-SNE Sentences](visualizations/tsne_sentences.png)
### 5.1 Cross-Lingual Alignment
![Alignment Quality](visualizations/embedding_alignment_quality.png)
![Multilingual t-SNE](visualizations/embedding_tsne_multilingual.png)
### 5.2 Model Comparison
| Model | Dimension | Isotropy | Semantic Density | Alignment R@1 | Alignment R@10 |
|-------|-----------|----------|------------------|---------------|----------------|
| **mono_32d** | 32 | 0.6424 | 0.3709 | N/A | N/A |
| **mono_64d** | 64 | 0.3014 | 0.3657 | N/A | N/A |
| **mono_128d** | 128 | 0.0542 | 0.3495 | N/A | N/A |
| **aligned_32d** | 32 | 0.6424 ๐Ÿ† | 0.3667 | 0.0080 | 0.0540 |
| **aligned_64d** | 64 | 0.3014 | 0.3759 | 0.0060 | 0.0480 |
| **aligned_128d** | 128 | 0.0542 | 0.3530 | 0.0040 | 0.0620 |
### Key Findings
- **Best Isotropy:** aligned_32d with 0.6424 (more uniform distribution)
- **Semantic Density:** Average pairwise similarity of 0.3636. Lower values indicate better semantic separation.
- **Alignment Quality:** Aligned models achieve up to 0.8% R@1 in cross-lingual retrieval.
- **Recommendation:** 128d aligned for best cross-lingual performance
---
## 6. Morphological Analysis (Experimental)
This section presents an automated morphological analysis derived from the statistical divergence between word-level and subword-level models. By analyzing where subword predictability spikes and where word-level coverage fails, we can infer linguistic structures without supervised data.
### 6.1 Productivity & Complexity
| Metric | Value | Interpretation | Recommendation |
|--------|-------|----------------|----------------|
| Productivity Index | **5.000** | High morphological productivity | Reliable analysis |
| Idiomaticity Gap | **1.511** | High formulaic/idiomatic content | - |
### 6.2 Affix Inventory (Productive Units)
These are the most productive prefixes and suffixes identified by sampling the vocabulary for global substitutability patterns. A unit is considered an affix if stripping it leaves a valid stem that appears in other contexts.
#### Productive Prefixes
| Prefix | Examples |
|--------|----------|
| `-๊ฏ‘` | ๊ฏ‘๊ฏœ๊ฏ’๊ฏฅ, ๊ฏ‘๊ฏ๊ฏจ๊ฏƒ๊ฏ๊ฏจ๊ฏ•๊ฏฅ, ๊ฏ‘๊ฏฃ๊ฏข๊ฏ•๊ฏค |
| `-๊ฏƒ` | ๊ฏƒ๊ฏ„๊ฏจ๊ฏ”๊ฏฃ๊ฏ๊ฏ•๊ฏ…, ๊ฏƒ๊ฏค๊ฏ ๊ฏ…๊ฏฅ, ๊ฏƒ๊ฏ”๊ฏจ๊ฏž๊ฏ๊ฏค๊ฏก๊ฏ… |
| `-๊ฏ` | ๊ฏ๊ฏฅ๊ฏ—๊ฏญ๊ฏ—๊ฏฅ๊ฏ๊ฏ•๊ฏจ, ๊ฏ๊ฏญ๊ฏ‡๊ฏฅ๊ฏ๊ฏž, ๊ฏ๊ฏญ๊ฏ‡๊ฏฅ๊ฏ |
| `-๊ฏ‚` | ๊ฏ‚๊ฏฉ๊ฏ”๊ฏ๊ฏ•, ๊ฏ‚๊ฏค๊ฏŠ๊ฏญ๊ฏ‹๊ฏฅ๊ฏ…๊ฏค๊ฏŒ๊ฏฅ๊ฏŸ, ๊ฏ‚๊ฏฅ๊ฏŸ๊ฏƒ๊ฏค๊ฏ’๊ฏค |
| `-๊ฏ€` | ๊ฏ€๊ฏง๊ฏ๊ฏค๊ฏ€๊ฏฅ, ๊ฏ€๊ฏฅ๊ฏก๊ฏ•, ๊ฏ€๊ฏ…๊ฏ•๊ฏค๊ฏ’๊ฏ…๊ฏค |
| `-๊ฏ„` | ๊ฏ„๊ฏจ๊ฏ”๊ฏฅ๊ฏ›๊ฏ‚๊ฏฆ, ๊ฏ„๊ฏค๊ฏ–๊ฏ•, ๊ฏ„๊ฏฆ๊ฏ’๊ฏฆ๊ฏ  |
| `-๊ฏ` | ๊ฏ๊ฏง๊ฏ–๊ฏค๊ฏ›๊ฏ๊ฏจ, ๊ฏ๊ฏจ๊ฏ๊ฏ๊ฏจ๊ฏ‡๊ฏ”๊ฏฅ๊ฏ๊ฏจ๊ฏ๊ฏŠ๊ฏฃ๊ฏ, ๊ฏ๊ฏฃ๊ฏก๊ฏ—๊ฏฃ๊ฏ›๊ฏ‡๊ฏจ๊ฏ… |
| `-๊ฏ‡` | ๊ฏ‡๊ฏฅ๊ฏ›๊ฏ…๊ฏ•๊ฏ’๊ฏค, ๊ฏ‡๊ฏƒ๊ฏŠ๊ฏค๊ฏ•๊ฏฅ, ๊ฏ‡๊ฏช๊ฏˆ๊ฏฅ๊ฏ๊ฏ—๊ฏฅ |
#### Productive Suffixes
| Suffix | Examples |
|--------|----------|
| `-๊ฏก` | ๊ฏˆ๊ฏฃ๊ฏก, ๊ฏ†๊ฏค๊ฏŠ๊ฏค๊ฏ๊ฏค๊ฏก, ๊ฏ‡๊ฏƒ๊ฏฆ๊ฏก๊ฏ‚๊ฏฃ๊ฏก |
| `-๊ฏŸ` | ๊ฏ‚๊ฏค๊ฏŠ๊ฏญ๊ฏ‹๊ฏฅ๊ฏ…๊ฏค๊ฏŒ๊ฏฅ๊ฏŸ, ๊ฏŒ๊ฏฅ๊ฏก๊ฏˆ๊ฏฉ๊ฏƒ๊ฏฅ๊ฏ„๊ฏŸ, ๊ฏ‘๊ฏฃ๊ฏ๊ฏค๊ฏŒ๊ฏฃ๊ฏŸ |
| `-๊ฏ…` | ๊ฏƒ๊ฏ„๊ฏจ๊ฏ”๊ฏฃ๊ฏ๊ฏ•๊ฏ…, ๊ฏ‚๊ฏฉ๊ฏ‡๊ฏ•๊ฏ…, ๊ฏƒ๊ฏ”๊ฏจ๊ฏž๊ฏ๊ฏค๊ฏก๊ฏ… |
| `-๊ฏ—` | ๊ฏน๊ฏ—, ๊ฏ‹๊ฏฅ๊ฏ”๊ฏœ๊ฏ—๊ฏ‹๊ฏฅ๊ฏ๊ฏ—, ๊ฏƒ๊ฏค๊ฏ‡๊ฏฉ๊ฏ‚๊ฏฃ๊ฏŸ๊ฏ— |
| `-๊ฏ•` | ๊ฏ‚๊ฏฉ๊ฏ”๊ฏ๊ฏ•, ๊ฏŽ๊ฏž๊ฏ‚๊ฏ•, ๊ฏ„๊ฏค๊ฏ–๊ฏ• |
| `-s` | epirus, chris, andreas |
| `-๊ฏ` | ๊ฏ‚๊ฏ๊ฏ‡๊ฏฅ๊ฏ›๊ฏ‚๊ฏฃ๊ฏข๊ฏ๊ฏ›๊ฏ‡๊ฏ, ๊ฏ‰๊ฏฅ๊ฏ‰๊ฏ, ๊ฏ๊ฏค๊ฏŸ๊ฏ‚๊ฏ |
| `-๊ฏ›` | ๊ฏ‘๊ฏฅ๊ฏ๊ฏ€๊ฏฃ๊ฏ…๊ฏฃ๊ฏ’๊ฏญ๊ฏ”๊ฏฅ๊ฏ๊ฏค๊ฏ›, ๊ฏŠ๊ฏ•๊ฏ›๊ฏ๊ฏค๊ฏก๊ฏ’๊ฏค๊ฏ—๊ฏƒ๊ฏ›, ๊ฏ‡๊ฏง๊ฏ•๊ฏ’๊ฏค๊ฏ—๊ฏƒ๊ฏ› |
### 6.3 Bound Stems (Lexical Roots)
Bound stems are high-frequency subword units that are semantically cohesive but rarely appear as standalone words. These often correspond to the 'core' of a word that requires inflection or derivation to be valid.
| Stem | Cohesion | Substitutability | Examples |
|------|----------|------------------|----------|
| `ther` | 2.36x | 17 contexts | uther, other, there |
| `tion` | 2.34x | 15 contexts | nation, action, motion |
| `atio` | 2.35x | 10 contexts | ratio, nation, nations |
| `๊ฏ๊ฏœ๊ฏ‚๊ฏ›` | 1.80x | 19 contexts | ๊ฏ๊ฏœ๊ฏ‚๊ฏ›๊ฏ„, ๊ฏ๊ฏœ๊ฏ‚๊ฏ›๊ฏ, ๊ฏ๊ฏœ๊ฏ‚๊ฏ›๊ฏ„๊ฏ’ |
| `๊ฏ๊ฏ…๊ฏƒ๊ฏ›` | 1.89x | 12 contexts | ๊ฏ„๊ฏจ๊ฏ๊ฏ…๊ฏƒ๊ฏ›, ๊ฏ„๊ฏจ๊ฏ๊ฏ…๊ฏƒ๊ฏ›๊ฏ…, ๊ฏ„๊ฏจ๊ฏ๊ฏ…๊ฏƒ๊ฏ›๊ฏ‡ |
| `๊ฏ”๊ฏ›๊ฏ๊ฏ` | 1.60x | 11 contexts | ๊ฏ‚๊ฏ”๊ฏ›๊ฏ๊ฏ, ๊ฏ‚๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ, ๊ฏ๊ฏง๊ฏ”๊ฏ›๊ฏ๊ฏ |
### 6.4 Affix Compatibility (Co-occurrence)
This table shows which prefixes and suffixes most frequently co-occur on the same stems, revealing the 'stacking' rules of the language's morphology.
| Prefix | Suffix | Frequency | Examples |
|--------|--------|-----------|----------|
| `-๊ฏ‚` | `-๊ฏ•` | 27 words | ๊ฏ‚๊ฏ๊ฏ€๊ฏฃ๊ฏ๊ฏ•, ๊ฏ‚๊ฏฅ๊ฏข๊ฏ”๊ฏฆ๊ฏ๊ฏ• |
| `-๊ฏ` | `-๊ฏก` | 26 words | ๊ฏ๊ฏ”๊ฏจ๊ฏ€๊ฏ๊ฏค๊ฏก, ๊ฏ๊ฏฅ๊ฏ†๊ฏจ๊ฏก |
| `-๊ฏ‘` | `-๊ฏ—` | 26 words | ๊ฏ‘๊ฏ—๊ฏจ๊ฏ‹๊ฏฅ๊ฏ๊ฏ—, ๊ฏ‘๊ฏฅ๊ฏ๊ฏ‚๊ฏฆ๊ฏŸ๊ฏ— |
| `-๊ฏ‚` | `-๊ฏก` | 24 words | ๊ฏ‚๊ฏฅ๊ฏก๊ฏ‚๊ฏค๊ฏ•๊ฏ๊ฏค๊ฏก, ๊ฏ‚๊ฏฆ๊ฏ๊ฏ๊ฏง๊ฏ•๊ฏ๊ฏค๊ฏก |
| `-๊ฏ‘` | `-๊ฏŸ` | 21 words | ๊ฏ‘๊ฏฆ๊ฏ๊ฏญ๊ฏ‡๊ฏฃ๊ฏŸ, ๊ฏ‘๊ฏฆ๊ฏ—๊ฏƒ๊ฏŸ |
| `-๊ฏ„` | `-๊ฏก` | 21 words | ๊ฏ„๊ฏŸ๊ฏ…๊ฏจ๊ฏก, ๊ฏ„๊ฏ”๊ฏฆ๊ฏก |
| `-๊ฏƒ` | `-๊ฏก` | 19 words | ๊ฏƒ๊ฏ†๊ฏฅ๊ฏ…๊ฏจ๊ฏ„๊ฏฅ๊ฏ๊ฏค๊ฏก, ๊ฏƒ๊ฏŒ๊ฏจ๊ฏก |
| `-๊ฏ‘` | `-๊ฏก` | 19 words | ๊ฏ‘๊ฏฆ๊ฏœ๊ฏ•๊ฏ๊ฏ๊ฏค๊ฏก, ๊ฏ‘๊ฏ๊ฏ‚๊ฏ๊ฏค๊ฏก |
| `-๊ฏ‘` | `-๊ฏ` | 19 words | ๊ฏ‘๊ฏฅ๊ฏ”๊ฏ€๊ฏฅ๊ฏŸ๊ฏ๊ฏฅ๊ฏ, ๊ฏ‘๊ฏฃ๊ฏ’๊ฏ |
| `-๊ฏ‘` | `-๊ฏ›` | 18 words | ๊ฏ‘๊ฏ๊ฏจ๊ฏ›, ๊ฏ‘๊ฏ—๊ฏจ๊ฏˆ๊ฏ›๊ฏ‡๊ฏƒ๊ฏ› |
### 6.5 Recursive Morpheme Segmentation
Using **Recursive Hierarchical Substitutability**, we decompose complex words into their constituent morphemes. This approach handles nested affixes (e.g., `prefix-prefix-root-suffix`).
| Word | Suggested Split | Confidence | Stem |
|------|-----------------|------------|------|
| ๊ฏ‡๊ฏค๊ฏŽ๊ฏ๊ฏ…๊ฏ’๊ฏค๊ฏ—๊ฏƒ๊ฏ› | **`๊ฏ‡๊ฏค๊ฏŽ๊ฏ๊ฏ…๊ฏ’๊ฏค-๊ฏ—-๊ฏƒ๊ฏ›`** | 7.5 | `๊ฏ—` |
| ๊ฏ„๊ฏจ๊ฏŠ๊ฏฃ๊ฏ›๊ฏ„๊ฏ’๊ฏค๊ฏ—๊ฏƒ๊ฏ› | **`๊ฏ„๊ฏจ๊ฏŠ๊ฏฃ๊ฏ›๊ฏ„๊ฏ’๊ฏค-๊ฏ—-๊ฏƒ๊ฏ›`** | 7.5 | `๊ฏ—` |
| ๊ฏ๊ฏŠ๊ฏค๊ฏŒ๊ฏฃ๊ฏ„๊ฏค๊ฏŒ๊ฏฅ๊ฏŸ | **`๊ฏ๊ฏŠ๊ฏค๊ฏŒ๊ฏฃ๊ฏ„๊ฏค๊ฏŒ๊ฏฅ-๊ฏŸ`** | 4.5 | `๊ฏ๊ฏŠ๊ฏค๊ฏŒ๊ฏฃ๊ฏ„๊ฏค๊ฏŒ๊ฏฅ` |
| ๊ฏ„๊ฏจ๊ฏŸ๊ฏ๊ฏค๊ฏŸ๊ฏˆ๊ฏค๊ฏ• | **`๊ฏ„๊ฏจ๊ฏŸ๊ฏ๊ฏค๊ฏŸ๊ฏˆ๊ฏค-๊ฏ•`** | 4.5 | `๊ฏ„๊ฏจ๊ฏŸ๊ฏ๊ฏค๊ฏŸ๊ฏˆ๊ฏค` |
| ๊ฏš๊ฏค๊ฏ—๊ฏค๊ฏ‘๊ฏฃ๊ฏ๊ฏค๊ฏก๊ฏ— | **`๊ฏš๊ฏค๊ฏ—๊ฏค๊ฏ‘๊ฏฃ๊ฏ๊ฏค๊ฏก-๊ฏ—`** | 4.5 | `๊ฏš๊ฏค๊ฏ—๊ฏค๊ฏ‘๊ฏฃ๊ฏ๊ฏค๊ฏก` |
| ๊ฏ๊ฏฆ๊ฏŸ๊ฏ’๊ฏ ๊ฏ‚๊ฏ›๊ฏ‚๊ฏค๊ฏ• | **`๊ฏ๊ฏฆ๊ฏŸ๊ฏ’๊ฏ ๊ฏ‚๊ฏ›๊ฏ‚๊ฏค-๊ฏ•`** | 4.5 | `๊ฏ๊ฏฆ๊ฏŸ๊ฏ’๊ฏ ๊ฏ‚๊ฏ›๊ฏ‚๊ฏค` |
| ๊ฏ๊ฏจ๊ฏก๊ฏ’๊ฏฅ๊ฏ‹๊ฏฅ๊ฏ”๊ฏค๊ฏ— | **`๊ฏ๊ฏจ๊ฏก๊ฏ’๊ฏฅ๊ฏ‹๊ฏฅ๊ฏ”๊ฏค-๊ฏ—`** | 4.5 | `๊ฏ๊ฏจ๊ฏก๊ฏ’๊ฏฅ๊ฏ‹๊ฏฅ๊ฏ”๊ฏค` |
| ๊ฏ๊ฏฃ๊ฏ๊ฏญ๊ฏ„๊ฏค๊ฏ‡๊ฏฅ๊ฏœ๊ฏ— | **`๊ฏ๊ฏฃ๊ฏ๊ฏญ๊ฏ„๊ฏค๊ฏ‡๊ฏฅ๊ฏœ-๊ฏ—`** | 4.5 | `๊ฏ๊ฏฃ๊ฏ๊ฏญ๊ฏ„๊ฏค๊ฏ‡๊ฏฅ๊ฏœ` |
| ๊ฏ„๊ฏจ๊ฏ”๊ฏฃ๊ฏ๊ฏค๊ฏ ๊ฏ๊ฏค๊ฏก๊ฏ… | **`๊ฏ„๊ฏจ๊ฏ”๊ฏฃ๊ฏ๊ฏค๊ฏ ๊ฏ๊ฏค๊ฏก-๊ฏ…`** | 4.5 | `๊ฏ„๊ฏจ๊ฏ”๊ฏฃ๊ฏ๊ฏค๊ฏ ๊ฏ๊ฏค๊ฏก` |
| ๊ฏŒ๊ฏจ๊ฏ…๊ฏค๊ฏš๊ฏ”๊ฏ๊ฏค๊ฏ‡๊ฏค๊ฏ— | **`๊ฏŒ๊ฏจ๊ฏ…๊ฏค๊ฏš๊ฏ”๊ฏ๊ฏค๊ฏ‡๊ฏค-๊ฏ—`** | 4.5 | `๊ฏŒ๊ฏจ๊ฏ…๊ฏค๊ฏš๊ฏ”๊ฏ๊ฏค๊ฏ‡๊ฏค` |
| ๊ฏ…๊ฏค๊ฏŸ๊ฏ๊ฏจ๊ฏ”๊ฏ๊ฏฅ๊ฏ’๊ฏ… | **`๊ฏ…๊ฏค๊ฏŸ๊ฏ๊ฏจ๊ฏ”๊ฏ๊ฏฅ๊ฏ’-๊ฏ…`** | 4.5 | `๊ฏ…๊ฏค๊ฏŸ๊ฏ๊ฏจ๊ฏ”๊ฏ๊ฏฅ๊ฏ’` |
| ๊ฏ…๊ฏจ๊ฏƒ๊ฏค๊ฏ—๊ฏฅ๊ฏก๊ฏ‹๊ฏฅ๊ฏ๊ฏ”๊ฏ๊ฏ— | **`๊ฏ…๊ฏจ๊ฏƒ๊ฏค๊ฏ—๊ฏฅ๊ฏก๊ฏ‹๊ฏฅ๊ฏ๊ฏ”๊ฏ-๊ฏ—`** | 4.5 | `๊ฏ…๊ฏจ๊ฏƒ๊ฏค๊ฏ—๊ฏฅ๊ฏก๊ฏ‹๊ฏฅ๊ฏ๊ฏ”๊ฏ` |
| relationships | **`relationship-s`** | 4.5 | `relationship` |
| ๊ฏ๊ฏฃ๊ฏ”๊ฏฅ๊ฏ๊ฏ–๊ฏฃ๊ฏŸ๊ฏ | **`๊ฏ-๊ฏฃ๊ฏ”๊ฏฅ๊ฏ๊ฏ–๊ฏฃ๊ฏŸ-๊ฏ`** | 3.0 | `๊ฏฃ๊ฏ”๊ฏฅ๊ฏ๊ฏ–๊ฏฃ๊ฏŸ` |
| ๊ฏ๊ฏƒ๊ฏจ๊ฏ—๊ฏญ๊ฏ”๊ฏ๊ฏค๊ฏก๊ฏ—๊ฏฅ | **`๊ฏ-๊ฏƒ-๊ฏจ๊ฏ—๊ฏญ๊ฏ”๊ฏ๊ฏค๊ฏก๊ฏ—๊ฏฅ`** | 3.0 | `๊ฏจ๊ฏ—๊ฏญ๊ฏ”๊ฏ๊ฏค๊ฏก๊ฏ—๊ฏฅ` |
### 6.6 Linguistic Interpretation
> **Automated Insight:**
The language Manipuri shows high morphological productivity. The subword models are significantly more efficient than word models, suggesting a rich system of affixation or compounding.
> **Note on Idiomaticity:** The high Idiomaticity Gap suggests a large number of frequent multi-word expressions or formulaic sequences that are statistically distinct from their component parts.
---
## 7. Summary & Recommendations
![Performance Dashboard](visualizations/performance_dashboard.png)
### Production Recommendations
| Component | Recommended | Rationale |
|-----------|-------------|-----------|
| Tokenizer | **64k BPE** | Best compression (4.32x) |
| N-gram | **2-gram** | Lowest perplexity (1,226) |
| Markov | **Context-4** | Highest predictability (98.7%) |
| Embeddings | **100d** | Balanced semantic capture and isotropy |
---
## Appendix: Metrics Glossary & Interpretation Guide
This section provides definitions, intuitions, and guidance for interpreting the metrics used throughout this report.
### Tokenizer Metrics
**Compression Ratio**
> *Definition:* The ratio of characters to tokens (chars/token). Measures how efficiently the tokenizer represents text.
>
> *Intuition:* Higher compression means fewer tokens needed to represent the same text, reducing sequence lengths for downstream models. A 3x compression means ~3 characters per token on average.
>
> *What to seek:* Higher is generally better for efficiency, but extremely high compression may indicate overly aggressive merging that loses morphological information.
**Average Token Length (Fertility)**
> *Definition:* Mean number of characters per token produced by the tokenizer.
>
> *Intuition:* Reflects the granularity of tokenization. Longer tokens capture more context but may struggle with rare words; shorter tokens are more flexible but increase sequence length.
>
> *What to seek:* Balance between 2-5 characters for most languages. Arabic/morphologically-rich languages may benefit from slightly longer tokens.
**Unknown Token Rate (OOV Rate)**
> *Definition:* Percentage of tokens that map to the unknown/UNK token, indicating words the tokenizer cannot represent.
>
> *Intuition:* Lower OOV means better vocabulary coverage. High OOV indicates the tokenizer encounters many unseen character sequences.
>
> *What to seek:* Below 1% is excellent; below 5% is acceptable. BPE tokenizers typically achieve very low OOV due to subword fallback.
### N-gram Model Metrics
**Perplexity**
> *Definition:* Measures how "surprised" the model is by test data. Mathematically: 2^(cross-entropy). Lower values indicate better prediction.
>
> *Intuition:* If perplexity is 100, the model is as uncertain as if choosing uniformly among 100 options at each step. A perplexity of 10 means effectively choosing among 10 equally likely options.
>
> *What to seek:* Lower is better. Perplexity decreases with larger n-grams (more context). Values vary widely by language and corpus size.
**Entropy**
> *Definition:* Average information content (in bits) needed to encode the next token given the context. Related to perplexity: perplexity = 2^entropy.
>
> *Intuition:* High entropy means high uncertainty/randomness; low entropy means predictable patterns. Natural language typically has entropy between 1-4 bits per character.
>
> *What to seek:* Lower entropy indicates more predictable text patterns. Entropy should decrease as n-gram size increases.
**Coverage (Top-K)**
> *Definition:* Percentage of corpus occurrences explained by the top K most frequent n-grams.
>
> *Intuition:* High coverage with few patterns indicates repetitive/formulaic text; low coverage suggests diverse vocabulary usage.
>
> *What to seek:* Depends on use case. For language modeling, moderate coverage (40-60% with top-1000) is typical for natural text.
### Markov Chain Metrics
**Average Entropy**
> *Definition:* Mean entropy across all contexts, measuring average uncertainty in next-word prediction.
>
> *Intuition:* Lower entropy means the model is more confident about what comes next. Context-1 has high entropy (many possible next words); Context-4 has low entropy (few likely continuations).
>
> *What to seek:* Decreasing entropy with larger context sizes. Very low entropy (<0.1) indicates highly deterministic transitions.
**Branching Factor**
> *Definition:* Average number of unique next tokens observed for each context.
>
> *Intuition:* High branching = many possible continuations (flexible but uncertain); low branching = few options (predictable but potentially repetitive).
>
> *What to seek:* Branching factor should decrease with context size. Values near 1.0 indicate nearly deterministic chains.
**Predictability**
> *Definition:* Derived metric: (1 - normalized_entropy) ร— 100%. Indicates how deterministic the model's predictions are.
>
> *Intuition:* 100% predictability means the next word is always certain; 0% means completely random. Real text falls between these extremes.
>
> *What to seek:* Higher predictability for text generation quality, but too high (>98%) may produce repetitive output.
### Vocabulary & Zipf's Law Metrics
**Zipf's Coefficient**
> *Definition:* The slope of the log-log plot of word frequency vs. rank. Zipf's law predicts this should be approximately -1.
>
> *Intuition:* A coefficient near -1 indicates the corpus follows natural language patterns where a few words are very common and most words are rare.
>
> *What to seek:* Values between -0.8 and -1.2 indicate healthy natural language distribution. Deviations may suggest domain-specific or artificial text.
**Rยฒ (Coefficient of Determination)**
> *Definition:* Measures how well the linear fit explains the frequency-rank relationship. Ranges from 0 to 1.
>
> *Intuition:* Rยฒ near 1.0 means the data closely follows Zipf's law; lower values indicate deviation from expected word frequency patterns.
>
> *What to seek:* Rยฒ > 0.95 is excellent; > 0.99 indicates near-perfect Zipf adherence typical of large natural corpora.
**Vocabulary Coverage**
> *Definition:* Cumulative percentage of corpus tokens accounted for by the top N words.
>
> *Intuition:* Shows how concentrated word usage is. If top-100 words cover 50% of text, the corpus relies heavily on common words.
>
> *What to seek:* Top-100 covering 30-50% is typical. Higher coverage indicates more repetitive text; lower suggests richer vocabulary.
### Word Embedding Metrics
**Isotropy**
> *Definition:* Measures how uniformly distributed vectors are in the embedding space. Computed as the ratio of minimum to maximum singular values.
>
> *Intuition:* High isotropy (near 1.0) means vectors spread evenly in all directions; low isotropy means vectors cluster in certain directions, reducing expressiveness.
>
> *What to seek:* Higher isotropy generally indicates better-quality embeddings. Values > 0.1 are reasonable; > 0.3 is good. Lower-dimensional embeddings tend to have higher isotropy.
**Average Norm**
> *Definition:* Mean magnitude (L2 norm) of word vectors in the embedding space.
>
> *Intuition:* Indicates the typical "length" of vectors. Consistent norms suggest stable training; high variance may indicate some words are undertrained.
>
> *What to seek:* Relatively consistent norms across models. The absolute value matters less than consistency (low std deviation).
**Cosine Similarity**
> *Definition:* Measures angular similarity between vectors, ranging from -1 (opposite) to 1 (identical direction).
>
> *Intuition:* Words with similar meanings should have high cosine similarity. This is the standard metric for semantic relatedness in embeddings.
>
> *What to seek:* Semantically related words should score > 0.5; unrelated words should be near 0. Synonyms often score > 0.7.
**t-SNE Visualization**
> *Definition:* t-Distributed Stochastic Neighbor Embedding - a dimensionality reduction technique that preserves local structure for visualization.
>
> *Intuition:* Clusters in t-SNE plots indicate groups of semantically related words. Spread indicates vocabulary diversity; tight clusters suggest semantic coherence.
>
> *What to seek:* Meaningful clusters (e.g., numbers together, verbs together). Avoid over-interpreting distances - t-SNE preserves local, not global, structure.
### General Interpretation Guidelines
1. **Compare within model families:** Metrics are most meaningful when comparing models of the same type (e.g., 8k vs 64k tokenizer).
2. **Consider trade-offs:** Better performance on one metric often comes at the cost of another (e.g., compression vs. OOV rate).
3. **Context matters:** Optimal values depend on downstream tasks. Text generation may prioritize different metrics than classification.
4. **Corpus influence:** All metrics are influenced by corpus characteristics. Wikipedia text differs from social media or literature.
5. **Language-specific patterns:** Morphologically rich languages (like Arabic) may show different optimal ranges than analytic languages.
### Visualizations Index
| Visualization | Description |
|---------------|-------------|
| Tokenizer Compression | Compression ratios by vocabulary size |
| Tokenizer Fertility | Average token length by vocabulary |
| Tokenizer OOV | Unknown token rates |
| Tokenizer Total Tokens | Total tokens by vocabulary |
| N-gram Perplexity | Perplexity by n-gram size |
| N-gram Entropy | Entropy by n-gram size |
| N-gram Coverage | Top pattern coverage |
| N-gram Unique | Unique n-gram counts |
| Markov Entropy | Entropy by context size |
| Markov Branching | Branching factor by context |
| Markov Contexts | Unique context counts |
| Zipf's Law | Frequency-rank distribution with fit |
| Vocab Frequency | Word frequency distribution |
| Top 20 Words | Most frequent words |
| Vocab Coverage | Cumulative coverage curve |
| Embedding Isotropy | Vector space uniformity |
| Embedding Norms | Vector magnitude distribution |
| Embedding Similarity | Word similarity heatmap |
| Nearest Neighbors | Similar words for key terms |
| t-SNE Words | 2D word embedding visualization |
| t-SNE Sentences | 2D sentence embedding visualization |
| Position Encoding | Encoding method comparison |
| Model Sizes | Storage requirements |
| Performance Dashboard | Comprehensive performance overview |
---
## About This Project
### Data Source
Models trained on [wikipedia-monthly](https://huggingface.co/datasets/omarkamali/wikipedia-monthly) - a monthly snapshot of Wikipedia articles across 300+ languages.
### Project
A project by **[Wikilangs](https://wikilangs.org)** - Open-source NLP models for every Wikipedia language.
### Maintainer
[Omar Kamali](https://omarkamali.com) - [Omneity Labs](https://omneitylabs.com)
### Citation
If you use these models in your research, please cite:
```bibtex
@misc{wikilangs2025,
author = {Kamali, Omar},
title = {Wikilangs: Open NLP Models for Wikipedia Languages},
year = {2025},
doi = {10.5281/zenodo.18073153},
publisher = {Zenodo},
url = {https://huggingface.co/wikilangs}
institution = {Omneity Labs}
}
```
### License
MIT License - Free for academic and commercial use.
### Links
- ๐ŸŒ Website: [wikilangs.org](https://wikilangs.org)
- ๐Ÿค— Models: [huggingface.co/wikilangs](https://huggingface.co/wikilangs)
- ๐Ÿ“Š Data: [wikipedia-monthly](https://huggingface.co/datasets/omarkamali/wikipedia-monthly)
- ๐Ÿ‘ค Author: [Omar Kamali](https://huggingface.co/omarkamali)
- ๐Ÿค Sponsor: [Featherless AI](https://featherless.ai)
---
*Generated by Wikilangs Models Pipeline*
*Report Date: 2026-01-10 12:16:30*