Returns an integer that is the number of single-character inserts, deletes, or substitutions that would be required to change startString to endString. Useful for indexing and fuzzy search applications. The algorithm is described in Wikipedia <seealso href="https://en.wikipedia.org/wiki/Levenshtein_distance"/>

Syntax

ISTextUtilities.LevenshteinDistance(startString, endString, [ignoreCase])

Parameters

NameTypeOptionalByRefDescription
startString String The first string to compare.
endString String The second string to compare.
ignoreCase Boolean Optional Set TRUE for case-insensitive comparison If omitted, a value of False is assumed.

Return Value

Integer
Member of:
ISTextUtilities
Namespace:
Intersoft.ISRuntime6
Assembly:
ISRuntime6, Version=6.0.3
Target Framework:
.NET 9.0