an / README.md
omarkamali's picture
Upload all models and assets for an (20251201)
09aa229 verified
---
language: an
language_name: AN
language_family: romance_iberian
tags:
- wikilangs
- nlp
- tokenizer
- embeddings
- n-gram
- markov
- wikipedia
- monolingual
- family-romance_iberian
license: mit
library_name: wikilangs
pipeline_tag: feature-extraction
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.796
- name: best_isotropy
type: isotropy
value: 0.8139
- name: vocabulary_size
type: vocab
value: 217616
generated: 2025-12-27
---
# AN - Wikilangs Models
## Comprehensive Research Report & Full Ablation Study
This repository contains NLP models trained and evaluated by Wikilangs, specifically on **AN** 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-gram)
- Markov chains (context of 1, 2, 3 and 4)
- Subword N-gram and Markov chains
- Embeddings in various sizes and dimensions
- 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. Summary & Recommendations](#6-summary--recommendations)
- [Metrics Glossary](#appendix-metrics-glossary--interpretation-guide)
- [Visualizations Index](#visualizations-index)
---
## 1. Tokenizer Evaluation
![Tokenizer Compression](visualizations/tokenizer_compression.png)
### Results
| Vocab Size | Compression | Avg Token Len | UNK Rate | Total Tokens |
|------------|-------------|---------------|----------|--------------|
| **8k** | 3.240x | 3.20 | 0.1217% | 1,479,330 |
| **16k** | 3.471x | 3.43 | 0.1304% | 1,380,762 |
| **32k** | 3.657x | 3.61 | 0.1374% | 1,310,812 |
| **64k** | 3.796x πŸ† | 3.75 | 0.1426% | 1,262,658 |
### Tokenization Examples
Below are sample sentences tokenized with each vocabulary size:
**Sample 1:** `Schnaitsee (en bavaro Schnoatsee) ye un municipio d'o districto de Traunstein en...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `▁sch na it see ▁( en ▁bavaro ▁sch no at ... (+25 more)` | 35 |
| 16k | `▁sch na it see ▁( en ▁bavaro ▁sch no at ... (+25 more)` | 35 |
| 32k | `▁sch na it see ▁( en ▁bavaro ▁sch no at ... (+25 more)` | 35 |
| 64k | `▁sch na it see ▁( en ▁bavaro ▁sch no at ... (+25 more)` | 35 |
**Sample 2:** `Chesa puet estar:
Chesa terreno con muito cheso u chacimiento de cheso.
Chesa, m...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `▁ch esa ▁puet ▁estar : ▁ch esa ▁terreno ▁con ▁muito ... (+23 more)` | 33 |
| 16k | `▁ch esa ▁puet ▁estar : ▁ch esa ▁terreno ▁con ▁muito ... (+21 more)` | 31 |
| 32k | `▁chesa ▁puet ▁estar : ▁chesa ▁terreno ▁con ▁muito ▁cheso ▁u ... (+18 more)` | 28 |
| 64k | `▁chesa ▁puet ▁estar : ▁chesa ▁terreno ▁con ▁muito ▁cheso ▁u ... (+18 more)` | 28 |
**Sample 3:** `L'ibΓ³n de ra SartΓ©n ye un ibΓ³n situau chunto o garmo de ra Mina (2.581 m) en l'A...`
| Vocab | Tokens | Count |
|-------|--------|-------|
| 8k | `▁l ' ibΓ³n ▁de ▁ra ▁sar t Γ©n ▁ye ▁un ... (+41 more)` | 51 |
| 16k | `▁l ' ibΓ³n ▁de ▁ra ▁sar t Γ©n ▁ye ▁un ... (+33 more)` | 43 |
| 32k | `▁l ' ibΓ³n ▁de ▁ra ▁sar t Γ©n ▁ye ▁un ... (+33 more)` | 43 |
| 64k | `▁l ' ibΓ³n ▁de ▁ra ▁sar tΓ©n ▁ye ▁un ▁ibΓ³n ... (+31 more)` | 41 |
### Key Findings
- **Best Compression:** 64k achieves 3.796x compression
- **Lowest UNK Rate:** 8k with 0.1217% 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 Coverage](visualizations/ngram_coverage.png)
### Results
| N-gram | Perplexity | Entropy | Unique N-grams | Top-100 Coverage | Top-1000 Coverage |
|--------|------------|---------|----------------|------------------|-------------------|
| **2-gram** | 18,567 πŸ† | 14.18 | 299,504 | 21.6% | 42.2% |
| **2-gram** | 321 πŸ† | 8.33 | 8,390 | 62.9% | 98.8% |
| **3-gram** | 65,327 | 16.00 | 654,301 | 13.6% | 29.7% |
| **3-gram** | 2,716 | 11.41 | 70,003 | 23.4% | 68.9% |
| **4-gram** | 178,250 | 17.44 | 1,306,932 | 8.6% | 21.3% |
| **4-gram** | 14,930 | 13.87 | 389,532 | 12.2% | 38.1% |
### Top 5 N-grams by Size
**2-grams:**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `d '` | 513,061 |
| 2 | `| |` | 216,222 |
| 3 | `categorΓ­a :` | 138,788 |
| 4 | `' a` | 107,710 |
| 5 | `' o` | 106,730 |
**3-grams:**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `d ' a` | 107,463 |
| 2 | `d ' o` | 106,609 |
| 3 | `| | |` | 81,137 |
| 4 | `categorΓ­a : cintas` | 47,877 |
| 5 | `| - |` | 47,248 |
**4-grams:**
| Rank | N-gram | Count |
|------|--------|-------|
| 1 | `| | | |` | 40,524 |
| 2 | `- | | |` | 39,996 |
| 3 | `| | socorro |` | 25,824 |
| 4 | `| linear | -` | 25,824 |
| 5 | `| socorro | |` | 25,824 |
### Key Findings
- **Best Perplexity:** 2-gram with 321
- **Entropy Trend:** Decreases with larger n-grams (more predictable)
- **Coverage:** Top-1000 patterns cover ~38% of corpus
- **Recommendation:** 4-gram or 5-gram for best predictive performance
---
## 3. Markov Chain Evaluation
![Markov Entropy](visualizations/markov_entropy.png)
![Markov Branching](visualizations/markov_branching.png)
### Results
| Context | Avg Entropy | Perplexity | Branching Factor | Unique Contexts | Predictability |
|---------|-------------|------------|------------------|-----------------|----------------|
| **1** | 0.6636 | 1.584 | 5.61 | 525,914 | 33.6% |
| **1** | 1.0327 | 2.046 | 7.36 | 3,250 | 0.0% |
| **2** | 0.3652 | 1.288 | 2.21 | 2,944,964 | 63.5% |
| **2** | 0.8991 | 1.865 | 6.02 | 23,920 | 10.1% |
| **3** | 0.1730 | 1.127 | 1.41 | 6,515,045 | 82.7% |
| **3** | 0.8416 | 1.792 | 4.55 | 143,854 | 15.8% |
| **4** | 0.0911 πŸ† | 1.065 | 1.19 | 9,175,931 | 90.9% |
| **4** | 0.7384 πŸ† | 1.668 | 3.44 | 654,131 | 26.2% |
### Generated Text Samples
Below are text samples generated from each Markov chain model:
**Context Size 1:**
1. `, pedanΓ­a . por aon serviban pa permitir que garra problema d ' arquitectura . bibliografΓ­a`
2. `de febrero , ugariticas y legendarios del xΓΊcar que lo paΓ­s exerce como l ' octubre`
3. `. isbn 978 - | 30 de roses en a estudiants mes recientment plegada d '`
**Context Size 2:**
1. `d ' aventuras dramaticas de 1992 22px | border espanya 22px francia 263 . je serai allΓ©e`
2. `| | | | 13 d ' el plantΓ­o como equipo local dica l ' ataque .`
3. `categorΓ­a : cintas interpretadas por joe baker categorΓ­a : cintas interpretadas por mort engelberg c...`
**Context Size 3:**
1. `d ' a empresa atac . redolada villa lazzaroni via appia nuova , circa d ' a mar`
2. `d ' o fisico y incheniero estausunidense karl jansky ( † 1950 ) . - naixencia en hamburgo`
3. `| | | | 12 de setiembre , 1998 loneos 52773 - 17 d ' octubre , 1977`
**Context Size 4:**
1. `| | | | 5 de chulio , 2000 loneos 33965 - 10 de chulio , 2000 linear 61258`
2. `- | | | | 2 de febrero , 2000 linear 50315 - 2 de febrero , 2000 linear`
3. `| | socorro | | linear | - | 87422 - | | | | 16 de setiembre ,`
### Key Findings
- **Best Predictability:** Context-4 with 90.9% predictability
- **Branching Factor:** Decreases with context size (more deterministic)
- **Memory Trade-off:** Larger contexts require more storage (654,131 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 | 217,616 |
| Total Tokens | 13,131,016 |
| Mean Frequency | 60.34 |
| Median Frequency | 4 |
| Frequency Std Dev | 2696.90 |
### Most Common Words
| Rank | Word | Frequency |
|------|------|-----------|
| 1 | de | 776,198 |
| 2 | d | 517,135 |
| 3 | a | 444,267 |
| 4 | en | 414,383 |
| 5 | o | 303,229 |
| 6 | y | 249,159 |
| 7 | categorΓ­a | 139,745 |
| 8 | que | 128,308 |
| 9 | l | 111,482 |
| 10 | ye | 109,905 |
### Least Common Words (from vocabulary)
| Rank | Word | Frequency |
|------|------|-----------|
| 1 | rochut | 2 |
| 2 | mΓ©chaly | 2 |
| 3 | wiedemann | 2 |
| 4 | limotte | 2 |
| 5 | wlodkowski | 2 |
| 6 | taos | 2 |
| 7 | slovis | 2 |
| 8 | samaha | 2 |
| 9 | seros | 2 |
| 10 | cookeville | 2 |
### Zipf's Law Analysis
| Metric | Value |
|--------|-------|
| Zipf Coefficient | 1.0856 |
| RΒ² (Goodness of Fit) | 0.997842 |
| Adherence Quality | **excellent** |
### Coverage Analysis
| Top N Words | Coverage |
|-------------|----------|
| Top 100 | 43.1% |
| Top 1,000 | 66.3% |
| Top 5,000 | 80.4% |
| Top 10,000 | 85.6% |
### Key Findings
- **Zipf Compliance:** RΒ²=0.9978 indicates excellent adherence to Zipf's law
- **High Frequency Dominance:** Top 100 words cover 43.1% of corpus
- **Long Tail:** 207,616 words needed for remaining 14.4% 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)
### Model Comparison
| Model | Vocab Size | Dimension | Avg Norm | Std Norm | Isotropy |
|-------|------------|-----------|----------|----------|----------|
| **mono_32d** | 130,625 | 32 | 3.989 | 1.163 | 0.8139 πŸ† |
| **mono_64d** | 130,625 | 64 | 4.561 | 1.144 | 0.8131 |
| **mono_128d** | 130,625 | 128 | 5.245 | 1.094 | 0.8002 |
| **embeddings_enhanced** | 0 | 0 | 0.000 | 0.000 | 0.0000 |
### Key Findings
- **Best Isotropy:** mono_32d with 0.8139 (more uniform distribution)
- **Dimension Trade-off:** Higher dimensions capture more semantics but reduce isotropy
- **Vocabulary Coverage:** All models cover 130,625 words
- **Recommendation:** 100d for balanced semantic capture and efficiency
---
## 6. Summary & Recommendations
![Performance Dashboard](visualizations/performance_dashboard.png)
### Production Recommendations
| Component | Recommended | Rationale |
|-----------|-------------|-----------|
| Tokenizer | **32k BPE** | Best compression (3.80x) with low UNK rate |
| N-gram | **5-gram** | Lowest perplexity (321) |
| Markov | **Context-4** | Highest predictability (90.9%) |
| 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},
publisher = {HuggingFace},
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)
---
*Generated by Wikilangs Models Pipeline*
*Report Date: 2025-12-27 06:02:07*