U
    ÿÌ-eD  ã                   @  s`   d Z ddlmZ ddlmZ dZeedƒZeedƒZeedƒZ	eedƒZ
eed	ƒZeed
ƒZdS )zæ
The Levenshtein (edit) distance is a string metric to measure the
difference between two strings/sequences s1 and s2.
It's defined as the minimum number of insertions, deletions or
substitutions required to transform s1 into s2.
é    )Úannotations)Úfallback_importzrapidfuzz.distance.metricsZlevenshtein_distanceZlevenshtein_similarityZlevenshtein_normalized_distanceZ!levenshtein_normalized_similarityZlevenshtein_editopsZlevenshtein_opcodesN)Ú__doc__Ú
__future__r   Zrapidfuzz._utilsr   Z_fallback_importÚ_modZdistanceZ
similarityZnormalized_distanceZnormalized_similarityZeditopsZopcodes© r   r   ú_/var/www/html/Darija-Ai-Train/env/lib/python3.8/site-packages/rapidfuzz/distance/Levenshtein.pyÚ<module>   s   




