Speed of levenshtein

[reza1615]

Thank you for your great package I compared this package speed with other cpython pakages and it is slower. is it possible to improve the speed?

a = 'fsffvfdsbbdfvvdavavavavavava'
b = 'fvdaabavvvvvadvdvavavadfsfsdafvvav'
# levenshtein
%%timeit
import editdistance
editdistance.eval(a, b)
# 2.12 µs ± 14.1 ns per loop (mean ± std. dev. of 7 runs, 100000 loops each)

%%timeit
from strsimpy.levenshtein import Levenshtein
Levenshtein = Levenshtein()
Levenshtein.distance(a,b)
# 528 µs ± 990 ns per loop (mean ± std. dev. of 7 runs, 1000 loops each)```

[github-actions[bot]]

Thanks for your first issue!

[luozhouyang]

editdistance is fast because it is implemented in C++. But this library is purely implemented in Python, so it is much slower.