Levenshtein transition table
| CANDIDATES | шахматы šaĥmaty BLR 🇧🇾 | шах šaĥ BLG 🇧🇬 | šah šah CRO 🇭🇷 | šachy šaĥy CZE 🇨🇿 | szachy šaĥy POL 🇵🇱 | шахматы šaĥmaty RUS 🇷🇺 | šach šaĥ SLK 🇸🇰 | šah šah SLN 🇸🇮 | шах šaĥ SRB 🇷🇸 | шахи šaĥy UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
| šaĥy | 3 | 1 | 2 ÷ 2 | 0 | 0 | 3 | 1 | 2 | 1 ÷ 2 | 0 | 11.5 | 0.0 |
| šaĥ | 4 | 0 | 1 ÷ 2 | 1 | 1 | 4 | 0 | 1 | 0 ÷ 2 | 1 | 12.5 | -1.0 |
| šah | 5 | 1 | 0 ÷ 2 | 2 | 2 | 5 | 1 | 0 | 1 ÷ 2 | 2 | 18.5 | -7.0 |
| šaĥmaty | 0 | 4 | 5 ÷ 2 | 3 | 3 | 0 | 4 | 5 | 4 ÷ 2 | 3 | 26.5 | -15.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