< > BotCompany Repo | #1026092 // Bench Extended Ukkonen algorithm for Levenshtein distance (super fast when strings are equal/similar)

JavaX source code (desktop) [tags: use-pretranspiled] - run with: x30.jar

Download Jar. Libraryless. Click here for Pure Java version (8027L/54K).

!7

p-exp {
  int n = 5000;
  EditDistance dist = new(n);
  S a = randomID(n), b = randomID(n), c = firstToUpper(a);
  assertTrue(neq(a, b));
  double dist1 = 0, dist2 = 0, dist3 = 0;
  repeat 10 {
    time { dist1 = dist.d(a, b); }
    time { dist2 = dist.d(a, a); }
    time { dist3 = dist.d(a, c); }
  }
  assertTrue(dist1 != 0);
  assertEquals(0.0, dist2);
  assertEquals(1.0, dist3);
  print(dist1 + "/" + dist2 + "/" + dist3);
}

download  show line numbers  debug dex  old transpilations   

Travelled to 7 computer(s): bhatertpkbcr, jcllbfdqhrgy, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt

No comments. add comment