bpy / README.md
omarkamali's picture
Upload all models and assets for bpy (latest)
67cb1a6 verified
---
language: bpy
language_name: Bishnupriya
language_family: indoaryan_eastern
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-indoaryan_eastern
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.935
- name: best_isotropy
type: isotropy
value: 0.6926
- name: vocabulary_size
type: vocab
value: 0
generated: 2026-01-03
---
# Bishnupriya - Wikilangs Models
## Comprehensive Research Report & Full Ablation Study
This repository contains NLP models trained and evaluated by Wikilangs, specifically on **Bishnupriya** 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** | 4.501x | 4.51 | 0.2384% | 99,847 |
| **16k** | 4.662x | 4.67 | 0.2469% | 96,404 |
| **32k** | 4.818x | 4.83 | 0.2551% | 93,284 |
| **64k** | 4.935x ๐Ÿ† | 4.95 | 0.2614% | 91,058 |
### Tokenization Examples
Below are sample sentences tokenized with each vocabulary size:
**Sample 1:** `เฆ‡เฆฅเฆพเฆ• เฆฌเฆฟเฆทเงเฆฃเงเฆชเงเฆฐเฆฟเฆฏเฆผเฆพ เฆฎเฆฃเฆฟเฆชเงเฆฐเง€ เฆ เฆพเฆฐเฆฐ เฆ…เฆจเฆฟเฆฏเฆผเฆฎเฆฟเฆค เฆชเฆคเงเฆฐเฆฟเฆ•เฆพ เฆ†เฆนเฆพเฆจ, เฆฏเง‡เฆนเฆพเฆจ เฆธเฆ‚เฆ—เงเฆฐเฆพเฆฎ เฆธเฆฟเฆ‚เฆนเฆฐ เฆธเฆฎเงเฆชเฆพ...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–เฆ‡ เฆฅ เฆพเฆ• โ–เฆฌเฆฟเฆทเงเฆฃเงเฆชเงเฆฐเฆฟเฆฏเฆผเฆพ โ–เฆฎเฆฃเฆฟเฆชเงเฆฐเง€ โ–เฆ เฆพเฆฐเฆฐ โ–เฆ… เฆจเฆฟ เฆฏเฆผ เฆฎเฆฟ ... (+21 more)` | 31 |
| 16k | `โ–เฆ‡ เฆฅ เฆพเฆ• โ–เฆฌเฆฟเฆทเงเฆฃเงเฆชเงเฆฐเฆฟเฆฏเฆผเฆพ โ–เฆฎเฆฃเฆฟเฆชเงเฆฐเง€ โ–เฆ เฆพเฆฐเฆฐ โ–เฆ… เฆจเฆฟ เฆฏเฆผ เฆฎเฆฟเฆค ... (+18 more)` | 28 |
| 32k | `โ–เฆ‡ เฆฅ เฆพเฆ• โ–เฆฌเฆฟเฆทเงเฆฃเงเฆชเงเฆฐเฆฟเฆฏเฆผเฆพ โ–เฆฎเฆฃเฆฟเฆชเงเฆฐเง€ โ–เฆ เฆพเฆฐเฆฐ โ–เฆ…เฆจเฆฟ เฆฏเฆผเฆฎเฆฟเฆค โ–เฆชเฆคเงเฆฐเฆฟเฆ•เฆพ โ–เฆ†เฆนเฆพเฆจ ... (+13 more)` | 23 |
| 64k | `โ–เฆ‡เฆฅเฆพเฆ• โ–เฆฌเฆฟเฆทเงเฆฃเงเฆชเงเฆฐเฆฟเฆฏเฆผเฆพ โ–เฆฎเฆฃเฆฟเฆชเงเฆฐเง€ โ–เฆ เฆพเฆฐเฆฐ โ–เฆ…เฆจเฆฟเฆฏเฆผเฆฎเฆฟเฆค โ–เฆชเฆคเงเฆฐเฆฟเฆ•เฆพ โ–เฆ†เฆนเฆพเฆจ , โ–เฆฏเง‡เฆนเฆพเฆจ โ–เฆธเฆ‚เฆ—เงเฆฐเฆพเฆฎ ... (+8 more)` | 18 |
**Sample 2:** `.เฆเฆฎเฆ“(.mo) เฆเฆ— เฆฎเฆพเฆ•เฆพเฆ‰เฆฐ เฆจเฆพเฆ™เง‡ เฆฒเง‡เฆชเฆ•เฆฐเฆฟเฆธเฆฟ เฆšเฆฟเฆ™เฆชเฆพ เฆกเฆฎเง‡เฆ‡เฆจเฆ— (ccTLD)เฅค เฆฎเฆฟเฆฒเฆพเฆช เฆ†เฆ‡เฆเฆเฆจเฆ-เฆฐ เฆฎเฆพเฆ•เฆพเฆ‰เฆฐ เฆคเฆฅ...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–. เฆเฆฎ เฆ“ (. mo ) โ–เฆเฆ— โ–เฆฎเฆพเฆ•เฆพ เฆ‰เฆฐ โ–เฆจเฆพเฆ™เง‡ ... (+23 more)` | 33 |
| 16k | `โ–. เฆเฆฎ เฆ“ (. mo ) โ–เฆเฆ— โ–เฆฎเฆพเฆ•เฆพ เฆ‰เฆฐ โ–เฆจเฆพเฆ™เง‡ ... (+23 more)` | 33 |
| 32k | `โ–. เฆเฆฎ เฆ“ (. mo ) โ–เฆเฆ— โ–เฆฎเฆพเฆ•เฆพเฆ‰เฆฐ โ–เฆจเฆพเฆ™เง‡ โ–เฆฒเง‡เฆชเฆ•เฆฐเฆฟเฆธเฆฟ ... (+21 more)` | 31 |
| 64k | `โ–. เฆเฆฎ เฆ“ (. mo ) โ–เฆเฆ— โ–เฆฎเฆพเฆ•เฆพเฆ‰เฆฐ โ–เฆจเฆพเฆ™เง‡ โ–เฆฒเง‡เฆชเฆ•เฆฐเฆฟเฆธเฆฟ ... (+21 more)` | 31 |
**Sample 3:** `เฆฌเฆพเฆ‚เฆฒเฆพเฆฆเง‡เฆถเฆฐ เฆธเงเฆฅเฆพเฆจเง€เฆฏเฆผ เฆธเฆฐเฆ•เฆพเฆฐเฆฐ เฆธเฆฟเฆœเฆฟเฆฒเง‡ เฆ†เฆธเง‡เฆคเฆพเฆ‡ เฆœเฆฟเฆฒเฆพ เฆชเฆฐเฆฟเฆทเฆฆ เฆธเฆฟเฆŸเฆฟ เฆ•เฆฐเงเฆชเง‹เฆฐเง‡เฆถเฆจ (เงฌเฆ—) เฆฅเฆพเฆจเฆพ เฆฌเฆพเฆฐเง‹...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–เฆฌเฆพเฆ‚เฆฒเฆพเฆฆเง‡เฆถเฆฐ โ–เฆธเง เฆฅเฆพเฆจ เง€เฆฏเฆผ โ–เฆธเฆฐเฆ•เฆพเฆฐเฆฐ โ–เฆธเฆฟเฆœเฆฟเฆฒ เง‡ โ–เฆ†เฆธเง‡เฆคเฆพเฆ‡ โ–เฆœเฆฟเฆฒเฆพ โ–เฆชเฆฐเฆฟเฆท ... (+21 more)` | 31 |
| 16k | `โ–เฆฌเฆพเฆ‚เฆฒเฆพเฆฆเง‡เฆถเฆฐ โ–เฆธเงเฆฅเฆพเฆจเง€เฆฏเฆผ โ–เฆธเฆฐเฆ•เฆพเฆฐเฆฐ โ–เฆธเฆฟเฆœเฆฟเฆฒ เง‡ โ–เฆ†เฆธเง‡เฆคเฆพเฆ‡ โ–เฆœเฆฟเฆฒเฆพ โ–เฆชเฆฐเฆฟเฆทเฆฆ โ–เฆธเฆฟเฆŸเฆฟ โ–เฆ•เฆฐเงเฆชเง‹เฆฐเง‡เฆถเฆจ ... (+15 more)` | 25 |
| 32k | `โ–เฆฌเฆพเฆ‚เฆฒเฆพเฆฆเง‡เฆถเฆฐ โ–เฆธเงเฆฅเฆพเฆจเง€เฆฏเฆผ โ–เฆธเฆฐเฆ•เฆพเฆฐเฆฐ โ–เฆธเฆฟเฆœเฆฟเฆฒ เง‡ โ–เฆ†เฆธเง‡เฆคเฆพเฆ‡ โ–เฆœเฆฟเฆฒเฆพ โ–เฆชเฆฐเฆฟเฆทเฆฆ โ–เฆธเฆฟเฆŸเฆฟ โ–เฆ•เฆฐเงเฆชเง‹เฆฐเง‡เฆถเฆจ ... (+15 more)` | 25 |
| 64k | `โ–เฆฌเฆพเฆ‚เฆฒเฆพเฆฆเง‡เฆถเฆฐ โ–เฆธเงเฆฅเฆพเฆจเง€เฆฏเฆผ โ–เฆธเฆฐเฆ•เฆพเฆฐเฆฐ โ–เฆธเฆฟเฆœเฆฟเฆฒ เง‡ โ–เฆ†เฆธเง‡เฆคเฆพเฆ‡ โ–เฆœเฆฟเฆฒเฆพ โ–เฆชเฆฐเฆฟเฆทเฆฆ โ–เฆธเฆฟเฆŸเฆฟ โ–เฆ•เฆฐเงเฆชเง‹เฆฐเง‡เฆถเฆจ ... (+15 more)` | 25 |
### Key Findings
- **Best Compression:** 64k achieves 4.935x compression
- **Lowest UNK Rate:** 8k with 0.2384% 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 | 917 | 9.84 | 15,091 | 44.2% | 86.3% |
| **2-gram** | Subword | 598 ๐Ÿ† | 9.22 | 14,901 | 51.1% | 92.9% |
| **3-gram** | Word | 1,565 | 10.61 | 31,633 | 38.0% | 79.5% |
| **3-gram** | Subword | 1,912 | 10.90 | 68,690 | 32.6% | 79.7% |
| **4-gram** | Word | 2,617 | 11.35 | 60,965 | 35.0% | 72.0% |
| **4-gram** | Subword | 3,535 | 11.79 | 166,549 | 26.1% | 72.8% |
| **5-gram** | Word | 3,304 | 11.69 | 65,705 | 33.6% | 68.3% |
| **5-gram** | Subword | 4,752 | 12.21 | 229,112 | 22.8% | 68.8% |
### Top 5 N-grams by Size
**2-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `เฆธเฆพเฆ•เงเฆทเฆฐเฆคเฆพเฆฐ เฆนเฆพเฆฐเฆนเฆพเฆจ` | 26,823 |
| 2 | `เฆ…เฆคเฆพเฆฐ เฆฎเฆพ` | 20,497 |
| 3 | `เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพเฆฐ เฆ‰เฆชเฆพเฆคเงเฆค` | 19,704 |
| 4 | `เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพ เฆ‡เฆฒเฆพเฆคเฆพเฆ‡` | 19,552 |
| 5 | `เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ` | 19,533 |
**3-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ` | 19,527 |
| 2 | `เฆฎเฆพเฆฐเฆฟเฆฐ เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ•` | 19,526 |
| 3 | `เฆ…เฆคเฆพเฆฐ เฆฎเฆพ เฆฎเงเฆจเฆฟ` | 16,569 |
| 4 | `เฆ— เฆ…เฆคเฆพเฆฐ เฆฎเฆพ` | 15,694 |
| 5 | `เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ เฆ…เฆจเงเฆธเฆพเฆฐเง‡` | 14,182 |
**4-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `เฆฎเฆพเฆฐเฆฟเฆฐ เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ` | 19,525 |
| 2 | `เฆ— เฆ…เฆคเฆพเฆฐ เฆฎเฆพ เฆฎเงเฆจเฆฟ` | 15,620 |
| 3 | `เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ เฆ…เฆจเงเฆธเฆพเฆฐเง‡` | 14,181 |
| 4 | `เฆ…เฆ•เงเฆทเฆพเฆ‚เฆถ เฆฌเฆพเฆฐเง‹ เฆฆเงเฆฐเฆพเฆ˜เฆฟเฆฎเฆพเฆ‚เฆถ เฆ‡เฆฒเฆคเฆพเฆ‡` | 9,366 |
| 5 | `เฆฎเฆพเฆชเฆพเฆนเฆพเฆจเฆฐ เฆ…เฆ•เงเฆทเฆพเฆ‚เฆถ เฆฌเฆพเฆฐเง‹ เฆฆเงเฆฐเฆพเฆ˜เฆฟเฆฎเฆพเฆ‚เฆถ` | 9,315 |
**5-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `เฆฎเฆพเฆฐเฆฟเฆฐ เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ เฆ…เฆจเงเฆธเฆพเฆฐเง‡` | 14,180 |
| 2 | `เฆฎเฆพเฆชเฆพเฆนเฆพเฆจเฆฐ เฆ…เฆ•เงเฆทเฆพเฆ‚เฆถ เฆฌเฆพเฆฐเง‹ เฆฆเงเฆฐเฆพเฆ˜เฆฟเฆฎเฆพเฆ‚เฆถ เฆ‡เฆฒเฆคเฆพเฆ‡` | 9,315 |
| 3 | `เฆเฆนเฆพเฆฐ เฆฎเฆพเฆชเฆพเฆนเฆพเฆจเฆฐ เฆ…เฆ•เงเฆทเฆพเฆ‚เฆถ เฆฌเฆพเฆฐเง‹ เฆฆเงเฆฐเฆพเฆ˜เฆฟเฆฎเฆพเฆ‚เฆถ` | 9,310 |
| 4 | `เฆเฆนเฆพเฆจเฆฐ เฆ—เฆกเฆผ เฆ‰เฆš เฆนเฆพเฆจ เฆ‡เฆฒเฆคเฆพเฆ‡` | 6,096 |
| 5 | `เฆฎเฆพเฆจเงเฆจเฆพเฆนเฆพเฆคเงเฆค เฆเฆนเฆพเฆจเฆฐ เฆ—เฆกเฆผ เฆ‰เฆš เฆนเฆพเฆจ` | 6,096 |
**2-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `เฆฐ _` | 407,202 |
| 2 | `เฅค _` | 163,086 |
| 3 | `เฆนเฆพ เฆจ` | 154,676 |
| 4 | `เฆจ _` | 147,838 |
| 5 | `_ เฆฎเฆพ` | 138,460 |
**3-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `เฆฐ _ เฆฎเฆพ` | 95,254 |
| 2 | `เฆนเฆพ เฆจ _` | 94,536 |
| 3 | `_ เฆฌเฆพ เฆฐเง‹` | 68,915 |
| 4 | `เฆฌเฆพ เฆฐเง‹ _` | 68,891 |
| 5 | `_ เฆ‡ เฆ‰` | 64,643 |
**4-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ เฆฌเฆพ เฆฐเง‹ _` | 68,886 |
| 2 | `_ เฆ‡ เฆ‰ เฆจเฆฟ` | 64,359 |
| 3 | `เฆ‡ เฆ‰ เฆจเฆฟ เฆฏเฆผ` | 55,648 |
| 4 | `เฆ‰ เฆจเฆฟ เฆฏเฆผ เฆจ` | 55,615 |
| 5 | `เฆœ เฆจ เฆธเฆ‚ เฆ–เงเฆฏเฆพ` | 44,873 |
**5-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ เฆ‡ เฆ‰ เฆจเฆฟ เฆฏเฆผ` | 55,620 |
| 2 | `เฆ‡ เฆ‰ เฆจเฆฟ เฆฏเฆผ เฆจ` | 55,614 |
| 3 | `_ เฆœ เฆจ เฆธเฆ‚ เฆ–เงเฆฏเฆพ` | 44,868 |
| 4 | `_ เฆ‰ เฆชเฆพ เฆคเงเฆค _` | 36,516 |
| 5 | `_ เฆชเงŒ เฆฐ เฆธ เฆญเฆพ` | 34,339 |
### Key Findings
- **Best Perplexity:** 2-gram (subword) with 598
- **Entropy Trend:** Decreases with larger n-grams (more predictable)
- **Coverage:** Top-1000 patterns cover ~69% 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.7841 | 1.722 | 4.39 | 60,191 | 21.6% |
| **1** | Subword | 1.0505 | 2.071 | 11.75 | 3,037 | 0.0% |
| **2** | Word | 0.1820 | 1.134 | 1.54 | 262,172 | 81.8% |
| **2** | Subword | 0.6365 | 1.555 | 3.68 | 35,639 | 36.4% |
| **3** | Word | 0.0756 | 1.054 | 1.27 | 399,673 | 92.4% |
| **3** | Subword | 0.4888 | 1.403 | 2.43 | 130,940 | 51.1% |
| **4** | Word | 0.0494 ๐Ÿ† | 1.035 | 1.19 | 504,719 | 95.1% |
| **4** | Subword | 0.3613 | 1.285 | 1.77 | 317,931 | 63.9% |
### Generated Text Samples (Word-based)
Below are text samples generated from each word-based Markov chain model:
**Context Size 1:**
1. `เฆฌเฆพเฆฐเง‹ เฆœเฆฟเฆฒเฆพ เฆฌเง‡เฆฏเฆผเฆพเฆชเฆพ เงงเงซ เงชเงช เงฎเงจเงฎ เฆฎเฆฟเฆŸเฆพเฆฐ เฆซเงเฆŸ เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพเฆฐ เฆ‰เฆชเฆพเฆคเงเฆค เฆชเงŒเฆฐเฆธเฆญเฆพ เฆ†เฆนเฆพเฆจ เฆญเงŒเฆ—เฆฒเฆฟเฆ• เฆ‰เฆชเฆพเฆคเงเฆค เฆฌเงเฆฐเฆพเฆœเฆฟเฆฒเฆฐ เฆ”เฆฏเฆผเฆพเฆ‚เฆฎเงเฆ™`
2. `เฆ‡เฆ‰เฆจเฆฟเฆฏเฆผเฆจ เฆเฆ—เฆค เฆ—เฆพเฆ™ เฆฌเฆพเฆฐเง‹ เฆซเงเฆ‚เฆ—เฆพเฆฒเฆพเฆ‡เฆฐเง เฆฌเงเฆฒเฆฟเฆฏเฆผเฆพ เฆ•เฆฟเฆคเงเฆคเฆพเฆ“ เฆจเง‡เฆ‡ เฆ…เฆนเฆพเฆคเงเฆคเฆฌเฆพเฆฐเง‹ เฆเฆนเฆพเฆฐ เฆ†เฆฏเฆผเฆคเฆจ เฆฒเฆฏเฆผเฆพเฆนเฆพเฆจ เงชเงงเงฌ เฆ— เฆ…เฆคเฆพเฆฐ เฆฎเฆพ`
3. `เฆ‰เฆชเฆพเฆคเงเฆค เฆถเฆนเฆฐ เฆเฆนเฆพเฆฐ เฆ†เฆฏเฆผเฆคเฆจ เฆฒเฆฏเฆผเฆพเฆนเฆพเฆจ เงฉเงซเงช เฆ— เฆ…เฆคเฆพเฆฐ เฆฎเฆพ เฆนเฆพเฆฐเฆนเฆพเฆจ เงซเงฏ เงซ เฆ…เฆนเฆพเฆจเฆพเฆคเงเฆค เฆเฆธ เฆจเฆ‡เฆšเฆค เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพเฆฐ`
**Context Size 2:**
1. `เฆธเฆพเฆ•เงเฆทเฆฐเฆคเฆพเฆฐ เฆนเฆพเฆฐเฆนเฆพเฆจ เงซเงฏ เงซ เฆ…เฆนเฆพเฆจเฆพเฆคเงเฆค เฆ—เฆžเงเฆœเฆพเฆฎ เฆเฆนเฆพเฆจเฆฐ เฆธเฆพเฆ•เงเฆทเฆฐเฆคเฆพเฆฐ เฆนเฆพเฆฐเฆนเฆพเฆจ เงญเงจ เฆฎเงเฆจเฆฟเฆฐ เฆฎเฆพ เฆธเฆพเฆ•เงเฆทเฆฐเฆคเฆพเฆฐ เฆนเฆพเฆฐเฆนเฆพเฆจ เงฌเงซ เฆฌเฆพเฆฐเง‹ เฆนเง...`
2. `เฆ…เฆคเฆพเฆฐ เฆฎเฆพ เฆฎเงเฆจเฆฟ เงซเงฆ เฆฌเฆพเฆฐเง‹ เฆœเฆฟเฆฒเฆพ เฆฌเง‡เฆฏเฆผเฆพเฆชเฆพ เฆเฆฐเง‡ เฆชเงŒเฆฐเฆธเฆญเฆพเฆฐ เฆฎเฆพเฆจเง เฆถเฆนเฆฐเง‡เฆฆเง‡ เฆฌเฆพเฆฐเง‹ เงงเงง เงญเงฉเงฌเฆ— เฆ—เฆพเฆ™เง‡เฆฆเง‡ เฆฅเฆพเฆ‡เฆคเฆพเฆฐเฆพ เฆนเฆพเฆฐเฆฟ`
3. `เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพเฆฐ เฆ‰เฆชเฆพเฆคเงเฆค เฆญเฆพเฆฐเฆคเฆฐ เฆฎเฆพเฆฐเฆฟเฆฐ เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ เฆ…เฆจเงเฆธเฆพเฆฐเง‡ เฆ†เฆฒเฆธเฆŸเง‡เฆฐ เฆ•เฆพเฆ‰เฆจเงเฆŸเฆฟ เฆ‡เฆ‚เฆฐเง‡เฆœเฆฟ oglethorpe county เฆเฆนเฆพเฆจ ...`
**Context Size 3:**
1. `เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ เฆ…เฆจเงเฆธเฆพเฆฐเง‡ เฆฌเฆพเฆฐเงเฆฌเง‹เฆธเฆพ เฆชเงŒเฆฐเฆธเฆญเฆพเฆนเฆพเฆจเฆฐ เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพ เฆ‡เฆฒเฆพเฆคเฆพเฆ‡ เงงเงฆ เงชเงจเงซ เฆ— เฆ…เฆคเฆพเฆฐ เฆฎเฆพ เฆฎเงเฆจเฆฟ เงซเงฆ เฆฌเฆพเฆฐเง‹ เฆœเฆฟเฆฒเฆพ เฆฌเง‡เฆฏ...`
2. `เฆฎเฆพเฆฐเฆฟเฆฐ เฆฎเฆพเฆจเงเฆฒเง‡เฆนเฆพ เฆฒเง‹เฆ• เฆ—เฆจเฆจเฆพ เฆ…เฆจเงเฆธเฆพเฆฐเง‡ เฆชเฆพเฆฒเง‡เฆธเฆŸเฆฟเฆจเฆพ เฆกเง‡ เฆ—เง‹เฆฏเฆผเฆพเฆธ เฆชเฆฐเงเฆคเงเฆ—เง€เฆœ santa bรกrbara de goiรกs เฆเฆนเฆพเฆจ เฆฌเงเฆฐเฆพเฆœเฆฟเฆฒเฆฐ เฆนเฆฎ...`
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. `เฆฐ_เฆธเฆพเฆ‡_เงฌเงฌ%เฅค_เฆ”เฆฏเฆผเฆพเฆ™เง‡เฆฆเง‡_เฆฅเฆพ_`
2. `เฅค_เฆ…เฆจเงเฆธเฆพเฆฐเง‡_เงฉเงงเฆคเฆฎ_เฆฌเฆฟเฆฏเฆผเฆพ_เฆœเฆฟเฆฒเฆพ`
3. `เฆนเฆพเฆจ_เฆเฆนเฆพเฆจ_เฆ‡เฆ‰เฆจเฆฟเฆฏเฆผเฆจเฆฐ_เฆธเฆพเฆจเงเฆŸเฆพ_`
**Context Size 3:**
1. `เฆฐ_เฆฎเฆพ_เฆธเฆพเฆ•เงเฆทเฆฐเฆคเฆพเฆฐ_เฆนเฆพเฆฐเฆนเฆพเฆจ_เงซเงฏ.`
2. `เฆนเฆพเฆจ_เงญเงฏ%,_เฆ…เฆคเฆพเฆฐ_เฆนเฆพเฆฐเฆนเฆพเฆจ_(`
3. `_เฆฌเฆพเฆฐเง‹_เฆ—เฆพเฆ™เง‡เฆฆเง‡_เฆฅเฆพเฆ‡เฆคเฆพเฆฐเฆพเฅค_เฆนเฆพเฆฐเฆฟ_เฆฌ`
**Context Size 4:**
1. `_เฆฌเฆพเฆฐเง‹_เฆœเฆฟเฆฒเฆพ/เฆฌเง‡เฆฏเฆผเฆพเฆชเฆพ_(เงงเงซ-เงชเงช_เฆฌ`
2. `_เฆ‡เฆ‰เฆจเฆฟเฆŸ_เฆ†เฆธเง‡เฅค_เฆšเงŒเฆฆเงเฆฆเฆพเฆนเฆพเฆจ_เฆฎเงเฆ™เง‡เฆฆเง‡:`
3. `เฆ‡เฆ‰เฆจเฆฟเฆฏเฆผเฆจ_เฆ†เฆ—เฅค_เฆญเงŒเฆ—เฆฒเฆฟเฆ•_เฆ‰เฆชเฆพเฆคเงเฆค_`
### Key Findings
- **Best Predictability:** Context-4 (word) with 95.1% predictability
- **Branching Factor:** Decreases with context size (more deterministic)
- **Memory Trade-off:** Larger contexts require more storage (317,931 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 | 32,965 |
| Total Tokens | 2,030,616 |
| Mean Frequency | 61.60 |
| Median Frequency | 3 |
| Frequency Std Dev | 897.18 |
### Most Common Words
| Rank | Word | Frequency |
|------|------|-----------|
| 1 | เฆฌเฆพเฆฐเง‹ | 68,888 |
| 2 | เฆ‡เฆ‰เฆจเฆฟเฆฏเฆผเฆจ | 42,535 |
| 3 | เฆ‰เฆชเฆพเฆคเงเฆค | 36,516 |
| 4 | เฆนเฆพเฆฐเฆนเฆพเฆจ | 31,910 |
| 5 | เฆฎเฆพ | 31,022 |
| 6 | เฆฎเฆพเฆจเง | 30,460 |
| 7 | เฆธเฆพเฆ•เงเฆทเฆฐเฆคเฆพเฆฐ | 26,839 |
| 8 | เฆ— | 26,421 |
| 9 | เฆ…เฆคเฆพเฆฐ | 25,584 |
| 10 | เฆœเฆจเฆธเฆ‚เฆ–เงเฆฏเฆพเฆฐ | 24,823 |
### 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.3137 |
| Rยฒ (Goodness of Fit) | 0.980288 |
| Adherence Quality | **excellent** |
### Coverage Analysis
| Top N Words | Coverage |
|-------------|----------|
| Top 100 | 62.6% |
| Top 1,000 | 89.9% |
| Top 5,000 | 95.0% |
| Top 10,000 | 96.8% |
### Key Findings
- **Zipf Compliance:** Rยฒ=0.9803 indicates excellent adherence to Zipf's law
- **High Frequency Dominance:** Top 100 words cover 62.6% of corpus
- **Long Tail:** 22,965 words needed for remaining 3.2% 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.6926 ๐Ÿ† | 0.3671 | N/A | N/A |
| **mono_64d** | 64 | 0.5161 | 0.3444 | N/A | N/A |
| **mono_128d** | 128 | 0.2440 | 0.3266 | N/A | N/A |
| **aligned_32d** | 32 | 0.6926 | 0.3703 | 0.0100 | 0.0740 |
| **aligned_64d** | 64 | 0.5161 | 0.3426 | 0.0240 | 0.1200 |
| **aligned_128d** | 128 | 0.2440 | 0.3276 | 0.0380 | 0.1340 |
### Key Findings
- **Best Isotropy:** mono_32d with 0.6926 (more uniform distribution)
- **Semantic Density:** Average pairwise similarity of 0.3465. Lower values indicate better semantic separation.
- **Alignment Quality:** Aligned models achieve up to 3.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 | **-0.006** | Low formulaic 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 |
|--------|----------|
| `-เฆพ` | เฆฌเฆพเฆฐเงเฆ‡เฆฏเฆผเฆพ, เฆ–เฆพเฆจเฆพ, เฆฌเงเฆฒเฆฒเฆพ |
| `-เฆฐ` | เงฆเงฆเงฆเฆฐ, เฆšเฆพเฆŸเฆฎเง‹เฆนเฆฐ, เฆซเงเฆฐ |
| `-เฆผเฆพ` | เฆฌเฆพเฆฐเงเฆ‡เฆฏเฆผเฆพ, เฆฌเง‡เฆฒเง‡เฆฏเฆผเฆพ, เฆญเฆฐเฆพเฆชเฆพเฆกเฆผเฆพ |
| `-เฆฏเฆผเฆพ` | เฆฌเฆพเฆฐเงเฆ‡เฆฏเฆผเฆพ, เฆฌเง‡เฆฒเง‡เฆฏเฆผเฆพ, เฆฌเฆกเฆผเฆนเฆพเฆคเฆฟเฆฏเฆผเฆพ |
| `-เงเฆฐ` | เฆซเงเฆฐ, เฆ—เง‹เฆชเฆพเฆฒเฆชเงเฆฐ, เฆธเฆฐเฆฆเฆพเฆฐเฆชเงเฆฐ |
| `-เฆชเงเฆฐ` | เฆ—เง‹เฆชเฆพเฆฒเฆชเงเฆฐ, เฆธเฆฐเฆฆเฆพเฆฐเฆชเงเฆฐ, เฆ•เงเฆคเฆฌเฆ‰เฆฒเงเฆฒเฆพเฆชเงเฆฐ |
| `-เฆฟเฆฏเฆผเฆพ` | เฆฌเฆกเฆผเฆนเฆพเฆคเฆฟเฆฏเฆผเฆพ, เฆฌเฆพเฆธเงเฆจเงเฆฆเฆฟเฆฏเฆผเฆพ, เฆ˜เฆพเฆŸเฆฒเง‹เฆฆเฆฟเฆฏเฆผเฆพ |
| `-เฆฐเฆพ` | เฆญเฆพเฆฆเงเฆฐเฆพ, เฆญเฆพเฆŸเฆพเฆฐเฆพ, เฆฎเง‹เฆฐเง‡เฆ‡เฆฐเฆพ |
### 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.
*No significant bound stems detected.*
### 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 |
|--------|--------|-----------|----------|
| `-เฆ•เฆพ` | `-เฆพ` | 44 words | เฆ•เฆพเฆฐเง‹เฆฌเฆพ, เฆ•เฆพเฆŸเฆพเงฑเฆพเฆฌเฆพ |
| `-เฆ•เฆพ` | `-เฆฐ` | 41 words | เฆ•เฆพเฆฎเฆฐ, เฆ•เฆพเฆจเงเฆจเฆพเฆจเงเฆฐ |
| `-เฆ•เฆพ` | `-เงเฆฐ` | 15 words | เฆ•เฆพเฆจเงเฆจเฆพเฆจเงเฆฐ, เฆ•เฆพเฆœเง€เฆชเงเฆฐ |
| `-เฆ•เฆพ` | `-เฆผเฆพ` | 15 words | เฆ•เฆพเฆฆเฆฟเฆฐเฆชเฆพเฆกเฆผเฆพ, เฆ•เฆพเฆฒเฆ•เฆฐเฆฟเฆฏเฆผเฆพ |
| `-เฆ•เฆพ` | `-เฆฏเฆผเฆพ` | 10 words | เฆ•เฆพเฆฒเฆ•เฆฐเฆฟเฆฏเฆผเฆพ, เฆ•เฆพเฆฒเฆพเฆฌเฆพเฆกเฆผเฆฟเฆฏเฆผเฆพ |
| `-เฆ•เฆพ` | `-เฆฟเฆฏเฆผเฆพ` | 10 words | เฆ•เฆพเฆฒเฆ•เฆฐเฆฟเฆฏเฆผเฆพ, เฆ•เฆพเฆฒเฆพเฆฌเฆพเฆกเฆผเฆฟเฆฏเฆผเฆพ |
| `-เฆ•เฆพ` | `-เฆชเงเฆฐ` | 5 words | เฆ•เฆพเฆœเง€เฆชเงเฆฐ, เฆ•เฆพเฆฒเฆฟเฆฆเฆพเฆธเฆชเงเฆฐ |
| `-เฆ•เฆพ` | `-เฆฐเฆพ` | 5 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 |
|------|-----------------|------------|------|
| เฆœเฆพเฆ™เงเฆ—เฆพเฆฒเฆฟเฆฏเฆผเฆพ | **`เฆœเฆพเฆ™เงเฆ—เฆพเฆฒ-เฆฟเฆฏเฆผเฆพ`** | 4.5 | `เฆœเฆพเฆ™เงเฆ—เฆพเฆฒ` |
| เฆฎเฆพเฆ–เฆฆเงเฆฎเฆชเงเฆฐ | **`เฆฎเฆพเฆ–เฆฆเงเฆฎ-เฆชเงเฆฐ`** | 4.5 | `เฆฎเฆพเฆ–เฆฆเงเฆฎ` |
| เฆธเงเฆฒเง‹เฆญเฆพเฆ•เฆฟเฆฏเฆผเฆพ | **`เฆธเงเฆฒเง‹เฆญเฆพเฆ•-เฆฟเฆฏเฆผเฆพ`** | 4.5 | `เฆธเงเฆฒเง‹เฆญเฆพเฆ•` |
| เฆฌเฆพเฆฒเงเฆฒเฆพเฆชเงเฆฐ | **`เฆฌเฆพเฆฒเงเฆฒเฆพ-เฆชเงเฆฐ`** | 4.5 | `เฆฌเฆพเฆฒเงเฆฒเฆพ` |
| เฆ“เฆธเฆฎเฆพเฆจเง€เฆฏเฆผเฆพ | **`เฆ“เฆธเฆฎเฆพเฆจเง€-เฆฏเฆผเฆพ`** | 4.5 | `เฆ“เฆธเฆฎเฆพเฆจเง€` |
| เฆ•เฆพเฆธเฆ•เฆพเฆฒเฆนเง‡เฆ‡เฆฐเฆพ | **`เฆ•เฆพ-เฆธเฆ•เฆพเฆฒเฆนเง‡เฆ‡-เฆฐเฆพ`** | 3.0 | `เฆธเฆ•เฆพเฆฒเฆนเง‡เฆ‡` |
| เฆ•เฆพเฆฐเงเฆชเงเฆชเงเฆฐ | **`เฆ•เฆพ-เฆฐเงเฆชเง-เฆชเงเฆฐ`** | 3.0 | `เฆฐเงเฆชเง` |
| เฆฌเฆพเฆนเฆพเฆฆเงเฆฐเฆชเงเฆฐ | **`เฆฌเฆพเฆนเฆพเฆฆ-เงเฆฐ-เฆชเงเฆฐ`** | 3.0 | `เฆฌเฆพเฆนเฆพเฆฆ` |
| เฆ•เฆพเฆซเง‡เฆฒเฆพเฆจเงเฆกเฆฟเฆฏเฆผเฆพ | **`เฆ•เฆพ-เฆซเง‡เฆฒเฆพเฆจเงเฆก-เฆฟเฆฏเฆผเฆพ`** | 3.0 | `เฆซเง‡เฆฒเฆพเฆจเงเฆก` |
| เฆ‡เฆŸเฆพเฆ•เง‹เฆฏเฆผเฆพเฆŸเฆฟเฆฏเฆผเฆพเฆฐเฆพ | **`เฆ‡เฆŸเฆพเฆ•เง‹เฆฏเฆผเฆพเฆŸ-เฆฟเฆฏเฆผเฆพ-เฆฐเฆพ`** | 3.0 | `เฆ‡เฆŸเฆพเฆ•เง‹เฆฏเฆผเฆพเฆŸ` |
| เฆชเง€เฆฐเฆฏเฆพเฆคเงเฆฐเฆพเฆชเงเฆฐ | **`เฆชเง€เฆฐเฆฏเฆพเฆคเง-เฆฐเฆพ-เฆชเงเฆฐ`** | 3.0 | `เฆชเง€เฆฐเฆฏเฆพเฆคเง` |
| เฆ•เฆพเฆธเฆธเฆฟเฆฒเฆพเฆจเงเฆกเฆฟเฆฏเฆผเฆพ | **`เฆ•เฆพ-เฆธเฆธเฆฟเฆฒเฆพเฆจเงเฆก-เฆฟเฆฏเฆผเฆพ`** | 3.0 | `เฆธเฆธเฆฟเฆฒเฆพเฆจเงเฆก` |
| เฆ•เฆพเฆถเฆพเฆฒเฆฟเฆฏเฆผเฆพ | **`เฆ•เฆพ-เฆถเฆพเฆฒเฆฟ-เฆฏเฆผเฆพ`** | 3.0 | `เฆถเฆพเฆฒเฆฟ` |
| เฆ•เฆพเฆ‰เฆจเงเฆฆเฆฟเฆฏเฆผเฆพ | **`เฆ•เฆพ-เฆ‰เฆจเงเฆฆ-เฆฟเฆฏเฆผเฆพ`** | 3.0 | `เฆ‰เฆจเงเฆฆ` |
| เฆ•เฆพเฆจเงเฆจเฆพเฆจเงเฆฐ | **`เฆ•เฆพ-เฆจเงเฆจเฆพเฆจ-เงเฆฐ`** | 3.0 | `เฆจเงเฆจเฆพเฆจ` |
### 6.6 Linguistic Interpretation
> **Automated Insight:**
The language Bishnupriya shows high morphological productivity. The subword models are significantly more efficient than word models, suggesting a rich system of affixation or compounding.
---
## 7. Summary & Recommendations
![Performance Dashboard](visualizations/performance_dashboard.png)
### Production Recommendations
| Component | Recommended | Rationale |
|-----------|-------------|-----------|
| Tokenizer | **64k BPE** | Best compression (4.94x) |
| N-gram | **2-gram** | Lowest perplexity (598) |
| Markov | **Context-4** | Highest predictability (95.1%) |
| 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-03 19:21:34*