Levenshtein Distance
The algoritmic approach to resolve the best mutually intelligible word has no sentiment towards any language. Levenshtein distance algorithm counts letter replacements, instestions and deletion between words and tries to choose the word which is closest to all other words of the same meaning. Preferably the "center word" should have as small distance as possible so the reader can easily understand it from the context. If the distance is 1 (one letter changed) the understanding is quite easy. If the distance is higher (2 letters chaged) the understanding might be more complex. At 3 or 4 letters difference the understand requires word memorization just like learning a new language.
| Action | Penalty | Examples |
| Deletion | 1 | albo → abo |
| Insertion | 1 | albo → alebo |
| Replacement | 1 | gde ↔ kde |
| Diacritic | 0.5 | łosoś ↔ losoś |
| Y/I | 0.5 | bil ↔ byl |
| J/I | 0.5 | dlja ↔ dlia |
| Equivalence | 0 | masz = maš nie = ně |
This distance is calculated for all words and the word.
The word with the lowest distance to all other words is suggested for use in the dictionary.
See: Resolution Table for Salmon • Full Dictionary
Nastupna strana: Stems