k*i&SSKJr SSKJr SSKJrJr SSKJr J r J r Jr SSS.SjrSSjrSSS.S jrSSS.S jrSS jrSSS.S jrSS jrSS.Sjr SS.Sjr g)) annotations)conv_sequences)is_none setupPandas)_block_similarityeditopsopcodes similarityN) processor score_cutoffcUbU"U5nU"U5n[X5up[U5[U5-n[X5nUSU-- nUbXc::aU$US-$)a] Calculates the minimum number of insertions and deletions required to change one sequence into the other. This is equivalent to the Levenshtein distance with a substitution weight of 2. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : int, optional Maximum distance between s1 and s2, that is considered as a result. If the distance is bigger than score_cutoff, score_cutoff + 1 is returned instead. Default is None, which deactivates this behaviour. Returns ------- distance : int distance between s1 and s2 Examples -------- Find the Indel distance between two strings: >>> from rapidfuzz.distance import Indel >>> Indel.distance("lewenstein", "levenshtein") 3 Setting a maximum distance allows the implementation to select a more efficient implementation: >>> Indel.distance("lewenstein", "levenshtein", score_cutoff=1) 2 )rlenlcs_seq_similarity)s1s2r r maximumlcs_simdists [/var/www/html/land-doc-ocr/venv/lib/python3.13/site-packages/rapidfuzz/distance/Indel_py.pydistancersn^ r] r] B #FB"gBG (G Q[ D (D,@4W|VWGWWcv[U5[U5-n[XU5nUSU-- nUbXc::aU$US-$)Nrr)rlcs_seq_block_similarity)blockrrr rrrs r_block_distancerIsK "gBG&u"5G Q[ D (D,@4W|VWGWWrcUbU"U5nU"U5n[X5up[U5[U5-n[X5nXE- nUbXc:aU$S$)a Calculates the Indel similarity in the range [max, 0]. This is calculated as ``(len1 + len2) - distance``. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : int, optional Maximum distance between s1 and s2, that is considered as a result. If the similarity is smaller than score_cutoff, 0 is returned instead. Default is None, which deactivates this behaviour. Returns ------- similarity : int similarity between s1 and s2 r)rrr)rrr r rrsims rr r Usa@ r] r] B #FB"gBG B D .C'3+>3FQFrc[5 [U5(d[U5(agUbU"U5nU"U5n[X5up[U5[U5-n[ X5nU(aXT- OSnUbXc::aU$S$)a Calculates a normalized levenshtein similarity in the range [1, 0]. This is calculated as ``distance / (len1 + len2)``. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : float, optional Optional argument for a score threshold as a float between 0 and 1.0. For norm_dist > score_cutoff 1.0 is returned instead. Default is 1.0, which deactivates this behaviour. Returns ------- norm_dist : float normalized distance between s1 and s2 as a float between 0 and 1.0 ?rr)rrrrr)rrr r rr norm_dists rnormalized_distancer#s~>Mr{{gbkk r] r] B #FB"gBG B D")qI%-1J9RQRRrcz[U5[U5-n[XU5nU(aXT- OSnUbXc::aU$S$)Nrr)rr)rrrr rrr"s r_block_normalized_distancer%sC "gBG 5b )D")qI%-1J9RQRRrc[5 [U5(d[U5(agUbU"U5nU"U5n[X5up[X5nSU- nUbXS:aU$S$)a  Calculates a normalized indel similarity in the range [0, 1]. This is calculated as ``1 - normalized_distance`` Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. score_cutoff : float, optional Optional argument for a score threshold as a float between 0 and 1.0. For norm_sim < score_cutoff 0 is returned instead. Default is 0, which deactivates this behaviour. Returns ------- norm_sim : float normalized similarity between s1 and s2 as a float between 0 and 1.0 Examples -------- Find the normalized Indel similarity between two strings: >>> from rapidfuzz.distance import Indel >>> Indel.normalized_similarity("lewenstein", "levenshtein") 0.85714285714285 Setting a score_cutoff allows the implementation to select a more efficient implementation: >>> Indel.normalized_similarity("lewenstein", "levenshtein", score_cutoff=0.9) 0.0 When a different processor is used s1 and s2 do not have to be strings >>> Indel.normalized_similarity(["lewenstein"], ["levenshtein"], processor=lambda s: s[0]) 0.8571428571428572 gr!r)rrrr#)rrr r r"norm_sims rnormalized_similarityr(sjdMr{{gbkk r] r] B #FB#B+IYH$,0H8PqPrc<[XU5nSU- nUbXS:aU$S$)Nr!r)r%)rrrr r"r's r_block_normalized_similarityr*s. +5b9IYH$,0H8PqPrr c[XUS9$)u Return Editops describing how to turn s1 into s2. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. Returns ------- editops : Editops edit operations required to turn s1 into s2 Notes ----- The alignment is calculated using an algorithm of Heikki Hyyrö, which is described [6]_. It has a time complexity and memory usage of ``O([N/64] * M)``. References ---------- .. [6] Hyyrö, Heikki. "A Note on Bit-Parallel Alignment Computation." Stringology (2004). Examples -------- >>> from rapidfuzz.distance import Indel >>> for tag, src_pos, dest_pos in Indel.editops("qabxcd", "abycdf"): ... print(("%7s s1[%d] s2[%d]" % (tag, src_pos, dest_pos))) delete s1[0] s2[0] delete s1[3] s2[2] insert s1[4] s2[2] insert s1[6] s2[5] r+)lcs_seq_editopsrrr s rrrsX 2Y 77rc[XUS9$)u Return Opcodes describing how to turn s1 into s2. Parameters ---------- s1 : Sequence[Hashable] First string to compare. s2 : Sequence[Hashable] Second string to compare. processor: callable, optional Optional callable that is used to preprocess the strings before comparing them. Default is None, which deactivates this behaviour. Returns ------- opcodes : Opcodes edit operations required to turn s1 into s2 Notes ----- The alignment is calculated using an algorithm of Heikki Hyyrö, which is described [7]_. It has a time complexity and memory usage of ``O([N/64] * M)``. References ---------- .. [7] Hyyrö, Heikki. "A Note on Bit-Parallel Alignment Computation." Stringology (2004). Examples -------- >>> from rapidfuzz.distance import Indel >>> a = "qabxcd" >>> b = "abycdf" >>> for tag, i1, i2, j1, j2 in Indel.opcodes(a, b): ... print(("%7s a[%d:%d] (%s) b[%d:%d] (%s)" % ... (tag, i1, i2, a[i1:i2], j1, j2, b[j1:j2]))) delete a[0:1] (q) b[0:0] () equal a[1:3] (ab) b[0:2] (ab) delete a[3:4] (x) b[2:2] () insert a[4:4] () b[2:3] (y) equal a[4:6] (cd) b[3:5] (cd) insert a[6:6] () b[5:6] (f) r+)lcs_seq_opcodesr.s rr r 4sd 2Y 77r)N) __future__rrapidfuzz._common_pyrrapidfuzz._utilsrrrapidfuzz.distance.LCSseq_pyrrrr-r r0r rrrr#r%r(r*rrr6s#/1 7X| X  (G^ +Sd S  =QH Q ,8f 28r