-
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
```…
-
I continued testing and analyzing Spelling Correction module as explained in pull request #213. There was a lack of dataset to test this module's performance and in order to overcome this issue 100 tw…
-
Hi,
Would like to understand which matching algo/model is agnostic to word orders? I realised for instance Levenshtein Distance might be affected by word orders.
Thanks
-
I was looking for combinators for the case where I want to do an approximate matching.
So for example I'm matching `************\d\d\d\d`, but I'll accept (for OCR) a few non-`*` characters in the fi…
-
There are several possible definitions of the number of hits when using the Levenshtein distance. The number of positions in the text with a distance less than the threshold is not very useful becau…
-
### Summary
The current implementation allows choosing between of Damerau-Levenshtein algorithm (2 implementations), Levenshtein algorithm, Jaro-Winkler algorithm, or ngram-based algorithm with non…
-
I'm surprised by the following output:
$ cat test.py
import pylev2
test_case = "00000001100111011000100011000000100011100011101000001000001000001000010011111110001000000010111111111011001000001…
-
Before comparing the file content using the Levenshtein or Jaro distance, first compare the two files using word-level trigrams to get the general sense of their similarity. Then, use the distance met…
-
Despite the help command, when a player do a mistype, it would be good to have an advisor who suggest the proper spelling for it. The system could suggest the closest to the last command typed by the …
-
```
It's possible to generate a Levenshtein automaton in O(n), and to run
comparison with another string in O(n), for a fixed max edit distance.
This paper has more info:
http://citeseerx.ist.psu.…