ti / README.md
omarkamali's picture
Upload all models and assets for ti (latest)
e44ba18 verified
---
language: ti
language_name: Tigrinya
language_family: semitic_ethiopic
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-semitic_ethiopic
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: 3.058
- name: best_isotropy
type: isotropy
value: 0.1219
- name: vocabulary_size
type: vocab
value: 0
generated: 2026-01-11
---
# Tigrinya - Wikilangs Models
## Comprehensive Research Report & Full Ablation Study
This repository contains NLP models trained and evaluated by Wikilangs, specifically on **Tigrinya** 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** | 2.515x | 2.52 | 0.2599% | 148,897 |
| **16k** | 2.779x | 2.78 | 0.2872% | 134,751 |
| **32k** | 3.058x ๐Ÿ† | 3.06 | 0.3160% | 122,449 |
### Tokenization Examples
Below are sample sentences tokenized with each vocabulary size:
**Sample 1:** `แŠขแŒฃแˆแ‹ซ (แฃ ) แ‰ฅแ‹ˆแŒแ‹’ แŠขแŒฃแˆแ‹ซแ‹Šแ‰ต แˆชแ“แ‰ฅแˆŠแŠญ ()แฃ แŠฃแ‰ฃแˆแŠ• แˆ˜แˆตแˆซแ‰ฒแ‰ตแŠ• แŠคแ‹แˆฎแŒณแ‹Š แˆ•แ‰ฅแˆจแ‰ตแฃ แˆตแŒแˆจ-แŠฃแˆ…แŒ‰แˆญ แˆแŠกแˆ‹แ‹Šแ‰ต แˆƒแŒˆแˆญ แŠฅแ‹ซแข แˆญ...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–แŠขแŒฃแˆแ‹ซ โ–( แฃ โ–) โ–แ‰ฅแ‹ˆแŒแ‹’ โ–แŠขแŒฃแˆแ‹ซ แ‹Šแ‰ต โ–แˆชแ“แ‰ฅแˆŠแŠญ โ–() แฃ ... (+18 more)` | 28 |
| 16k | `โ–แŠขแŒฃแˆแ‹ซ โ–( แฃ โ–) โ–แ‰ฅแ‹ˆแŒแ‹’ โ–แŠขแŒฃแˆแ‹ซ แ‹Šแ‰ต โ–แˆชแ“แ‰ฅแˆŠแŠญ โ–() แฃ ... (+17 more)` | 27 |
| 32k | `โ–แŠขแŒฃแˆแ‹ซ โ–( แฃ โ–) โ–แ‰ฅแ‹ˆแŒแ‹’ โ–แŠขแŒฃแˆแ‹ซแ‹Šแ‰ต โ–แˆชแ“แ‰ฅแˆŠแŠญ โ–() แฃ โ–แŠฃแ‰ฃแˆแŠ• ... (+14 more)` | 24 |
**Sample 2:** `แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ (แฃ )แฃ แ‰ฅแ‹ˆแŒแ‹’ แˆชแ“แ‰ฅแˆŠแŠญ แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ (แฃ )แฃ แŠฃแ‰ฅ แ‹ฐแ‰กแ‰ฃแ‹Š แˆธแАแŠฝ แŠ“แ‹ญ แ‹ฐแ‰กแ‰ฅ แŠฃแˆ˜แˆชแŠซ แŠฅแ‰ตแˆญแŠจแ‰ฅ แˆแˆต แŠฃแ‰ตแˆ‹แŠ•แ‰ฒแŠซแ‹Š แ‹แ‰…...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ โ–( แฃ โ–) แฃ โ–แ‰ฅแ‹ˆแŒแ‹’ โ–แˆชแ“แ‰ฅแˆŠแŠญ โ–แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ โ–( แฃ ... (+28 more)` | 38 |
| 16k | `โ–แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ โ–( แฃ โ–) แฃ โ–แ‰ฅแ‹ˆแŒแ‹’ โ–แˆชแ“แ‰ฅแˆŠแŠญ โ–แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ โ–( แฃ ... (+25 more)` | 35 |
| 32k | `โ–แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ โ–( แฃ โ–) แฃ โ–แ‰ฅแ‹ˆแŒแ‹’ โ–แˆชแ“แ‰ฅแˆŠแŠญ โ–แŠฃแˆญแŒ€แŠ•แ‰ฒแŠ“ โ–( แฃ ... (+22 more)` | 32 |
**Sample 3:** `แˆ›แ‰ฒแ‹ แˆตแ‰ฒแ‰จแŠ• แˆนแˆแ‹˜ (Matthew Steven ยซMattยป Schulze) แŠฃแˆœแˆชแŠซแ‹Š แ‰ฐแ‹‹แˆณแŠฃแ‹ญ แŠแˆแˆ แŠฅแ‹ฉแข แŠฃแ‰ฅ แˆšแ‹™แˆช แŠฅแ‹ฉ แ‰ฐแ‹ˆแˆŠแ‹ฑแข...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `โ–แˆ› แ‰ฒ แ‹ โ–แˆตแ‰ฒแ‰จแŠ• โ–แˆน แˆแ‹˜ โ–( mat th ew ... (+40 more)` | 50 |
| 16k | `โ–แˆ›แ‰ฒแ‹ โ–แˆตแ‰ฒแ‰จแŠ• โ–แˆนแˆแ‹˜ โ–( mat th ew โ–steven โ–ยซ matt ... (+29 more)` | 39 |
| 32k | `โ–แˆ›แ‰ฒแ‹ โ–แˆตแ‰ฒแ‰จแŠ• โ–แˆนแˆแ‹˜ โ–( matthew โ–steven โ–ยซ matt ยป โ–schulze ... (+22 more)` | 32 |
### Key Findings
- **Best Compression:** 32k achieves 3.058x compression
- **Lowest UNK Rate:** 8k with 0.2599% 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 | 674 | 9.40 | 936 | 35.2% | 100.0% |
| **2-gram** | Subword | 1,449 | 10.50 | 6,000 | 36.6% | 74.2% |
| **3-gram** | Word | 494 ๐Ÿ† | 8.95 | 653 | 38.5% | 100.0% |
| **3-gram** | Subword | 7,666 | 12.90 | 20,589 | 14.3% | 42.7% |
| **4-gram** | Word | 1,390 | 10.44 | 1,640 | 18.2% | 67.9% |
| **4-gram** | Subword | 19,863 | 14.28 | 45,780 | 8.8% | 28.2% |
| **5-gram** | Word | 1,166 | 10.19 | 1,246 | 17.6% | 82.5% |
| **5-gram** | Subword | 24,432 | 14.58 | 45,809 | 6.5% | 24.0% |
### Top 5 N-grams by Size
**2-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `แŠฉแ‹•แˆถ แŠฅแŒแˆช` | 161 |
| 2 | `แŠจแˆแŠก แ‹แŠ•` | 138 |
| 3 | `0 1` | 105 |
| 4 | `upright 0` | 103 |
| 5 | `frameless upright` | 103 |
**3-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `upright 0 1` | 103 |
| 2 | `frameless upright 0` | 103 |
| 3 | `แ‰…แ‹ตแˆš แˆแ‹ฐแ‰ฐ แŠญแˆญแˆตแ‰ถแˆต` | 28 |
| 4 | `แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚ แ‹ˆแˆฐแˆˆแˆ` | 23 |
| 5 | `แˆ™แˆ“แˆ˜แ‹ต แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚` | 23 |
**4-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `frameless upright 0 1` | 103 |
| 2 | `แˆ™แˆ“แˆ˜แ‹ต แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚ แ‹ˆแˆฐแˆˆแˆ` | 23 |
| 3 | `แАแ‰ขแ‹ญ แˆ™แˆ“แˆ˜แ‹ต แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚` | 21 |
| 4 | `แŠ•แ‹“แŠป แŠ•แ‹“แŠป แŠ•แ‹“แŠป แŠ•แ‹“แŠป` | 16 |
| 5 | `แ•แˆฎแŒแˆฝแŠ“แˆ แ‰ฐแŒปแ‹‹แ‰ณแ‹ญ แŠฉแ‹•แˆถ แŠฅแŒแˆช` | 15 |
**5-grams (Word):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `แАแ‰ขแ‹ญ แˆ™แˆ“แˆ˜แ‹ต แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚ แ‹ˆแˆฐแˆˆแˆ` | 21 |
| 2 | `แŠ•แ‹“แŠป แŠ•แ‹“แŠป แŠ•แ‹“แŠป แŠ•แ‹“แŠป แŠ•แ‹“แŠป` | 15 |
| 3 | `แ•แˆฎแŒแˆฝแŠ“แˆ แ‰ฐแŒปแ‹‹แ‰ณแ‹ญ แŠฉแ‹•แˆถ แŠฅแŒแˆช แŠฎแ‹ญแŠ‘` | 13 |
| 4 | `p q r s t` | 10 |
| 5 | `5 frameless upright 0 1` | 10 |
**2-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ แŠฃ` | 7,078 |
| 2 | `แ‰ต _` | 6,640 |
| 3 | `แŠ• _` | 6,434 |
| 4 | `แ‰ฅ _` | 5,376 |
| 5 | `_ แŠฅ` | 4,167 |
**3-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ แŠฃ แ‰ฅ` | 3,209 |
| 2 | `แŠฃ แ‰ฅ _` | 2,860 |
| 3 | `แ‰ณ แ‰ต _` | 1,640 |
| 4 | `_ แŠซ แ‰ฅ` | 965 |
| 5 | `_ แŠ“ แ‹ญ` | 961 |
**4-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ แŠฃ แ‰ฅ _` | 2,832 |
| 2 | `_ แŠ“ แ‹ญ _` | 750 |
| 3 | `_ แŠซ แ‰ฅ _` | 731 |
| 4 | `_ แ‹ต แˆ› _` | 658 |
| 5 | `_ แŠฅ แ‹ฉ แข` | 577 |
**5-grams (Subword):**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `_ แŠฅ แ‹ฉ แข _` | 522 |
| 2 | `แข _ แŠฃ แ‰ฅ _` | 424 |
| 3 | `แก _ แŠฃ แ‰ฅ _` | 350 |
| 4 | `_ แŠฃ แ‰ฅ _ แˆ˜` | 297 |
| 5 | `แŠข แ‰ต แ‹ฎ แŒต แ‹ซ` | 264 |
### Key Findings
- **Best Perplexity:** 3-gram (word) with 494
- **Entropy Trend:** Decreases with larger n-grams (more predictable)
- **Coverage:** Top-1000 patterns cover ~24% 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.6172 | 1.534 | 3.00 | 20,182 | 38.3% |
| **1** | Subword | 1.7048 | 3.260 | 18.92 | 788 | 0.0% |
| **2** | Word | 0.1201 | 1.087 | 1.20 | 60,235 | 88.0% |
| **2** | Subword | 0.8301 | 1.778 | 4.02 | 14,892 | 17.0% |
| **3** | Word | 0.0269 | 1.019 | 1.04 | 71,825 | 97.3% |
| **3** | Subword | 0.5079 | 1.422 | 2.25 | 59,764 | 49.2% |
| **4** | Word | 0.0074 ๐Ÿ† | 1.005 | 1.01 | 74,088 | 99.3% |
| **4** | Subword | 0.2614 | 1.199 | 1.48 | 134,188 | 73.9% |
### Generated Text Samples (Word-based)
Below are text samples generated from each word-based Markov chain model:
**Context Size 1:**
1. `แŠฃแ‰ฅ แ‹“แŠ•แ‰€แŒปแ‰ต แŠฎแŠ•แˆแ‹ฐแˆจแˆฝแŠ• แŠฉแ‹•แˆถ แŠฅแŒแˆช แŠญแˆˆแ‰ฅ แŠฎแ‹ญแŠ“ แŠฃแˆตแ‰ณแ‰ต 115 แŠชแˆŽแˆ˜แ‰ฐแˆญ แˆชแˆ’แ‰“ แ‰ตแˆญแŠจแ‰ฅ แŠ แ‰ฅ แˆฐแˆœแŠ• แŠฃแˆ…แŒ‰แˆญ แŠฃแˆ`
2. `แŠ“แ‹ญ แŒญแŠ•แ‰€แ‰ต แŠฃแ‰ฅ แ‹ตแˆ› แˆ“แ‹ฐ แŠฃแˆญแŠฅแˆตแ‰ฒ แŠซแ‰ฅแ‰ฒ แ‰ฆแ‰ณ แ‰ฅแŠขแŠ•แŽแˆญแˆœแˆฝแŠ• แŠฅแŠ“ แ‰ฑแˆ›แˆต แˆ†แˆŽแ”แ‹ญแŠ•แ‹จแŠ• แŠฃแ‰ฅ แ‹แŠพแА แ‰แˆญแŠฃแŠ• แ‰ฅแˆตแˆ`
3. `แŠฅแ‹ฉ แˆŠแŠขแŠฝแ‹Žแˆ แŒˆแˆˆ แŠซแ‰ฅแ‰ถแˆ แ‰ฅแ‰ฅแ‹แˆ’ แ‰ฐแ‰ฐแŠฐแˆตแ‰ตแŠ• แˆ›แˆจแŠธ แŠฅแ‹š แŠซแˆแŠฃแ‹ญ แ‹ฐแˆจแŒƒ แ‰ฅแˆแˆ“แ‹ แŠ•แ‰ฅแ‹™แˆ“แ‰ต แŠฃแ‹แ‹ฉ แ‰…แ‹ฑแˆต แ‰ฅแ‰ตแŒแˆญแŠ› แˆ˜แŒปแˆ•แแ‰ฒ`
**Context Size 2:**
1. `แŠฉแ‹•แˆถ แŠฅแŒแˆช แŠญแˆˆแ‰ฅ แŠฅแ‹ซ แŠฃแ‰ฅ แˆ…แŠ•แ‹ฒ แŠซแ‰ฅ แ‹˜แˆˆแ‹‹ แ‹“แ‰ แ‹ญแ‰ฒ แ‹ฐแŒˆแแ‰ฒ แˆ“แŠ•แ‰ฒ แŠฅแ‹ซ แŠฅแ‰ณ แŠญแˆˆแ‰ฅ แŠฃแ‰ฅ แŠจแ‰ฐแˆ› แ‹“แ‹ต`
2. `แŠจแˆแŠก แ‹แŠ• แŠฅแ‰ฒ แ‹“แˆšแˆ แŠญแแˆŠแ‰ต แŠ•แŠฝแŒˆแ‰ฅแˆญ แ‹แˆ•แŒแ‹™ แŠฃแˆ›แˆซแŒบแ‰ณแ‰ต แ‹ญแˆ•แ‰ฅแˆญ แˆ“แ‹ฐ แ‹“แˆšแˆ แŠ•แŠฃแ‰•แˆ‘ แŠ•แˆแˆแ‹‹แŒฅ แ‹ˆแ‹ญ แ‹ตแˆ•แˆช แˆแแŠ•แŒƒแˆญ แˆแˆตแ‰ตแŠ•แ‹แˆต`
3. `0 1 แˆชแ“แ‰ฅแˆŠแŠญ แŠฎแŠ•แŒŽ 2 344 858 30 5 frameless upright 0 1 แŠกแŒ‹แŠ•แ‹ณ แˆชแ“แ‰ฅแˆŠแŠญ แŠกแŒ‹แŠ•แ‹ณ 241`
**Context Size 3:**
1. `frameless upright 0 1 แˆ‹แ‰ตแ‰ญแ‹ซ แˆชแ“แ‰ฅแˆŠแŠญ แˆ‹แ‰ตแ‰ญแ‹ซ 64 589 1 925 800 34 3 frameless upright 0 1`
2. `upright 0 1 แŠคแˆญแ‰ตแˆซ แˆƒแŒˆแˆจ แŠคแˆญแ‰ตแˆซ 117 600 5 869 869 37 frameless upright 0 1 แˆตแ‹Šแ‹˜แˆญแˆ‹แŠ•แ‹ต แŠฎแŠ•แˆแ‹ฐแˆจแˆฝแŠ•`
3. `แ‰…แ‹ตแˆš แˆแ‹ฐแ‰ฐ แŠญแˆญแˆตแ‰ถแˆต แ‰ฅแŠฃแŠซแˆœแŠ’แ‹ต แŒˆแ‹›แŠข แ‰‚แˆฎแˆต แ‹“แ‰ข แ‹แŒ แแŠก แŒฅแŠ•แ‰ณแ‹ŠแАแ‰ต แ‹˜แˆ˜แА แˆ„แˆˆแŠ’แˆตแ‰ตแŠ• แ‹˜แˆ˜แА แ‰ขแ‹›แŠ•แ‰ณแ‹ญแŠ•แŠ• แˆฐแˆแˆซแ‰ณแ‰ต แŠคแ‹ฎแˆแ‹ซแŠ• แŠฃแ‹ฎแŠ•แ‹ซแŠ•แŠ• แŒแˆชแŠฝแŠ• แ‰ฅแˆฐแŠแˆ‘`
**Context Size 4:**
1. `frameless upright 0 1 แ‰ฑแˆญแŠช แˆชแ“แ‰ฅแˆŠแŠญ แ‰ฑแˆญแŠช 783 356 105 frameless upright 0 1 แˆตแ‹‹แ‹šแˆ‹แŠ•แ‹ต แŠ•แŒแˆตแАแ‰ต แˆตแ‹‹แ‹šแˆ‹แŠ•แ‹ต 17 364`
2. `แˆ™แˆ“แˆ˜แ‹ต แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚ แ‹ˆแˆฐแˆˆแˆ แ‹ตแˆ› แАแ‰ฒ แ‹˜แ‹ญแ‰ฐแˆ›แˆˆแŠ  แˆ•แŒแ‰ณแ‰ต แ‰ฅแˆแŒฝแ‹แ แŠ•แŠนแˆ‰ แˆ˜แ‹ณแ‹ซแ‰ต แˆ…แ‹ญแ‹ˆแ‰ต แˆ“แ‹ฐ แ‰ฅแˆ“แ‹ฐ แ‹แ‰ตแŠ•แŠญแ แŒŽแ‹ฐแˆŽ แ‹˜แ‹ญแ‰ฅแˆ‰ แˆƒแ‰ฅแ‰ณแˆแŠ• แ‹แ‹ฑแŠฅแŠ•`
3. `แАแ‰ขแ‹ญ แˆ™แˆ“แˆ˜แ‹ต แˆฐแˆˆแˆ‹แˆ แ‹“แˆˆแ‹ญแˆ‚ แ‹ˆแˆฐแˆˆแˆ แ‰ฅ แˆ…แˆ‹แ‹ˆ แˆ˜แˆ‹แŠฅแŠฝแ‰ฒ แŠฃแˆ‹แˆ… แŠญแŠ•แŠฃแˆแŠ• แŠฅแ‹แŠ• แŠฃแ‹šแ‹™แŠ“ แŠขแ‹ฉ แŠซแ‰ฅแ‰ถแˆ แ‹แŒ แ‰แˆตแŠ“แ‹ฎแˆ แˆฝแ‹ฑแˆฝแ‰ฐ แ‹“แŠ•แ‹ตแ‰ณแ‰ต แŠฅแˆแАแ‰ต แ‹ตแˆ•แˆช`
### Generated Text Samples (Subword-based)
Below are text samples generated from each subword-based Markov chain model:
**Context Size 1:**
1. `_แŠฃแ‰ แ‹ญ_แˆฐแˆˆ-แ‰ต_แŠ“_anc_`
2. `แŠ•แŠฉแ‰ฃแข_แˆ“แ‹˜_แก_แŠฃแŠซ_แˆ•_แŒ`
3. `แ‰ฅ_แŠญแˆญ_แ‹แŒญแŠ•แŒแˆซแ‰ตแฃ_แ‹ฐ_แŠ“`
**Context Size 2:**
1. `_แŠฃแ‰ฅ_แŠแŠ•_แ‰ฅแˆ…แ‹ญแ‹ˆแ‰ต_แˆตแˆžแˆ_`
2. `แ‰ต_แˆฑแแˆญ_แ‹แ‹ˆแ‹ตแŠ _แข_แАแ‹ญแˆซ_`
3. `แŠ•_16._171_แŒแ‹œ_แ‰ฅแŒแ‰กแŠก`
**Context Size 3:**
1. `_แŠฃแ‰ฅแŠก_แ‹ตแˆ›แก_แŠฃแˆƒแ‹ฑแ‰ณแ‰ต_7_แ‹‹`
2. `แŠฃแ‰ฅ_แ‹แАแ‰ แˆจแŠ•_แ‹แŠฃแ‹˜แ‹˜โ€™แˆžแก_แŠจ`
3. `แ‰ณแ‰ต_แŠ•แˆแŠฅแˆ›แŠ•_แŠฃแ‹ญแˆแ‹ตแŠ•_แŠ“_แ‹ซ`
**Context Size 4:**
1. `_แŠฃแ‰ฅ_แŠขแ‰ตแ‹ฎแŒตแ‹ซแ‹Š_แŠฃแ‹ˆแˆƒแˆƒแ‹ฒ_แˆ™แ‹š`
2. `_แŠ“แ‹ญ_แˆ˜แŒ€แˆ˜แˆญแ‰ณ_แˆฐแˆแˆซแ‰ณแ‰ต_แ‹แŠพแА`
3. `_แŠซแ‰ฅ_แ‹แˆแ‹•แ‰ฅแˆ‹_แ‹˜แˆˆแ‹‹_แŠฅแŠ•แ‰ตแŠธแ‹`
### Key Findings
- **Best Predictability:** Context-4 (word) with 99.3% predictability
- **Branching Factor:** Decreases with context size (more deterministic)
- **Memory Trade-off:** Larger contexts require more storage (134,188 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 | 7,251 |
| Total Tokens | 64,854 |
| Mean Frequency | 8.94 |
| Median Frequency | 3 |
| Frequency Std Dev | 43.70 |
### Most Common Words
| Rank | Word | Frequency |
|------|------|-----------|
| 1 | แŠฃแ‰ฅ | 2,873 |
| 2 | แŠฅแ‹ฉ | 820 |
| 3 | แŠ“แ‹ญ | 807 |
| 4 | แŠซแ‰ฅ | 750 |
| 5 | แ‹ตแˆ› | 704 |
| 6 | แŠฅแ‰ฒ | 554 |
| 7 | แˆแˆต | 433 |
| 8 | แŠจแˆ | 405 |
| 9 | แŠฅแ‹š | 370 |
| 10 | แˆ“แ‹ฐ | 339 |
### 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 | 0.9129 |
| Rยฒ (Goodness of Fit) | 0.984365 |
| Adherence Quality | **excellent** |
### Coverage Analysis
| Top N Words | Coverage |
|-------------|----------|
| Top 100 | 31.6% |
| Top 1,000 | 66.4% |
| Top 5,000 | 93.1% |
| Top 10,000 | 0.0% |
### Key Findings
- **Zipf Compliance:** Rยฒ=0.9844 indicates excellent adherence to Zipf's law
- **High Frequency Dominance:** Top 100 words cover 31.6% of corpus
- **Long Tail:** -2,749 words needed for remaining 100.0% 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.1219 ๐Ÿ† | 0.5907 | N/A | N/A |
| **mono_64d** | 64 | 0.0304 | 0.6195 | N/A | N/A |
| **mono_128d** | 128 | 0.0069 | 0.6350 | N/A | N/A |
| **aligned_32d** | 32 | 0.1219 | 0.6074 | 0.0108 | 0.2703 |
| **aligned_64d** | 64 | 0.0304 | 0.6287 | 0.0216 | 0.2973 |
| **aligned_128d** | 128 | 0.0069 | 0.6320 | 0.0486 | 0.4054 |
### Key Findings
- **Best Isotropy:** mono_32d with 0.1219 (more uniform distribution)
- **Semantic Density:** Average pairwise similarity of 0.6189. Lower values indicate better semantic separation.
- **Alignment Quality:** Aligned models achieve up to 4.9% 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 | **2.433** | 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 |
|--------|----------|
| `-แŠฃ` | แŠฃแˆˆแ‹, แŠฃแˆตแ‹’แ‰ก, แŠฃแŒˆแ‹ณแˆฒแ‰ต |
| `-แ‹` | แ‹แ‹“แ‰แŠ‘, แ‹แ‰ฃแŠ•, แ‹แАแ‰ฅแˆฉแˆ‹ |
| `-แ‰ฅ` | แ‰ฅ19, แ‰ฅแˆแ‰แŒฝแŒปแˆญ, แ‰ฅแˆ•แ‰ฒ |
| `-แŠ•` | แŠ•แ‹–แŠฆแˆ, แŠ•แ‹‹แ‰ตแŠ•, แŠ•แ‰แŒ แ‰ฃ |
| `-แ‰ฐ` | แ‰ฐแ‰˜แŒปแŒธแˆซแŠฆ, แ‰ฐแ‰–แŒบแˆฎแˆ, แ‰ฐแˆญแŒ“แˆš |
| `-แˆ` | แˆแˆตแ‰ฐแˆˆแŠฝแˆ, แˆแˆตแˆŠ, แˆแ‰ตแˆ“แ‹ |
| `-แˆ˜` | แˆ˜แˆญแ‹“แ‹แŠ•, แˆ˜แŠ•แŒŽ, แˆ˜แ‹“แˆตแŠจแˆญ |
| `-แŠญ` | แŠญแˆญแˆตแ‰ตแ‹ซแŠ“แ‹Šแ‰ต, แŠญแ‰ตแ‹“แ‰ต, แŠญแˆแˆจแ‹™ |
#### 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 |
|--------|--------|-----------|----------|
| `-แŠฃ` | `-แŠ•` | 20 words | แŠฃแ‹แ‹จแŠ•, แŠฃแˆ…แŒ‰แˆซแ‹แ‹ซแŠ• |
| `-แŠฃ` | `-แ‹ซแŠ•` | 9 words | แŠฃแˆ…แŒ‰แˆซแ‹แ‹ซแŠ•, แŠฃแ‹แˆตแ‰ตแˆญแ‹ซแŠ• |
| `-แˆ˜` | `-แŠ•` | 8 words | แˆ˜แˆญแ‹“แ‹แŠ•, แˆ˜แ‰ณแŠ• |
| `-แ‰ฅ` | `-แŠ•` | 6 words | แ‰ฅแŒแ‹ฐแˆฌแˆฝแŠ•, แ‰ฅแ‹™แˆƒแŠ• |
| `-แˆ˜` | `-แ‰ต` | 5 words | แˆ˜แŠ•แŒแˆตแ‰ณแ‹ŠแАแ‰ต, แˆ˜แˆตแˆ˜แˆซแ‰ต |
| `-แˆ` | `-แŠ•` | 5 words | แˆแˆแ‰•แ‰“แˆแŠ•, แˆแ‰•แˆซแ‰ฅแŠ• |
| `-แˆ˜` | `-แ‰ตแŠ•` | 5 words | แˆ˜แŒแ‰ฅแ‰ณแ‰ตแŠ•, แˆ˜แˆแˆญแˆ’แ‰ณแ‰ตแŠ• |
| `-แˆ˜` | `-แ‰ณแ‰ต` | 4 words | แˆ˜แŒฅแ‰ƒแ‹•แ‰ฒแ‰ณแ‰ต, แˆ˜แˆแŠฅแŠฝแ‰ตแ‰ณแ‰ต |
| `-แŠญ` | `-แ‰ต` | 3 words | แŠญแˆญแˆตแ‰ตแ‹ซแŠ“แ‹Šแ‰ต, แŠญแ‰ตแ‹“แ‰ต |
| `-แ‰ฅ` | `-แ‰ต` | 3 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 |
|------|-----------------|------------|------|
| แ‰ฑแˆญแŠญแˆ˜แŠ’แˆตแ‰ณแŠ•แŠ• | **`แ‰ฑแˆญแŠญแˆ˜แŠ’แˆตแ‰ณแŠ•-แŠ•`** | 1.5 | `แ‰ฑแˆญแŠญแˆ˜แŠ’แˆตแ‰ณแŠ•` |
| แŠฃแˆฐแˆ‹แˆ™แ‹“แˆˆแ‹ญแŠฉแˆ | **`แŠฃ-แˆฐแˆ‹แˆ™แ‹“แˆˆแ‹ญแŠฉแˆ`** | 1.5 | `แˆฐแˆ‹แˆ™แ‹“แˆˆแ‹ญแŠฉแˆ` |
| แŠฃแ‹แˆตแ‰ตแˆซแˆŠแ‹ซแ‹แ‹ซแŠ• | **`แŠฃแ‹แˆตแ‰ตแˆซแˆŠแ‹ซแ‹แ‹ซ-แŠ•`** | 1.5 | `แŠฃแ‹แˆตแ‰ตแˆซแˆŠแ‹ซแ‹แ‹ซ` |
| แŠขแŠ•แˆณแ‹ญแŠญแˆŽแ”แ‹ตแ‹ซแŠ• | **`แŠขแŠ•แˆณแ‹ญแŠญแˆŽแ”แ‹ตแ‹ซ-แŠ•`** | 1.5 | `แŠขแŠ•แˆณแ‹ญแŠญแˆŽแ”แ‹ตแ‹ซ` |
### 6.6 Linguistic Interpretation
> **Automated Insight:**
The language Tigrinya 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 | **32k BPE** | Best compression (3.06x) |
| N-gram | **3-gram** | Lowest perplexity (494) |
| Markov | **Context-4** | Highest predictability (99.3%) |
| 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-11 00:50:27*