-
```
What steps will reproduce the problem?
--------------------------------------
Compute the levenshtein distance between "709113544" and "1555855732":
var dmp = new diff_match_patch();
var diffs = …
-
```
What steps will reproduce the problem?
--------------------------------------
Compute the levenshtein distance between "709113544" and "1555855732":
var dmp = new diff_match_patch();
var diffs = …
-
```
What steps will reproduce the problem?
--------------------------------------
Compute the levenshtein distance between "709113544" and "1555855732":
var dmp = new diff_match_patch();
var diffs = …
-
```
What steps will reproduce the problem?
1. use std::vector for uxn::patl::levenshtein_distance
2. vector1: add vector1.resize(9,2). lookup: vector2: 1. vector2.resize(9,2)
and vector2.resize(32, 4…
-
### Description
The new collision distance functionality added in #662 (ping @rhaschke @davetcoleman) appears to be faulty (or hopefully we can just document it better and add some test cases as ex…
-
Sometimes the string diffs are just noise, eg. when either `actual` or `expected` is the empty string. Certain cheaters exploit the fact that you can specify `''` as the expected value and copy paste …
-
Hi, and thank you for using my algorithm.
First of all, I would like to update the URL of the Sift4 algorithm blog post. It is no longer located at https://siderite.blogspot.com/, instead it can be…
-
**Is your feature request related to a problem? Please describe.**
`jaccard_string_group()` takes too long on 25 million rows with about 1000 dirty categories, paring down to about 200 clean categori…
-
Hello.
Please add "skill drill" to Category drop menu on "Add Video/Project Editor" page.
Here are the Wizard and Master level knowledge nuggets:
Wizard
Algorithm
Boolean Operators
Mod Oper…
-
Add support for read-write and read-only properties.
Not sure how high a priority this is. Seems like it would require some type of semantic analysis, or could do a simple string distance or word ma…