Levenshtein transition table
| CANDIDATES | рэкламуе reklamuje BLR 🇧🇾 | рекламира reklamira BLG 🇧🇬 | reklamira reklamira CRO 🇭🇷 | inzeruje inzeruje CZE 🇨🇿 | reklamuje reklamuje POL 🇵🇱 | рекламируе rьeklamiruje RUS 🇷🇺 | inzeruje inzeruje SLK 🇸🇰 | oglašuje oglašuje SLN 🇸🇮 | рекламира reklamira SRB 🇷🇸 | рекламує reklamuje UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
| reklamuje | 0 | 3 | 3 ÷ 2 | 6 | 0 | 3 | 6 | 4 | 3 ÷ 2 | 0 | 25.0 | 0.0 |
| reklamira | 3 | 0 | 0 ÷ 2 | 8.5 | 3 | 4 | 8.5 | 7 | 0 ÷ 2 | 3 | 37.0 | -12.0 |
| rьeklamiruje | 3 | 4 | 4 ÷ 2 | 7.5 | 3 | 0 | 7.5 | 7 | 4 ÷ 2 | 3 | 39.0 | -14.0 |
| oglašuje | 4 | 7 | 7 ÷ 2 | 5 | 4 | 7 | 5 | 0 | 7 ÷ 2 | 4 | 43.0 | -18.0 |
| inzeruje | 6 | 8.5 | 8.5 ÷ 2 | 0 | 6 | 7.5 | 0 | 5 | 8.5 ÷ 2 | 6 | 47.5 | -22.5 |
1TOTAL LEVENSHTEIN DISTANCE - Summarized count of letter replacements, insertions or deletions to convert the word into national words. The lower the better.
2MUTUAL INTELLIGIBILITY LOSS - Distance to the best candidate word (the best word has always 0.0 score).
Dictionary Index • Levenshtein Distance • Pravopis • Home
slovanto.eu