-
I just tried to run a simple example with weighted-levenshtein on Linux (Fedora 36) with Python3.9 and Python3.10, but I did run into a segmentation fault.
I installed the library using:
```
pip in…
-
I'm not sure if SymSpell already has support for weighted edit distance. If so, please tell me how to use it.
Otherwise, I suggest to add this as another possible distance metric, in addition to Le…
-
What is the recommended practice for OCR typos that come from say poor kerning? Examples below.
mformation --> information
wntmg --> writing
The problem I have is that SymSpell `lookup_compound…
-
It could significantly slim down the data file graph if we could infer some of the typos using [string metric algorithms](https://en.wikipedia.org/wiki/String_metric) or other programmatic ways.
-
I'm using dam_lev in a jupyter notebook (5.4.0). Python 3.6.4 |Anaconda, Inc.| (default, Jan 16 2018, 10:22:32) [MSC v.1900 64 bit (AMD64)]. My OS is Windows 10. Running the code below, I get the erro…
-
### Summary
The current implementation allows choosing between of Damerau-Levenshtein algorithm (2 implementations), Levenshtein algorithm, Jaro-Winkler algorithm, or ngram-based algorithm with non…
-
Thanks for maintaining this excellent library. I am currently contributing to the rust clone of this. I have a few queries.
1. In the following upcoming change. Can you elaborate on how the pigeon …
-
There are several ways to compute the distance between two arrays, each with its unique characteristics and use cases. The most common ones include:
**Euclidean Distance**: This is probably the mos…
-
AFAICS, `lstmtraining` produces two types of figures for measuring the error:
1. **bag-of-character training error** (on `list.train`): this is shown as
- `char train=%.3f%%` every 100 iterations…
-
### Is your proposal related to a problem?
I have an application where I wish to link dataset A, representing noisy transactions, to dataset B, a master entity list. For dataset B (the master list)…