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.

Status:

Vendor Tag:	TNF
Release Tags:	PKGSRC-20091103


(wiz)

# $NetBSD: Makefile,v 1.1.1.1 2009/11/03 17:53:44 wiz Exp $
#

DISTNAME=	openfst-1.1
CATEGORIES=	math
MASTER_SITES=	http://mohri-lt.cs.nyu.edu/twiki/pub/FST/FstDownload/

MAINTAINER=	pallegra@gmail.com
HOMEPAGE=	http://www.openfst.org/
COMMENT=	OpenFst is a library for manipulating transducers
LICENSE=	apache-2.0

PKG_DESTDIR_SUPPORT=	user-destdir

USE_LANGUAGES=	c c++
USE_LIBTOOL=	yes
GNU_CONFIGURE=	yes

.include "../../mk/dlopen.buildlink3.mk"

BUILDLINK_TRANSFORM+=   opt:-ldl:${BUILDLINK_LDADD.dl:M*}

.include "../../mk/bsd.pkg.mk"

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.

$NetBSD: distinfo,v 1.1.1.1 2009/11/03 17:53:44 wiz Exp $

SHA1 (openfst-1.1.tar.gz) = b070f84a981dfadc4c049f505bd3406a43dfa55d
RMD160 (openfst-1.1.tar.gz) = 45657bb11f91ffdce5261ff6f4c103c164cc161b
Size (openfst-1.1.tar.gz) = 513404 bytes

@comment $NetBSD: PLIST,v 1.1.1.1 2009/11/03 17:53:44 wiz Exp $
bin/fstarcsort
bin/fstclosure
bin/fstcompile
bin/fstcompose
bin/fstconcat
bin/fstconnect
bin/fstconvert
bin/fstdeterminize
bin/fstdifference
bin/fstdraw
bin/fstencode
bin/fstepsnormalize
bin/fstequal
bin/fstequivalent
bin/fstinfo
bin/fstintersect
bin/fstinvert
bin/fstmap
bin/fstminimize
bin/fstprint
bin/fstproject
bin/fstprune
bin/fstpush
bin/fstrandgen
bin/fstrelabel
bin/fstreplace
bin/fstreverse
bin/fstreweight
bin/fstrmepsilon
bin/fstshortestdistance
bin/fstshortestpath
bin/fstsynchronize
bin/fsttopsort
bin/fstunion
include/fst/arc.h
include/fst/arcfilter.h
include/fst/arcmerge.h
include/fst/arcsort.h
include/fst/arcsum.h
include/fst/cache.h
include/fst/closure.h
include/fst/compact-fst.h
include/fst/compat.h
include/fst/complement.h
include/fst/compose-filter.h
include/fst/compose.h
include/fst/concat.h
include/fst/config.h
include/fst/connect.h
include/fst/const-fst.h
include/fst/determinize.h
include/fst/dfs-visit.h
include/fst/difference.h
include/fst/encode.h
include/fst/epsnormalize.h
include/fst/equal.h
include/fst/equivalent.h
include/fst/expanded-fst.h
include/fst/factor-weight.h
include/fst/flags.h
include/fst/float-weight.h
include/fst/fst-decl.h
include/fst/fst.h
include/fst/fstlib.h
include/fst/heap.h
include/fst/intersect.h
include/fst/invert.h
include/fst/lexicographic-weight.h
include/fst/lock.h
include/fst/log.h
include/fst/main.h
include/fst/mains.h
include/fst/map.h
include/fst/matcher.h
include/fst/minimize.h
include/fst/mutable-fst.h
include/fst/pair-weight.h
include/fst/partition.h
include/fst/product-weight.h
include/fst/project.h
include/fst/properties.h
include/fst/prune.h
include/fst/push.h
include/fst/queue.h
include/fst/randequivalent.h
include/fst/randgen.h
include/fst/random-weight.h
include/fst/rational.h
include/fst/register.h
include/fst/relabel.h
include/fst/replace.h
include/fst/reverse.h
include/fst/reweight.h
include/fst/rmepsilon.h
include/fst/rmfinalepsilon.h
include/fst/shortest-distance.h
include/fst/shortest-path.h
include/fst/slist.h
include/fst/state-table.h
include/fst/statesort.h
include/fst/string-weight.h
include/fst/symbol-table.h
include/fst/synchronize.h
include/fst/test-properties.h
include/fst/text-io.h
include/fst/topsort.h
include/fst/union-find.h
include/fst/union.h
include/fst/util.h
include/fst/vector-fst.h
include/fst/verify.h
include/fst/visit.h
include/fst/weight.h
lib/libfst.la
lib/libfstmain.la