-
Another baseline that could be considered is a normalized levenshtein edit distance: 1 - (edit distance / len(longest string)
-
Hey,
I'm trying to build dawn on iOS but unfortunately Im encoutering a build issue.
Steps:
1. Clone the repo
2. `git submodule update --init`
3. `cd package && yarn`
4. `yarn build-daw…
-
### Is your proposal related to a problem?
We've been working with splink to do a bit of address matching, and have identified cases where:
1. We can't use Levenshtein distance because it wouldn't…
-
## Use case
Approximative search leveraging Levenshtein distance between words
-
Hello,
I wanted to know if the library has support to provide custom edit penalties. For example, specify edit distance for replacement "1" -> "l" to be different from "1" -> "A", etc.
Alberto.
-
Hello, I noticed that utbox already has a Levenshtein distance function, which is great, but for some use-cases Damerau-Levenshtein yields more useful results.
Would you be open to adding Damerau–L…
-
Dear All,
I got confused with Task 1 : "Two letters are considered close to each other if both their row and column distance is at most 1. Close keys are at distance 0.5, others are at distance 1."
…
-
I was wondering whether this library uses the bit parallel speed up tricks from:
https://www.win.tue.nl/~jfg/educ/bit.mat.pdf
https://users.dcc.uchile.cl/~gnavarro/ps/jea06.pdf
They seem very w…
-
```
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…
-
```
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…