CHR - Wikilangs Models
Comprehensive Research Report & Full Ablation Study
This repository contains NLP models trained and evaluated by Wikilangs, specifically on CHR 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

Analysis and Evaluation
- 1. Tokenizer Evaluation
- 2. N-gram Model Evaluation
- 3. Markov Chain Evaluation
- 4. Vocabulary Analysis
- 5. Word Embeddings Evaluation
- 6. Summary & Recommendations
- Metrics Glossary
- Visualizations Index
1. Tokenizer Evaluation
Results
| Vocab Size | Compression | Avg Token Len | UNK Rate | Total Tokens |
|---|---|---|---|---|
| 8k | 3.087x | 2.96 | 0.1137% | 95,883 |
| 16k | 3.454x | 3.32 | 0.1272% | 85,691 |
| 32k | 3.838x 🏆 | 3.68 | 0.1414% | 77,111 |
Tokenization Examples
Below are sample sentences tokenized with each vocabulary size:
Sample 1: `ᏍᎪᏯ ᏗᏃᎷᏩᏘᏍᎩ"Consortium Word List." 2016-04-15. (sgoya dinoluwatisgi)
ᏓᏓᏚᎬ ᎪᏪᎵ ...`
| Vocab | Tokens | Count |
|---|---|---|
| 8k | ▁ᏍᎪᏯ ▁ᏗᏃ ᎷᏩᏘᏍᎩ " consortium ▁word ▁list ." ▁ 2 ... (+31 more) |
41 |
| 16k | ▁ᏍᎪᏯ ▁ᏗᏃ ᎷᏩᏘᏍᎩ " consortium ▁word ▁list ." ▁ 2 ... (+30 more) |
40 |
| 32k | ▁ᏍᎪᏯ ▁ᏗᏃᎷᏩᏘᏍᎩ " consortium ▁word ▁list ." ▁ 2 0 ... (+26 more) |
36 |
Sample 2: `ᎤᎧᏲᏗ ᎡᎶᎯᏱ ...
Category:ᎠᏓᏕᏲᎲᏍᎩ ᎡᎶᎯ Category:To be checked`
| Vocab | Tokens | Count |
|---|---|---|
| 8k | ▁ᎤᎧ ᏲᏗ ▁ᎡᎶᎯ Ᏹ ▁... ▁category : ᎠᏓᏕᏲᎲᏍᎩ ▁ᎡᎶᎯ ▁category ... (+4 more) |
14 |
| 16k | ▁ᎤᎧᏲᏗ ▁ᎡᎶᎯ Ᏹ ▁... ▁category : ᎠᏓᏕᏲᎲᏍᎩ ▁ᎡᎶᎯ ▁category : ... (+3 more) |
13 |
| 32k | ▁ᎤᎧᏲᏗ ▁ᎡᎶᎯᏱ ▁... ▁category : ᎠᏓᏕᏲᎲᏍᎩ ▁ᎡᎶᎯ ▁category : to ... (+2 more) |
12 |
Sample 3: `ᎤᏢᏅᏛ"Consortium Word List." 2016-04-15. (tlvnvdv)
ᏓᏓᏚᎬ ᎪᏪᎵ
ᏙᏯᏗᏢ ᏗᏕᎬᏔᏛ
Cat...`
| Vocab | Tokens | Count |
|---|---|---|
| 8k | ▁ᎤᏢ ᏅᏛ " consortium ▁word ▁list ." ▁ 2 0 ... (+26 more) |
36 |
| 16k | ▁ᎤᏢᏅᏛ " consortium ▁word ▁list ." ▁ 2 0 1 ... (+25 more) |
35 |
| 32k | ▁ᎤᏢᏅᏛ " consortium ▁word ▁list ." ▁ 2 0 1 ... (+24 more) |
34 |
Key Findings
- Best Compression: 32k achieves 3.838x compression
- Lowest UNK Rate: 8k with 0.1137% 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
Results
| N-gram | Perplexity | Entropy | Unique N-grams | Top-100 Coverage | Top-1000 Coverage |
|---|---|---|---|---|---|
| 2-gram | 257 🏆 | 8.00 | 1,020 | 64.1% | 99.6% |
| 2-gram | 893 🏆 | 9.80 | 3,626 | 42.9% | 85.8% |
| 3-gram | 292 | 8.19 | 1,275 | 62.4% | 96.1% |
| 3-gram | 3,674 | 11.84 | 14,102 | 27.3% | 56.4% |
| 4-gram | 539 | 9.07 | 2,691 | 53.0% | 83.5% |
| 4-gram | 7,268 | 12.83 | 31,632 | 25.8% | 46.0% |
Top 5 N-grams by Size
2-grams:
| Rank | N-gram | Count |
|---|---|---|
| 1 | category : |
2,341 |
| 2 | be checked |
958 |
| 3 | to be |
958 |
| 4 | : to |
958 |
| 5 | ꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ |
609 |
3-grams:
| Rank | N-gram | Count |
|---|---|---|
| 1 | to be checked |
958 |
| 2 | : to be |
958 |
| 3 | category : to |
958 |
| 4 | ꮧꮥꭼꮤꮫ category : |
596 |
| 5 | ꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ category |
566 |
4-grams:
| Rank | N-gram | Count |
|---|---|---|
| 1 | category : to be |
958 |
| 2 | : to be checked |
958 |
| 3 | ꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ category : |
566 |
| 4 | ꮣꮣꮪꭼ ꭺꮺꮅ ꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ |
444 |
| 5 | ꭺꮺꮅ ꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ category |
428 |
Key Findings
- Best Perplexity: 2-gram with 257
- Entropy Trend: Decreases with larger n-grams (more predictable)
- Coverage: Top-1000 patterns cover ~46% of corpus
- Recommendation: 4-gram or 5-gram for best predictive performance
3. Markov Chain Evaluation
Results
| Context | Avg Entropy | Perplexity | Branching Factor | Unique Contexts | Predictability |
|---|---|---|---|---|---|
| 1 | 0.4793 | 1.394 | 2.62 | 13,897 | 52.1% |
| 1 | 1.6917 | 3.230 | 17.49 | 449 | 0.0% |
| 2 | 0.1273 | 1.092 | 1.24 | 36,338 | 87.3% |
| 2 | 1.0597 | 2.084 | 4.84 | 7,851 | 0.0% |
| 3 | 0.0430 | 1.030 | 1.08 | 45,090 | 95.7% |
| 3 | 0.5746 | 1.489 | 2.30 | 38,007 | 42.5% |
| 4 | 0.0217 🏆 | 1.015 | 1.04 | 48,532 | 97.8% |
| 4 | 0.2783 🏆 | 1.213 | 1.46 | 87,252 | 72.2% |
Generated Text Samples
Below are text samples generated from each Markov chain model:
Context Size 1:
. ꮳꮃꭹ ᏼꮻ . ᏹꮒꭼꮫꮎ , 537 the united nations statistics ꭸꮎꮣ ꭹ ꭹꭲꮒ ( ꮧꮡꮻꮝꮧrobinson: to be checked category : to be checked ꭿꭺꮹꮤ ꮎꮝꭶ ꮎꮝꮗ ꭶꮒꮭꭲ . " consortium, 863 , bekasi ) ꮔ nu ꮕ nv ) ꮣꮣꮪꭼ ꭺꮺꮅ ꮧꭷꮑꮝꮩꮧ " consortium word
Context Size 2:
category : to be checked category : ꭼꮓꮣ ꭰꭶꮞꮝꮩꮧ category : to be checked category : ꮒꭶꭵto be checked category : ꮳꮃꭹ category : ꭰꮒꮩꮃ category : ꭰᏸꮅ ꮪꮎꮩꮲꮹꮧꮢ category : ꮧꭶꭺꭿꮧ category: to be checked category : ꮳꮃꭹ category : ꭶꮎꮭꭲ ( ꮷꭶꮓꮾ ꭰꮊꮅꭶ ) category : ꮣꮆꮒꭶꮝꮫ
Context Size 3:
category : to be checked category : ꭴꮬꮹꮣ category : ꭶꮎꮭꭲ ( ꭱꮃꮧꮬ ) category : ꭶꮎꮭꭲ (: to be checked nds : land # länner sv : världsgeografi # lista över länderꮧꮥꭼꮤꮫ category : ꭼꮓꮣ ꭰꭶꮞꮝꮩꮧ category : to be checked category : ꭶꮎꮭꭲ ( ꮷꭶꮓꮾ ꭰꮊꮅꭶ ) category
Context Size 4:
category : to be checked category : ꭶꮎꮭꭲ ( ᏻꮃꮫ ) category : ꭶꮎꮭꭲ ( ꮷꭶꮓꮾ ꭰꮊꮅꭶ ) categoryꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ category : ꭼꮓꮣ ꭰꭶꮞꮝꮩꮧ category : to be checked nds : land # länner sv : världsgeografiꮣꮣꮪꭼ ꭺꮺꮅ ꮩꮿꮧꮲ ꮧꮥꭼꮤꮫ category : ꭴꮎꮩꮲꭿ category : to be checked category : ꭰᏸꮅ ꮪꮎꮩꮲꮹꮧꮢ category : to
Key Findings
- Best Predictability: Context-4 with 97.8% predictability
- Branching Factor: Decreases with context size (more deterministic)
- Memory Trade-off: Larger contexts require more storage (87,252 contexts)
- Recommendation: Context-3 or Context-4 for text generation
4. Vocabulary Analysis
Statistics
| Metric | Value |
|---|---|
| Vocabulary Size | 4,475 |
| Total Tokens | 42,573 |
| Mean Frequency | 9.51 |
| Median Frequency | 3 |
| Frequency Std Dev | 53.38 |
Most Common Words
| Rank | Word | Frequency |
|---|---|---|
| 1 | category | 2,341 |
| 2 | to | 976 |
| 3 | be | 960 |
| 4 | checked | 958 |
| 5 | ꭰꮄ | 903 |
| 6 | ꭿꭰ | 772 |
| 7 | ꮧꮥꭼꮤꮫ | 649 |
| 8 | ꮩꮿꮧꮲ | 611 |
| 9 | ꭺꮺꮅ | 548 |
| 10 | ꮣꮣꮪꭼ | 506 |
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.8972 |
| R² (Goodness of Fit) | 0.986656 |
| Adherence Quality | excellent |
Coverage Analysis
| Top N Words | Coverage |
|---|---|
| Top 100 | 44.9% |
| Top 1,000 | 76.0% |
| Top 5,000 | 0.0% |
| Top 10,000 | 0.0% |
Key Findings
- Zipf Compliance: R²=0.9867 indicates excellent adherence to Zipf's law
- High Frequency Dominance: Top 100 words cover 44.9% of corpus
- Long Tail: -5,525 words needed for remaining 100.0% coverage
5. Word Embeddings Evaluation
Model Comparison
| Model | Vocab Size | Dimension | Avg Norm | Std Norm | Isotropy |
|---|---|---|---|---|---|
| mono_32d | 1,242 | 32 | 2.681 | 0.618 | 0.2339 🏆 |
| mono_64d | 1,242 | 64 | 2.624 | 0.626 | 0.0550 |
| mono_128d | 1,242 | 128 | 2.563 | 0.654 | 0.0093 |
| embeddings_enhanced | 0 | 0 | 0.000 | 0.000 | 0.0000 |
Key Findings
- Best Isotropy: mono_32d with 0.2339 (more uniform distribution)
- Dimension Trade-off: Higher dimensions capture more semantics but reduce isotropy
- Vocabulary Coverage: All models cover 1,242 words
- Recommendation: 100d for balanced semantic capture and efficiency
6. Summary & Recommendations
Production Recommendations
| Component | Recommended | Rationale |
|---|---|---|
| Tokenizer | 32k BPE | Best compression (3.84x) with low UNK rate |
| N-gram | 5-gram | Lowest perplexity (257) |
| Markov | Context-4 | Highest predictability (97.8%) |
| 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
- Compare within model families: Metrics are most meaningful when comparing models of the same type (e.g., 8k vs 64k tokenizer).
- Consider trade-offs: Better performance on one metric often comes at the cost of another (e.g., compression vs. OOV rate).
- Context matters: Optimal values depend on downstream tasks. Text generation may prioritize different metrics than classification.
- Corpus influence: All metrics are influenced by corpus characteristics. Wikipedia text differs from social media or literature.
- 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 - a monthly snapshot of Wikipedia articles across 300+ languages.
Project
A project by Wikilangs - Open-source NLP models for every Wikipedia language.
Maintainer
Citation
If you use these models in your research, please cite:
@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
- 🤗 Models: huggingface.co/wikilangs
- 📊 Data: wikipedia-monthly
- 👤 Author: Omar Kamali
Generated by Wikilangs Models Pipeline
Report Date: 2025-12-28 22:42:07











