How to Install and Uninstall perl-Text-Levenshtein Package on openSuSE Tumbleweed
Last updated: November 23,2024
1. Install "perl-Text-Levenshtein" package
In this section, we are going to explain the necessary steps to install perl-Text-Levenshtein on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
perl-Text-Levenshtein
Copied
2. Uninstall "perl-Text-Levenshtein" package
This tutorial shows how to uninstall perl-Text-Levenshtein on openSuSE Tumbleweed:
$
sudo zypper remove
perl-Text-Levenshtein
Copied
3. Information about the perl-Text-Levenshtein package on openSuSE Tumbleweed
Information for package perl-Text-Levenshtein:
----------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Text-Levenshtein
Version : 0.15-1.2
Arch : noarch
Vendor : openSUSE
Installed Size : 33.5 KiB
Installed : No
Status : not installed
Source package : perl-Text-Levenshtein-0.15-1.2.src
Upstream URL : https://metacpan.org/release/Text-Levenshtein
Summary : Calculate the Levenshtein edit distance between two strings
Description :
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
http://en.wikipedia.org/wiki/Levenshtein_distance.
----------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Text-Levenshtein
Version : 0.15-1.2
Arch : noarch
Vendor : openSUSE
Installed Size : 33.5 KiB
Installed : No
Status : not installed
Source package : perl-Text-Levenshtein-0.15-1.2.src
Upstream URL : https://metacpan.org/release/Text-Levenshtein
Summary : Calculate the Levenshtein edit distance between two strings
Description :
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
http://en.wikipedia.org/wiki/Levenshtein_distance.