Levenshtein transition table
CANDIDATES | уваход uvaĥod BLR 🇧🇾 | вход vĥod BLG 🇧🇬 | ulaz ulaz CRO 🇭🇷 | vstup vstup CZE 🇨🇿 | wejście vejsьcie POL 🇵🇱 | вход vĥod RUS 🇷🇺 | vstup vstup SLK 🇸🇰 | улаз ulaz SRB 🇷🇸 | вхід vĥid UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
vĥod | 2 | 0 | 4 ÷ 2 | 4 | 7 | 0 | 4 | 4 ÷ 2 | 1 | 22.0 | 0.0 |
vĥid | 3 | 1 | 4 ÷ 2 | 4 | 6 | 1 | 4 | 4 ÷ 2 | 0 | 23.0 | -1.0 |
vstup | 5 | 4 | 5 ÷ 2 | 0 | 6 | 4 | 0 | 5 ÷ 2 | 4 | 28.0 | -6.0 |
uvaĥod | 0 | 2 | 4 ÷ 2 | 5 | 8 | 2 | 5 | 4 ÷ 2 | 3 | 29.0 | -7.0 |
ulaz | 4 | 4 | 0 ÷ 2 | 5 | 8 | 4 | 5 | 0 ÷ 2 | 4 | 34.0 | -12.0 |
vejsьcie | 8 | 7 | 8 ÷ 2 | 6 | 0 | 7 | 6 | 8 ÷ 2 | 6 | 48.0 | -26.0 |
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