How to Install and Uninstall golang-github-schollz-closestmatch-dev Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: November 22,2024

1. Install "golang-github-schollz-closestmatch-dev" package

Please follow the instructions below to install golang-github-schollz-closestmatch-dev on Ubuntu 20.10 (Groovy Gorilla)

$ sudo apt update $ sudo apt install golang-github-schollz-closestmatch-dev

2. Uninstall "golang-github-schollz-closestmatch-dev" package

This guide covers the steps necessary to uninstall golang-github-schollz-closestmatch-dev on Ubuntu 20.10 (Groovy Gorilla):

$ sudo apt remove golang-github-schollz-closestmatch-dev $ sudo apt autoclean && sudo apt autoremove

3. Information about the golang-github-schollz-closestmatch-dev package on Ubuntu 20.10 (Groovy Gorilla)

Package: golang-github-schollz-closestmatch-dev
Architecture: all
Version: 2.1.0-2
Priority: optional
Section: universe/devel
Source: golang-github-schollz-closestmatch
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Go Packaging Team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 1247
Filename: pool/universe/g/golang-github-schollz-closestmatch/golang-github-schollz-closestmatch-dev_2.1.0-2_all.deb
Size: 382680
MD5sum: 923c681e5099403bdec732a1eb31e9c2
SHA1: ff76bfe64201d1a2bb3a1148feb417a4ceda29ec
SHA256: 217c94a0deed17b14eb519fc9e1a6ab8b025dd396ff64f3666867463a19810ed
SHA512: a58d20119f7b56b35ca001f76dd69b953cff29a403fcf2965e39bacbaf6c9c6a8841677c07a84aff6c9903bd1e266a800ff1d33759aa7037947552a81f7422e8
Homepage: https://github.com/schollz/closestmatch
Description-en: Golang library for fuzzy matching within a set of strings
Closestmatch is a simple and fast Go library for fuzzy matching an
input string to a list of target strings. closestmatch is useful for
handling input from a user where the input (which could be misspelled or
out of order) needs to match a key in a database. closestmatch uses a
bag-of-words approach (https://en.wikipedia.org/wiki/Bag-of-words_model)
to precompute character n-grams to represent each possible target
string. The closest matches have highest overlap between the sets of
n-grams. The precomputation scales well and is much faster and more
accurate than Levenshtein for long strings.
Description-md5: 28d2d28dac5f5cf8995dc432218a2d7e