-
It is not possible to correct Words, that have a higher Levenshtein-Distance than 2. (At least in German).
A parameter to change this would be much appreciated.
-
```
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…
-
Hi,
[Damerau–LevenshteinDistance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance) is the minimum number of edit operations ( insertions, deletions ,substitutions and transposi…
-
_From @girving on February 8, 2015 21:23_
This is a pretty cool trick, and would dramatically optimize typo search:
```
http://blog.notdot.net/2010/07/Damn-Cool-Algorithms-Levenshtein-Automata
```
…
-
Let's say I make a **signpost metatile on my primary set** on the middle layer. Its bottom layer is grass or something.
Now I have a secondary set that's got some special orange grass, and **I put th…
-
Hi,
I got many error when compile latest version, are these errors system-environment specific?
git clone https://github.com/chhylp123/hifiasm.git
cd hifiasm
```
make
g++ -c -g -O3 -msse4.2 …
-
-
There is an alternative matching algorithm that is used within SublimeText and possibly VSCode when you run any command or action panel within those applications. The core algorithm that they use is t…
-
## Abstract
Currently we have 2 different approaches for assets search. Levenshtein distance and search by a substring.
The problem is that:
1. Right now we are doing levenshtein in python (not…