Levenshtein transition table
| CANDIDATES | аналогія analoɦija BLR 🇧🇾 | аналогия analogija BLG 🇧🇬 | analogija analogija CRO 🇭🇷 | analogie analogie CZE 🇨🇿 | analogia analogia POL 🇵🇱 | аналогия analogija RUS 🇷🇺 | analógia analógia SLK 🇸🇰 | analogija analogija SLN 🇸🇮 | аналогија analogija SRB 🇷🇸 | аналогія analoɦija UKR 🇺🇦 | TOTAL LEVENSHTEIN DISTANCE1 | MUTUAL INTELLIGIBILITY LOSS2 |
| analogija | 0.5 | 0 | 0 ÷ 2 | 2 | 1 | 0 | 1.5 | 0 | 0 ÷ 2 | 0.5 | 5.5 | 0.0 |
| analoɦija | 0 | 0.5 | 0.5 ÷ 2 | 2.5 | 1.5 | 0.5 | 2.0 | 0.5 | 0.5 ÷ 2 | 0 | 8.0 | -2.5 |
| analogia | 1.5 | 1 | 1 ÷ 2 | 1 | 0 | 1 | 0.5 | 1 | 1 ÷ 2 | 1.5 | 8.5 | -3.0 |
| analógia | 2.0 | 1.5 | 1.5 ÷ 2 | 1.5 | 0.5 | 1.5 | 0 | 1.5 | 1.5 ÷ 2 | 2.0 | 12.0 | -6.5 |
| analogie | 2.5 | 2 | 2 ÷ 2 | 0 | 1 | 2 | 1.5 | 2 | 2 ÷ 2 | 2.5 | 15.5 | -10.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