/// <summary>
/// Given a diff, measure its Levenshtein distance in terms of the number of inserted, deleted or substituted characters.
/// The minimum distance is 0 which means equality, the maximum distance is the length of the longer string.
/// </summary>
/// <returns>Number of changes or -1 if the Diff(text1, text2) was not run previously</returns>
public int DiffLevenshtein()
{
if (diffs == null)
{
return(-1);
}
return(diffMatchPatch.diff_levenshtein(diffs));
}
