How to Install and Uninstall libfst-dev Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: December 24,2024

1. Install "libfst-dev" package

Please follow the guidelines below to install libfst-dev on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libfst-dev
            
                    
    
    Copied

2. Uninstall "libfst-dev" package

In this section, we are going to explain the necessary steps to uninstall libfst-dev on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libfst-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libfst-dev package on Ubuntu 20.10 (Groovy Gorilla)

Package: libfst-dev
Architecture: amd64
Version: 1.6.3-2ubuntu1
Priority: optional
Section: universe/libdevel
Source: openfst
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Giulio Paci
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 88610
Depends: libfst8 (= 1.6.3-2ubuntu1)
Filename: pool/universe/o/openfst/libfst-dev_1.6.3-2ubuntu1_amd64.deb
Size: 4684540
MD5sum: e8295d379f068c4e7fb4d979eb6af99a
SHA1: 0a7c526f458fbebc9882f05360190873d7b01288
SHA256: eb0d5b84ae6870526d7f14b2dbdb26d6c6d309d6491aeb805b1491c594627a4a
SHA512: 4313346eba510a9fa0c7b543dd51612544a29718072a91b1f47aea7737854c6773ddcb5359604856211cc8b837d8fea16b18f600c8a0ac726ad8291f2ceaf840
Homepage: http://www.openfst.org/
Description-en: weighted finite-state transducers library (development)
OpenFst is a library for constructing, combining, optimizing, and searching
weighted finite-state transducers (FSTs). Weighted finite-state transducers
are automata where each transition has an input label, an output label, and a
weight. The more familiar finite-state acceptor is represented as a transducer
with each transition's input and output label equal. Finite-state acceptors
are used to represent sets of strings (specifically, regular or rational
sets); finite-state transducers are used to represent binary relations between
pairs of strings (specifically, rational transductions). The weights can be
used to represent the cost of taking a particular transition.
.
This package contains the development support files.
Description-md5: 7567976b7e5e064afc6d0b854fd88d6b