NOTICE: This package has been removed from pkgsrc

./wip/openfst, OpenFst is a library for manipulating transducers

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ]

Branch: CURRENT, Version: 1.1, Package name: openfst-1.1, Maintainer: pallegra

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 library was developed by contributors from Google Research and NYU's
Courant Institute. It is intended to be comprehensive, flexible, efficient and
scale well to large problems. it has been extensively tested. It is an open
source project distributed under the Apache license.


Required to build:
[devel/libtool-base]

Master sites:

SHA1: b070f84a981dfadc4c049f505bd3406a43dfa55d
RMD160: 45657bb11f91ffdce5261ff6f4c103c164cc161b
Filesize: 501.371 KB

Version history: (Expand)

CVS history: (Expand)


   2009-11-03 18:54:28 by Thomas Klausner | Files touched by this commit (4) | Package removed
Log message:
Remove openfst, imported to math/openfst.
   2009-11-03 18:50:42 by Thomas Klausner | Files touched by this commit (1) 
Log message:
Remove url2pkg marker.
   2009-10-10 15:29:20 by Pierre ALLEGRAUD | Files touched by this commit (4) | Imported package
Log message:
Import openfst-1.1 as wip/openfst.

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 library was developed by contributors from Google Research and NYU's
Courant Institute. It is intended to be comprehensive, flexible, efficient and
scale well to large problems. it has been extensively tested. It is an open
source project distributed under the Apache license.