How to Install and Uninstall rubygem-levenshtein.x86_64 Package on Fedora 35
Last updated: January 16,2025
1. Install "rubygem-levenshtein.x86_64" package
In this section, we are going to explain the necessary steps to install rubygem-levenshtein.x86_64 on Fedora 35
$
sudo dnf update
Copied
$
sudo dnf install
rubygem-levenshtein.x86_64
Copied
2. Uninstall "rubygem-levenshtein.x86_64" package
In this section, we are going to explain the necessary steps to uninstall rubygem-levenshtein.x86_64 on Fedora 35:
$
sudo dnf remove
rubygem-levenshtein.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the rubygem-levenshtein.x86_64 package on Fedora 35
Last metadata expiration check: 0:56:29 ago on Wed Sep 7 14:25:02 2022.
Available Packages
Name : rubygem-levenshtein
Version : 0.2.2
Release : 27.fc35
Architecture : x86_64
Size : 16 k
Source : rubygem-levenshtein-0.2.2-27.fc35.src.rpm
Repository : fedora
Summary : Calculates the Levenshtein distance between two byte strings
URL : http://www.erikveen.dds.nl/levenshtein/doc/index.html
License : GPLv2
Description : Calculates the Levenshtein distance between two byte strings.
:
: The Levenshtein distance is a metric for measuring the amount
: of difference between two sequences (i.e., the so called edit
: distance). The Levenshtein distance between two sequences is
: given by the minimum number of operations needed to transform
: one sequence into the other, where an operation is an
: insertion, deletion, or substitution of a single element.
Available Packages
Name : rubygem-levenshtein
Version : 0.2.2
Release : 27.fc35
Architecture : x86_64
Size : 16 k
Source : rubygem-levenshtein-0.2.2-27.fc35.src.rpm
Repository : fedora
Summary : Calculates the Levenshtein distance between two byte strings
URL : http://www.erikveen.dds.nl/levenshtein/doc/index.html
License : GPLv2
Description : Calculates the Levenshtein distance between two byte strings.
:
: The Levenshtein distance is a metric for measuring the amount
: of difference between two sequences (i.e., the so called edit
: distance). The Levenshtein distance between two sequences is
: given by the minimum number of operations needed to transform
: one sequence into the other, where an operation is an
: insertion, deletion, or substitution of a single element.