Umbali wa Levenshtein
Umbali wa Levenshtein, pia unajulikana kama umbali wa kuhariri, unapima idadi ndogo zaidi ya uhariri wa herufi moja (kuingiza, kufuta, kubadilisha) unaohitajika kubadilisha kamba moja kuwa nyingine. Ulianzishwa na Vladimir Levenshtein mnamo 1966, kipimo hiki ni kipimo halisi (kinachotimiza sifa zote za umbali) na ni msingi katika lugha ya kompyuta, kuangalia tahajia, kulinganisha mlolongo wa DNA, na kuunganisha rekodi. Unatoka 0 (kamba zinazofanana) hadi urefu wa kamba ndefu zaidi.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10, 707-710. link ↗
- Damerau, F. J. (1964). A technique for computer detection and correction of spelling errors. Communications of the ACM, 7(3), 171-176. DOI: 10.1145/363958.363994 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Levenshtein Distance Metric. ScholarGate. https://scholargate.app/sw/decision-making/levenshtein-distance
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Dynamic Time WarpingUfanyaji Maamuzi↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →