Levenshtein transition table
| CANDIDATES | идентифицира identificira BLG 🇧🇬 | identificira identificira CRO 🇭🇷 | identifikuje identifikuje CZE 🇨🇿 | identyfikuje identyfikuje POL 🇵🇱 | идентифицируе idьentificiruje RUS 🇷🇺 | identifikuje identifikuje SLK 🇸🇰 | identificira identificira SLN 🇸🇮 | идентификује identifikuje SRB 🇷🇸 | інструктує instruktuje UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
| identifikuje | 4 | 4 ÷ 2 | 0 | 0.5 | 4 | 0 | 4 | 0 ÷ 2 | 7 | 21.5 | 0.0 |
| identyfikuje | 4.5 | 4.5 ÷ 2 | 0.5 | 0 | 4.5 | 0.5 | 4.5 | 0.5 ÷ 2 | 7 | 24.0 | -2.5 |
| identificira | 0 | 0 ÷ 2 | 4 | 4.5 | 4 | 4 | 0 | 4 ÷ 2 | 10 | 28.5 | -7.0 |
| idьentificiruje | 4 | 4 ÷ 2 | 4 | 4.5 | 0 | 4 | 4 | 4 ÷ 2 | 10 | 34.5 | -13.0 |
| instruktuje | 10 | 10 ÷ 2 | 7 | 7 | 10 | 7 | 10 | 7 ÷ 2 | 0 | 59.5 | -38.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