-
For anyone interested in playing more with fees.
Basically we'll want to use something like [Damerau–Levenshtein distance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance) such t…
huumn updated
9 months ago
-
Currently, `FuzzyEquals` makes use of the Levenshtein edit-distance algorithm. This counts substitutions, insertions, and deletions, but not transpositions. `FuzzyEquals()` should take into considerat…
-
Hi,
I'm just wondering if there is an example of using the current version of this package with the geographic method? If I try to add Haversine distance to my compare object, something like
```…
-
27.4. klo 7:30
Todella mielenkiintoinen projekti vaikuttaa olevan todella hyvällä mallilla. Koodia on helppo lukea.
damerau_levenshtein.py -tiedoston #-kommentit olisi hyvä muuttaa docstringiksi…
-
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 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…
-
Pagefind does not currently provide a spellcheck, to keep the network resource size down. Proposal:
- Identify high-value unique words on the site
- Add those words into the metadata index
- Prov…
-
Don't be too strict. Give an OK + hints like duolingo.
-
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…
-
Можно поискать какие-то "стандартные" способы коверкания слов (например, опечатки). Еще вариант - просто по расстоянию редактирования смотреть.
kmike updated
8 years ago