Download Jar. Libraryless. Click here for Pure Java version (8027L/54K).
1 | !7 |
2 | |
3 | p-exp {
|
4 | int n = 5000; |
5 | EditDistance dist = new(n); |
6 | S a = randomID(n), b = randomID(n), c = firstToUpper(a); |
7 | assertTrue(neq(a, b)); |
8 | double dist1 = 0, dist2 = 0, dist3 = 0; |
9 | repeat 10 {
|
10 | time { dist1 = dist.d(a, b); }
|
11 | time { dist2 = dist.d(a, a); }
|
12 | time { dist3 = dist.d(a, c); }
|
13 | } |
14 | assertTrue(dist1 != 0); |
15 | assertEquals(0.0, dist2); |
16 | assertEquals(1.0, dist3); |
17 | print(dist1 + "/" + dist2 + "/" + dist3); |
18 | } |
download show line numbers debug dex old transpilations
Travelled to 7 computer(s): bhatertpkbcr, jcllbfdqhrgy, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1026092 |
| Snippet name: | Bench Extended Ukkonen algorithm for Levenshtein distance (super fast when strings are equal/similar) |
| Eternal ID of this version: | #1026092/6 |
| Text MD5: | afe322864816e2fb92f7ed652d26764f |
| Transpilation MD5: | 5f493f407a59efff6a3433903c286c36 |
| Author: | stefan |
| Category: | javax |
| Type: | JavaX source code (desktop) |
| Public (visible to everyone): | Yes |
| Archived (hidden from active list): | No |
| Created/modified: | 2019-11-20 01:16:02 |
| Source code size: | 451 bytes / 18 lines |
| Pitched / IR pitched: | No / No |
| Views / Downloads: | 338 / 1228 |
| Version history: | 5 change(s) |
| Referenced in: | [show references] |