o
    ãºõfD  ã                   @  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.metricsÚlevenshtein_distanceÚlevenshtein_similarityÚlevenshtein_normalized_distanceÚ!levenshtein_normalized_similarityÚlevenshtein_editopsÚlevenshtein_opcodesN)Ú__doc__Ú
__future__r   Úrapidfuzz._utilsr   Ú_fallback_importÚ_modÚdistanceÚ
similarityÚnormalized_distanceÚnormalized_similarityÚeditopsÚopcodes© r   r   úW/home/ubuntu/webapp/venv/lib/python3.10/site-packages/rapidfuzz/distance/Levenshtein.pyÚ<module>   s   




