§
    ùìNgD  ã                  ó¶   — 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© ó    úZ/var/www/html/ai-engine/env/lib/python3.11/site-packages/rapidfuzz/distance/Levenshtein.pyú<module>r      s²   ððð ð #Ð "Ð "Ð "Ð "Ð "à @Ð @Ð @Ð @Ð @Ð @à#€ØÐ˜DÐ"8Ñ9Ô9€ØÐ˜dÐ$<Ñ=Ô=€
Ø&Ð& tÐ-NÑOÔOÐ Ø(Ð(¨Ð/RÑSÔSÐ Ø
Ð
˜4Ð!6Ñ
7Ô
7€Ø
Ð
˜4Ð!6Ñ
7Ô
7€€€r   