How to Install and Uninstall perl-Text-Levenshtein.noarch Package on Fedora 38
Last updated: November 28,2024
1. Install "perl-Text-Levenshtein.noarch" package
Please follow the guidance below to install perl-Text-Levenshtein.noarch on Fedora 38
$
sudo dnf update
Copied
$
sudo dnf install
perl-Text-Levenshtein.noarch
Copied
2. Uninstall "perl-Text-Levenshtein.noarch" package
Learn how to uninstall perl-Text-Levenshtein.noarch on Fedora 38:
$
sudo dnf remove
perl-Text-Levenshtein.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the perl-Text-Levenshtein.noarch package on Fedora 38
Last metadata expiration check: 2:18:26 ago on Sat Mar 16 16:59:57 2024.
Available Packages
Name : perl-Text-Levenshtein
Version : 0.15
Release : 4.fc38
Architecture : noarch
Size : 24 k
Source : perl-Text-Levenshtein-0.15-4.fc38.src.rpm
Repository : fedora
Summary : Implementation of the Levenshtein edit distance
URL : https://metacpan.org/release/Text-Levenshtein
License : GPL+ or Artistic
Description : This module implements the Levenshtein edit distance. The Levenshtein edit
: distance is a measure of the degree of proximity between two strings. 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 Wikipedia page
:.
Available Packages
Name : perl-Text-Levenshtein
Version : 0.15
Release : 4.fc38
Architecture : noarch
Size : 24 k
Source : perl-Text-Levenshtein-0.15-4.fc38.src.rpm
Repository : fedora
Summary : Implementation of the Levenshtein edit distance
URL : https://metacpan.org/release/Text-Levenshtein
License : GPL+ or Artistic
Description : This module implements the Levenshtein edit distance. The Levenshtein edit
: distance is a measure of the degree of proximity between two strings. 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 Wikipedia page
: