glureau
/ levenshtein.kt
Created
April 28, 2025 09:11
— forked from ademar111190/levenshtein.kt
Levenshtein Distance algorithm implementation using Kotlin
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import kotlin.math.min | |
| fun levenshtein(lhs : CharSequence, rhs : CharSequence) : Int { | |
| if(lhs == rhs) { return 0 } | |
| if(lhs.isEmpty()) { return rhs.length } | |
| if(rhs.isEmpty()) { return lhs.length } | |
| val lhsLength = lhs.length + 1 | |
| val rhsLength = rhs.length + 1 |