StringAlgorithmsLevenshteinDistanceRef Method

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

Reference implementation that stores the entire distance matrix

Definition

Namespace: DHI.Mike1D.Generic
Assembly: DHI.Mike1D.Generic (in DHI.Mike1D.Generic.dll) Version: 24.0.0.0 (11.1.1.1111)
C#
public static int LevenshteinDistanceRef(
	string s,
	string t
)

Parameters

s  String

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

t  String

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

Return Value

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

See Also