Exemple #1
0
 /// <summary>
 ///  Computes the distance (the number of deletions, insertions, or substitutions required to transform one into the other) between the source and target arrays divided by the length of the longer array
 /// </summary>
 public static double MinEditDistAdj(string[] s, string[] t) => MinEditDistance.ComputeAdjusted(s, t);
Exemple #2
0
 /// <summary>
 ///  Computes the distance (the number of deletions, insertions, or substitutions required to transform one into the other) between the source and target arrays
 /// </summary>
 public static int MinEditDist(string[] s, string[] t) => MinEditDistance.Compute(s, t);