language: am
language_name: AM
language_family: semitic_ethiopic
tags:
- wikilangs
- nlp
- tokenizer
- embeddings
- n-gram
- markov
- wikipedia
- monolingual
- family-semitic_ethiopic
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.278
- name: best_isotropy
type: isotropy
value: 0.907
- name: vocabulary_size
type: vocab
value: 108024
generated: 2025-12-27T00:00:00.000Z
AM - Wikilangs Models
Comprehensive Research Report & Full Ablation Study
This repository contains NLP models trained and evaluated by Wikilangs, specifically on AM 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 | 2.456x | 2.43 | 0.1639% | 455,103 |
| 16k | 2.758x | 2.73 | 0.1841% | 405,251 |
| 32k | 3.035x | 3.00 | 0.2026% | 368,183 |
| 64k | 3.278x ๐ | 3.24 | 0.2188% | 340,895 |
Tokenization Examples
Below are sample sentences tokenized with each vocabulary size:
Sample 1: `' แจ แปแญแ แแแฅ แแ แญแข
แแข แแฝแแแต
แแฐแฅ:แจแปแญแ แแแฅแณแต`
| Vocab | Tokens | Count |
|---|---|---|
| 8k | โ' โแจ โแปแญแ โแแแฅ โแแ แญแข โแแข โแแฝแแแต โแแฐแฅ : แจแปแญแ ... (+1 more) |
11 |
| 16k | โ' โแจ โแปแญแ โแแแฅ โแแ แญแข โแแข โแแฝแแแต โแแฐแฅ : แจแปแญแ ... (+1 more) |
11 |
| 32k | โ' โแจ โแปแญแ โแแแฅ โแแ แญแข โแแข โแแฝแแแต โแแฐแฅ : แจแปแญแ ... (+1 more) |
11 |
| 64k | โ' โแจ โแปแญแ โแแแฅ โแแ แญแข โแแข โแแฝแแแต โแแฐแฅ : แจแปแญแ ... (+1 more) |
11 |
Sample 2: `แขแตแฎแตแซ แแตแฅ แจแแฐแซ แจแแแฅ แ แญแแต แฒแแแฃ แจแแฐแซแแ แจแฑแแตแแดแ แ แแต แ แแต แแแ แฝแแฅแซ แแ แแแข
แ แแแแแต แแฐ...`
| Vocab | Tokens | Count |
|---|---|---|
| 8k | โแขแตแฎแตแซ โแแตแฅ โแจแแฐแซ โแจแแแฅ โแ แญแแต โแฒแแแฃ โแจแแฐแซ แแ โแจแฑ แ ... (+20 more) |
30 |
| 16k | โแขแตแฎแตแซ โแแตแฅ โแจแแฐแซ โแจแแแฅ โแ แญแแต โแฒแแแฃ โแจแแฐแซแแ โแจแฑ แ แตแ ... (+16 more) |
26 |
| 32k | โแขแตแฎแตแซ โแแตแฅ โแจแแฐแซ โแจแแแฅ โแ แญแแต โแฒแแแฃ โแจแแฐแซแแ โแจแฑ แ แตแแด ... (+14 more) |
24 |
| 64k | โแขแตแฎแตแซ โแแตแฅ โแจแแฐแซ โแจแแแฅ โแ แญแแต โแฒแแแฃ โแจแแฐแซแแ โแจแฑ แ แตแแด ... (+14 more) |
24 |
Sample 3: 1 January 1955 - 11 September 1955 แฅ.แค.แฃ. = 1947 แ .แ. 12 September 1955 - 31 Dec...
| Vocab | Tokens | Count |
|---|---|---|
| 8k | โ 1 โjanuary โ 1 9 5 5 โ- โ ... (+59 more) |
69 |
| 16k | โ 1 โjanuary โ 1 9 5 5 โ- โ ... (+59 more) |
69 |
| 32k | โ 1 โjanuary โ 1 9 5 5 โ- โ ... (+59 more) |
69 |
| 64k | โ 1 โjanuary โ 1 9 5 5 โ- โ ... (+59 more) |
69 |
Key Findings
- Best Compression: 64k achieves 3.278x compression
- Lowest UNK Rate: 8k with 0.1639% 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 | 10,759 ๐ | 13.39 | 48,164 | 21.6% | 40.3% |
| 2-gram | 2,321 ๐ | 11.18 | 26,048 | 32.4% | 67.6% |
| 3-gram | 16,194 | 13.98 | 68,935 | 19.7% | 36.8% |
| 3-gram | 21,529 | 14.39 | 173,382 | 11.5% | 34.1% |
| 4-gram | 45,509 | 15.47 | 148,975 | 14.6% | 27.1% |
| 4-gram | 104,202 | 16.67 | 623,179 | 6.7% | 19.0% |
Top 5 N-grams by Size
2-grams:
| Rank | N-gram | Count |
|---|---|---|
| 1 | แแ แข |
21,098 |
| 2 | แแฐแฅ : |
19,279 |
| 3 | แก แก |
9,600 |
| 4 | แแ แญ แข |
6,290 |
| 5 | แ . |
6,166 |
3-grams:
| Rank | N-gram | Count |
|---|---|---|
| 1 | แแณแ แแ แข |
5,880 |
| 2 | แจแ แแญแ แแณแ แแ |
5,832 |
| 3 | แ . แ |
5,831 |
| 4 | แข แแฐแฅ : |
5,106 |
| 5 | . แ . |
4,919 |
4-grams:
| Rank | N-gram | Count |
|---|---|---|
| 1 | แจแ แแญแ แแณแ แแ แข |
5,832 |
| 2 | แ . แ . |
4,753 |
| 3 | แฅ . แค . |
4,046 |
| 4 | . แค . แ |
3,983 |
| 5 | แแณแ แแ แข แตแญแแ |
3,720 |
Key Findings
- Best Perplexity: 2-gram with 2,321
- Entropy Trend: Decreases with larger n-grams (more predictable)
- Coverage: Top-1000 patterns cover ~19% 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.6978 | 1.622 | 4.88 | 254,884 | 30.2% |
| 1 | 1.4402 | 2.714 | 22.49 | 2,349 | 0.0% |
| 2 | 0.1891 | 1.140 | 1.44 | 1,243,645 | 81.1% |
| 2 | 1.1315 | 2.191 | 7.49 | 52,808 | 0.0% |
| 3 | 0.0627 | 1.044 | 1.12 | 1,794,848 | 93.7% |
| 3 | 0.6676 | 1.588 | 3.40 | 395,365 | 33.2% |
| 4 | 0.0256 ๐ | 1.018 | 1.04 | 2,006,381 | 97.4% |
| 4 | 0.4515 ๐ | 1.367 | 2.11 | 1,342,049 | 54.9% |
Generated Text Samples
Below are text samples generated from each Markov chain model:
Context Size 1:
แข แตแแ แญแต แคแต แแฃแฅแ แแแแแฅ แญแแญแ แณแ แฐแฅแ แจแแณแแแ แจแถแชแ แแแ แแตแฐแแญแ แตแแ แญแต แฝแแแญ แแแแตแต 1643 -แก แแตแจแ แฅแแฐแแ แญแแ แซแ แจแ แแญแ แแณแ แแ แแฐแฅ : / wiki / div id ) 2002. ) แฅแ แจแ แแ แฅแแแต แแ แแแแแซแต แญแแฅ แ แแจแญ แฃ 1943 ) แจแ แนแญ แแแฅ แณแแ แแฐแญ
Context Size 2:
แแ แข แตแญแแ แแแต แฒแณแฃ แฃ แแแณ แฐแแฅแฎแ แจแแ แแฉแ แตแแปแ แแ แข แ 13แแ แญแแ แแแ แจแชแแแแแฐแฅ : แจแฎแชแซ แแแฅแณแตแก แก แ แ แซแแ แแฝแณ แฅแ แจแ แแก แ แแต แ แซแฐแแแ แญแธแแแ แข แแแ แฅแแณแ แฐแแณแณแญ แฅแแจแต แจแฅแ แ แฅแญแฐ แแแณแต
Context Size 3:
แแณแ แแ แข แแแ แแญแแขแฅ แแป แแฐ แฐแญแถ แ แ แซ แแฐ แแฅ แแแ แฅแแฐแแแฑ แ แแตแ แฅแแฐแแแฑ แจแ แแญแ แแณแ แแแจแ แแญแ แแณแ แแ แข แตแญแแ แแฐแฅ : แซแแฐแฐแจแแ แแณแ แแฐแฅ : แฐแจแตแ แแณแ แแฐแฅ : แฐแจแตแ แแณแ แแฐแฅแ . แ . แ แแ แแแแต แแแณแต แแ แ แแ แแ แแญ แแแแ แญแแแแก แข แแฅแแแซ แแแถแฝ แญแ แจแแ
Context Size 4:
แจแ แแญแ แแณแ แแ แข แตแญแแ แแฐแฅ : แซแแฐแฐแจแแ แแณแ แแฐแฅ : แฐแจแตแ แแณแ แแฐแฅ : แฐแจแตแ แแณแ แแฐแฅ :แ . แ . แ แตแแตแ แแญแ แจ2091 แ . แ . แฐแญแแปแตแ แแฉแชแซ แแฐแฅ : แฐแญแแปแตแ แแฉแญแซ แแฐแฅ :แฅ . แค . แ . แ 1914 แจแฉแฒแซ แแแ แแแฅแต แแฎแแต ii ( 1894 - 1917 ) แฅ
Key Findings
- Best Predictability: Context-4 with 97.4% predictability
- Branching Factor: Decreases with context size (more deterministic)
- Memory Trade-off: Larger contexts require more storage (1,342,049 contexts)
- Recommendation: Context-3 or Context-4 for text generation
4. Vocabulary Analysis
Statistics
| Metric | Value |
|---|---|
| Vocabulary Size | 108,024 |
| Total Tokens | 1,810,273 |
| Mean Frequency | 16.76 |
| Median Frequency | 3 |
| Frequency Std Dev | 184.67 |
Most Common Words
| Rank | Word | Frequency |
|---|---|---|
| 1 | แแ | 28,114 |
| 2 | แฅแ | 23,158 |
| 3 | แแฐแฅ | 19,525 |
| 4 | แแญ | 13,580 |
| 5 | แแณแ | 12,239 |
| 6 | แแตแฅ | 9,959 |
| 7 | แแ แญ | 9,632 |
| 8 | แแฐ | 9,166 |
| 9 | แ | 8,691 |
| 10 | แ | 8,629 |
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.9297 |
| Rยฒ (Goodness of Fit) | 0.994674 |
| Adherence Quality | excellent |
Coverage Analysis
| Top N Words | Coverage |
|---|---|
| Top 100 | 22.3% |
| Top 1,000 | 44.9% |
| Top 5,000 | 65.4% |
| Top 10,000 | 74.1% |
Key Findings
- Zipf Compliance: Rยฒ=0.9947 indicates excellent adherence to Zipf's law
- High Frequency Dominance: Top 100 words cover 22.3% of corpus
- Long Tail: 98,024 words needed for remaining 25.9% coverage
5. Word Embeddings Evaluation
Model Comparison
| Model | Vocab Size | Dimension | Avg Norm | Std Norm | Isotropy |
|---|---|---|---|---|---|
| mono_32d | 40,456 | 32 | 3.565 | 0.969 | 0.8976 |
| mono_64d | 40,456 | 64 | 4.280 | 0.895 | 0.9070 ๐ |
| mono_128d | 40,456 | 128 | 5.026 | 0.790 | 0.8490 |
| embeddings_enhanced | 0 | 0 | 0.000 | 0.000 | 0.0000 |
Key Findings
- Best Isotropy: mono_64d with 0.9070 (more uniform distribution)
- Dimension Trade-off: Higher dimensions capture more semantics but reduce isotropy
- Vocabulary Coverage: All models cover 40,456 words
- Recommendation: 100d for balanced semantic capture and efficiency
6. Summary & Recommendations
Production Recommendations
| Component | Recommended | Rationale |
|---|---|---|
| Tokenizer | 32k BPE | Best compression (3.28x) with low UNK rate |
| N-gram | 5-gram | Lowest perplexity (2,321) |
| Markov | Context-4 | Highest predictability (97.4%) |
| 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-27 05:42:07











