Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Finally got it...though it's not as beneficial as I had hoped</p> <pre><code> public static int DamerauLevenshteinDistance(string string1, string string2, int threshold) { // Return trivial case - where they are equal if (string1.Equals(string2)) return 0; // Return trivial case - where one is empty if (String.IsNullOrEmpty(string1) || String.IsNullOrEmpty(string2)) return (string1 ?? "").Length + (string2 ?? "").Length; // Ensure string2 (inner cycle) is longer if (string1.Length &gt; string2.Length) { var tmp = string1; string1 = string2; string2 = tmp; } // Return trivial case - where string1 is contained within string2 if (string2.Contains(string1)) return string2.Length - string1.Length; var length1 = string1.Length; var length2 = string2.Length; var d = new int[length1 + 1, length2 + 1]; for (var i = 0; i &lt;= d.GetUpperBound(0); i++) d[i, 0] = i; for (var i = 0; i &lt;= d.GetUpperBound(1); i++) d[0, i] = i; for (var i = 1; i &lt;= d.GetUpperBound(0); i++) { var im1 = i - 1; var im2 = i - 2; var minDistance = threshold; for (var j = 1; j &lt;= d.GetUpperBound(1); j++) { var jm1 = j - 1; var jm2 = j - 2; var cost = string1[im1] == string2[jm1] ? 0 : 1; var del = d[im1, j] + 1; var ins = d[i, jm1] + 1; var sub = d[im1, jm1] + cost; //Math.Min is slower than native code //d[i, j] = Math.Min(del, Math.Min(ins, sub)); d[i, j] = del &lt;= ins &amp;&amp; del &lt;= sub ? del : ins &lt;= sub ? ins : sub; if (i &gt; 1 &amp;&amp; j &gt; 1 &amp;&amp; string1[im1] == string2[jm2] &amp;&amp; string1[im2] == string2[jm1]) d[i, j] = Math.Min(d[i, j], d[im2, jm2] + cost); if (d[i, j] &lt; minDistance) minDistance = d[i, j]; } if (minDistance &gt; threshold) return int.MaxValue; } return d[d.GetUpperBound(0), d.GetUpperBound(1)] &gt; threshold ? int.MaxValue : d[d.GetUpperBound(0), d.GetUpperBound(1)]; } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. PODamerau - Levenshtein Distance, adding a threshold
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USCaffGeek
    1. USCaffGeek
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PODamerau - Levenshtein Distance, adding a threshold
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COIt's easy to see why this isn't very beneficial. You set the minDistance to be the threshold, then replace it only with smaller values, then test to see if minDistance remained the same or grew over calculation of the cost of a string. For the test to exit processing early, every index of d[i] must result in a cost greater than the threshold, and since this algorithm will never reduce a cost it has calculated, that's extremely pessimistic.
      singulars
      1. PO
      1. USKeithS
    2. COFrom what I can tell, each inner/`j` loop, must complete or the results become incorrect. The last item in the row is the maximum distance the transformation can take. The lowest value, is the minimum distance currently possible. Which is why I keep track of the lowest per row, and if it's already above the threshold, return. It should prevent several outer/`i` loops in strings that are wildly different
      singulars
      1. PO
      1. USCaffGeek
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload