{"version":"2.1.111","anchor":"faster-fuzzy-matching-with-damerau-levenshtein","canonical_anchor":"faster-fuzzy-matching-with-damerau-levenshtein","heading":"Faster Fuzzy Matching with Damerau-Levenshtein","tier":null,"area":null,"scope":null,"heads_up":null,"url":"https:\/\/changelogs.core-directive.com\/v\/2.1.111\/e\/faster-fuzzy-matching-with-damerau-levenshtein","release_url":"https:\/\/changelogs.core-directive.com\/v\/2.1.111","markdown":"### Faster Fuzzy Matching with Damerau-Levenshtein\n\nThe string distance algorithm used for fuzzy matching (e.g., command suggestions for typos) has been upgraded from standard Levenshtein distance to Damerau-Levenshtein distance, which also considers character transpositions. A configurable `maxEditDistance` parameter is now available.\n\n**Evidence**\n\nDamerau-Levenshtein algorithm in `EKY()` at line ~421613"}