File: control

package info (click to toggle)
openfst 1.8.4-4
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 8,268 kB
  • sloc: cpp: 50,990; ansic: 5,663; makefile: 527
file content (90 lines) | stat: -rw-r--r-- 3,771 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
Source: openfst
Section: libs
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders:
 Giulio Paci <giuliopaci@gmail.com>,
 Kartik Mistry <kartik@debian.org>,
 Tino Didriksen <tino@didriksen.cc>,
Build-Depends:
 debhelper-compat (= 13),
 autoconf,
 zlib1g-dev,
Standards-Version: 4.7.3
Vcs-Git: https://salsa.debian.org/science-team/openfst.git
Vcs-Browser: https://salsa.debian.org/science-team/openfst
Homepage: https://www.openfst.org/

Package: libfst-tools
Section: text
Architecture: any
Provides:
 openfst,
Depends:
 libfst26 (= ${binary:Version}),
 ${misc:Depends},
 ${shlibs:Depends},
Description: weighted finite-state transducers library (tools)
 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 provides the command line tools.

Package: libfst26-plugins-base
Section: text
Architecture: any
Depends:
 libfst26 (= ${binary:Version}),
 ${misc:Depends},
 ${shlibs:Depends},
Description: weighted finite-state transducers library (base plugins)
 OpenFst is a library for constructing, combining, optimizing, and searching
 weighted finite-state transducers (FSTs).
 .
 This package contains base extensions that will be dynamically loaded
 into any binary compiled with OpenFst if the LD_LIBRARY_PATH (or
 equivalent) includes /usr/lib/fst.

Package: libfst-dev
Section: libdevel
Architecture: any
Depends:
 libfst26 (= ${binary:Version}),
 ${misc:Depends},
Description: 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.

Package: libfst26
Architecture: any
Multi-Arch: same
Depends:
 ${misc:Depends},
 ${shlibs:Depends},
Description: weighted finite-state transducers library (runtime)
 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 includes the shared library.