**Up to [cvs.NetBSD.org] / pkgsrc / math / openfst**

Request diff between arbitrary revisions

Default branch: MAIN

Current tag: pkgsrc-2011Q4

Revision **1.1.1.1** / (**download**) - annotate - [select for diffs] *(vendor branch)*, *Tue Nov 3 17:53:44 2009 UTC* (9 years, 10 months ago) by *wiz*

Branch: **TNF
**

CVS Tags: **pkgsrc-2012Q2-base,
pkgsrc-2012Q2,
pkgsrc-2012Q1-base,
pkgsrc-2012Q1,
pkgsrc-2011Q4-base,
pkgsrc-2011Q4,
pkgsrc-2011Q3-base,
pkgsrc-2011Q3,
pkgsrc-2011Q2-base,
pkgsrc-2011Q2,
pkgsrc-2011Q1-base,
pkgsrc-2011Q1,
pkgsrc-2010Q4-base,
pkgsrc-2010Q4,
pkgsrc-2010Q3-base,
pkgsrc-2010Q3,
pkgsrc-2010Q2-base,
pkgsrc-2010Q2,
pkgsrc-2010Q1-base,
pkgsrc-2010Q1,
pkgsrc-2009Q4-base,
pkgsrc-2009Q4,
PKGSRC-20091103
**

Changes since **1.1: +0 -0
lines**

Diff to previous 1.1 (colored)

Initial import of openfst-1.1 from pkgsrc-wip, packaged by Pierre Allegraud. 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.

CVSweb <webmaster@jp.NetBSD.org>