StringAlgorithmsLevenshteinDistance Method

Calculate the Levenshtein distance between two strings, i.e. the minimum number of edits in order to make the two strings equal

Namespace: DHI.Mike1D.Generic
Assembly: DHI.Mike1D.Generic (in DHI.Mike1D.Generic.dll) Version: 19.0.0.0 (11.1.1.1111)

Syntax

public static int LevenshteinDistance(
	string s,
	string t
)

Public Shared Function LevenshteinDistance ( 
	s As String,
	t As String
) As Integer

public:
static int LevenshteinDistance(
	String^ s, 
	String^ t
)

s: Type: SystemString
[Missing <param name="s"/> documentation for "M:DHI.Mike1D.Generic.StringAlgorithms.LevenshteinDistance(System.String,System.String)"]
t: Type: SystemString
[Missing <param name="t"/> documentation for "M:DHI.Mike1D.Generic.StringAlgorithms.LevenshteinDistance(System.String,System.String)"]

Type: Int32
0 if strings equals, a positive value if they differ

StringAlgorithmsAddLanguageSpecificTextSet("LSTE4BA9E07_0?cpp=::|nu=.");LevenshteinDistance Method