-
This issue tracks missing components in the rust port:
- [ ] Levenshtein
- [x] basic distances
- [x] cached distances
- [ ] simd implementation
- [ ] edit operations
- [x] Damera…
-
```
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…
-
When I try to compare these two strings: "bla veg oil" and "bla vegetable oil" Normalized Levenshtein Distance algorithm never ends.
-
```
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…
-
```
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…
-
Currently, we suggest typo fixes in case of function calls, locals, and field accesses. So, both the marked lines below will suggest the correct fix:
``` rust
struct A {foo: u8}
fn main() {
let x…
-
## Information about Algorithm
The Levenshtein distance between two words is the minimum number of single-character edits (i.e., insertions, deletions, or substitutions) required to change one word…
-
https://en.wikipedia.org/wiki/Levenshtein_distance
Could use [`leven`](https://github.com/sindresorhus/leven). First, when indexing, make a separate array of all words used (or see if any way possi…
eklem updated
4 years ago