perl-Text-Levenshtein
Calculate the Levenshtein edit distance between two strings
This module implements the Levenshtein edit distance, which measures the difference between two strings, in terms of the _edit distance_. This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same. To learn more about the Levenshtein metric, have a look at the at <a href="http://en.wikipedia.org/wiki/Levenshtein_distance">http://en.wikipedia.org/wiki/Levenshtein_distance</a> .
Tidak ada paket resmi yang tersedia untuk openSUSE Leap 16.0Distribusi
openSUSE Tumbleweed
openSUSE Leap 16.0
openSUSE Leap 15.6
openSUSE Leap 15.5
SLFO 1.2
Distribusi yang tak didukung
Distribusi berikut ini tidak didukung secara resmi. Gunakan paket ini dengan risiko Anda sendiri.