--- language: ab language_name: AB language_family: caucasian_northwest tags: - wikilangs - nlp - tokenizer - embeddings - n-gram - markov - wikipedia - monolingual - family-caucasian_northwest 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: 4.203 - name: best_isotropy type: isotropy value: 0.8443 - name: vocabulary_size type: vocab value: 34914 generated: 2025-12-27 --- # AB - Wikilangs Models ## Comprehensive Research Report & Full Ablation Study This repository contains NLP models trained and evaluated by Wikilangs, specifically on **AB** 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.211x | 3.15 | 0.1756% | 257,918 | | **16k** | 3.553x | 3.49 | 0.1943% | 233,133 | | **32k** | 3.880x | 3.81 | 0.2122% | 213,462 | | **64k** | 4.203x 🏆 | 4.13 | 0.2299% | 197,072 | ### Tokenization Examples Below are sample sentences tokenized with each vocabulary size: **Sample 1:** `Ѫ, ѫ — кириллтәи аҩыратә архаикатә иажәхьоу нбан. Азхьарԥшқәа Graphemica (Ѫ) ...` | Vocab | Tokens | Count | |-------|--------|-------| | 8k | `▁ ѫ , ▁ ѫ ▁— ▁кириллтәи ▁аҩыратә ▁архаикатә ▁иажәхьоу ... (+11 more)` | 21 | | 16k | `▁ ѫ , ▁ ѫ ▁— ▁кириллтәи ▁аҩыратә ▁архаикатә ▁иажәхьоу ... (+11 more)` | 21 | | 32k | `▁ ѫ , ▁ ѫ ▁— ▁кириллтәи ▁аҩыратә ▁архаикатә ▁иажәхьоу ... (+11 more)` | 21 | | 64k | `▁ ѫ , ▁ ѫ ▁— ▁кириллтәи ▁аҩыратә ▁архаикатә ▁иажәхьоу ... (+11 more)` | 21 | **Sample 2:** `Аби́а () — ҵиаа. Ашәыр. Ашәырҵла. Ахьарԥшқәа б` | Vocab | Tokens | Count | |-------|--------|-------| | 8k | `▁аби ́ а ▁() ▁— ▁ҵиаа . ▁ашәыр . ▁аш ... (+5 more)` | 15 | | 16k | `▁аби ́ а ▁() ▁— ▁ҵиаа . ▁ашәыр . ▁ашәырҵ ... (+4 more)` | 14 | | 32k | `▁аби ́а ▁() ▁— ▁ҵиаа . ▁ашәыр . ▁ашәырҵла . ... (+2 more)` | 12 | | 64k | `▁аби ́а ▁() ▁— ▁ҵиаа . ▁ашәыр . ▁ашәырҵла . ... (+2 more)` | 12 | **Sample 3:** `Ҝ, ҝ — кириллтәи аҩыратә нбан.` | Vocab | Tokens | Count | |-------|--------|-------| | 8k | `▁ ҝ , ▁ ҝ ▁— ▁кириллтәи ▁аҩыратә ▁нбан .` | 10 | | 16k | `▁ ҝ , ▁ ҝ ▁— ▁кириллтәи ▁аҩыратә ▁нбан .` | 10 | | 32k | `▁ ҝ , ▁ ҝ ▁— ▁кириллтәи ▁аҩыратә ▁нбан .` | 10 | | 64k | `▁ ҝ , ▁ ҝ ▁— ▁кириллтәи ▁аҩыратә ▁нбан .` | 10 | ### Key Findings - **Best Compression:** 64k achieves 4.203x compression - **Lowest UNK Rate:** 8k with 0.1756% 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** | 2,750 🏆 | 11.43 | 13,494 | 35.3% | 57.9% | | **2-gram** | 464 🏆 | 8.86 | 5,850 | 56.1% | 94.4% | | **3-gram** | 2,460 | 11.26 | 16,782 | 38.6% | 56.9% | | **3-gram** | 3,385 | 11.72 | 40,776 | 25.5% | 64.3% | | **4-gram** | 3,267 | 11.67 | 27,732 | 37.4% | 51.5% | | **4-gram** | 13,192 | 13.69 | 145,474 | 16.1% | 43.3% | ### Top 5 N-grams by Size **2-grams:** | Rank | N-gram | Count | |------|--------|-------| | 1 | `акатегориа :` | 5,231 | | 2 | `рыԥсҭазаара иалҵит` | 3,971 | | 3 | `иит рыԥсҭазаара` | 3,938 | | 4 | `нанҳәамза цәыббрамза` | 3,601 | | 5 | `жәабранмза хәажәкырамза` | 3,601 | **3-grams:** | Rank | N-gram | Count | |------|--------|-------| | 1 | `иит рыԥсҭазаара иалҵит` | 3,938 | | 2 | `ажьырныҳәамза жәабранмза хәажәкырамза` | 3,601 | | 3 | `жьҭаарамза абҵарамза ԥхынҷкәынмза` | 3,601 | | 4 | `мшаԥымза лаҵарамза рашәарамза` | 3,601 | | 5 | `ԥхынгәымза нанҳәамза цәыббрамза` | 3,601 | **4-grams:** | Rank | N-gram | Count | |------|--------|-------| | 1 | `лаҵарамза рашәарамза ԥхынгәымза нанҳәамза` | 3,601 | | 2 | `рашәарамза ԥхынгәымза нанҳәамза цәыббрамза` | 3,601 | | 3 | `ахҭысқəа ажьырныҳәамза жәабранмза хәажәкырамза` | 3,601 | | 4 | `мшаԥымза лаҵарамза рашәарамза ԥхынгәымза` | 3,601 | | 5 | `ԥхынгәымза нанҳәамза цәыббрамза жьҭаарамза` | 3,601 | ### Key Findings - **Best Perplexity:** 2-gram with 464 - **Entropy Trend:** Decreases with larger n-grams (more predictable) - **Coverage:** Top-1000 patterns cover ~43% 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.5772 | 1.492 | 3.62 | 99,604 | 42.3% | | **1** | 1.5567 | 2.942 | 13.88 | 876 | 0.0% | | **2** | 0.1878 | 1.139 | 1.43 | 360,470 | 81.2% | | **2** | 1.2241 | 2.336 | 6.90 | 12,157 | 0.0% | | **3** | 0.0635 | 1.045 | 1.11 | 515,280 | 93.6% | | **3** | 0.7258 | 1.654 | 3.34 | 83,923 | 27.4% | | **4** | 0.0257 🏆 | 1.018 | 1.04 | 573,219 | 97.4% | | **4** | 0.4863 🏆 | 1.401 | 2.16 | 280,678 | 51.4% | ### Generated Text Samples Below are text samples generated from each Markov chain model: **Context Size 1:** 1. `, аил - маклаи ихьӡ зху аҟәатәи аҳәынҭқарратә педагогтә институт . кёльн - рико ) ,` 2. `. алитература ахырхарҭала . уи азҵаара азыҳәан қьалышь - 1528 ашықәсқәа рзы агазет « titus andronicu...` 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 with 97.4% predictability - **Branching Factor:** Decreases with context size (more deterministic) - **Memory Trade-off:** Larger contexts require more storage (280,678 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 | 34,914 | | Total Tokens | 483,415 | | Mean Frequency | 13.85 | | Median Frequency | 3 | | Frequency Std Dev | 106.12 | ### Most Common Words | Rank | Word | Frequency | |------|------|-----------| | 1 | акатегориа | 5,263 | | 2 | уи | 4,164 | | 3 | рыԥсҭазаара | 4,025 | | 4 | иит | 3,987 | | 5 | иалҵит | 3,980 | | 6 | лаҵарамза | 3,888 | | 7 | жәабранмза | 3,837 | | 8 | хәажәкырамза | 3,833 | | 9 | ԥхынҷкәынмза | 3,805 | | 10 | абҵарамза | 3,804 | ### Least Common Words (from vocabulary) | Rank | Word | Frequency | |------|------|-----------| | 1 | адрес | 2 | | 2 | extended | 2 | | 3 | stream | 2 | | 4 | block | 2 | | 5 | stru | 2 | | 6 | compressed | 2 | | 7 | draft | 2 | | 8 | preston | 2 | | 9 | видеохәмарроуп | 2 | | 10 | авидеохәмаррақәа | 2 | ### Zipf's Law Analysis | Metric | Value | |--------|-------| | Zipf Coefficient | 0.9724 | | R² (Goodness of Fit) | 0.994461 | | Adherence Quality | **excellent** | ### Coverage Analysis | Top N Words | Coverage | |-------------|----------| | Top 100 | 30.1% | | Top 1,000 | 55.4% | | Top 5,000 | 76.6% | | Top 10,000 | 85.3% | ### Key Findings - **Zipf Compliance:** R²=0.9945 indicates excellent adherence to Zipf's law - **High Frequency Dominance:** Top 100 words cover 30.1% of corpus - **Long Tail:** 24,914 words needed for remaining 14.7% 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** | 12,418 | 32 | 3.919 | 0.892 | 0.8443 🏆 | | **mono_64d** | 12,418 | 64 | 4.225 | 0.826 | 0.5913 | | **mono_128d** | 12,418 | 128 | 4.285 | 0.827 | 0.1726 | | **embeddings_enhanced** | 0 | 0 | 0.000 | 0.000 | 0.0000 | ### Key Findings - **Best Isotropy:** mono_32d with 0.8443 (more uniform distribution) - **Dimension Trade-off:** Higher dimensions capture more semantics but reduce isotropy - **Vocabulary Coverage:** All models cover 12,418 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 (4.20x) with low UNK rate | | N-gram | **5-gram** | Lowest perplexity (464) | | 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 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 04:31:24*