
    9iD                        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y)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     h/var/www/html/backtest/airagagent/rag_env/lib/python3.12/site-packages/rapidfuzz/distance/Levenshtein.py<module>r      sg    # @#D"89d$<=
&t-NO (/RS 
4!6
7
4!6
7r   