-
See https://github.com/codespell-project/codespell/pull/2092#issuecomment-933547257.
Choose a dictionary (the _aspell_ dictionary?) and calculate the [Damerau–Levenshtein distance](https://en.wikip…
-
The whole idea behind patterns is that they are a generalization of a set of trips. If we have a separate pattern for a school tripper (which makes an extra stop at a school at bell times), that kind …
-
Compatibility issue when installing Crypt::NaCl::Sodium on Debian server
Description:
I'm trying to install the Perl module Crypt::NaCl::Sodium on my Debian server, but I'm running into compatibil…
-
### Problem
Older version of nvim correctly detects latest version of Neovim::Ext as 0.06 when using :checkhealth
Current dev version improperly reports current version incorrectly as 5 and with…
-
The Smith-Waterman algorithm is essentially a paiwise sequence alignment algorithm typically used in bioinformatics to optimally align two (e.g. DNA) sequences.
The Smith-Waterman algorithm can be s…
-
This implementation seems to be wrong.
Althought I've not dive deep enough in the code to spot where is the bug, I've isolated a simple test case.
DL("beak", "water") returns 5 instead of 4
step 1
b…
-
Can we add a parameter like threshold or limit, if distance is above the threshold then just stop calculation and return? if would be really helpful in some cases, where you need compare the distance …
-
I found this excellent gem! 💎
It seems like there are a few ruby gems for string matching:
- https://github.com/kiyoka/fuzzy-string-match
- https://github.com/flori/amatch
- https://github.c…
-
Saw this project on reddit and thought it was really awesome. Keep up the good work, its a great a idea. Anyway, I saw that you said you were manually rejecting "false" hits which included identical t…
-
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…