2019-11-02 17:16:18 +01:00
|
|
|
# $NetBSD: Makefile,v 1.5 2019/11/02 16:16:20 rillig Exp $
|
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.
2009-11-03 18:53:44 +01:00
|
|
|
#
|
|
|
|
|
|
|
|
|
|
DISTNAME= openfst-1.1
|
|
|
|
|
CATEGORIES= math
|
2014-12-27 00:53:08 +01:00
|
|
|
MASTER_SITES= http://www.openfst.org/twiki/pub/FST/FstDownload/
|
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.
2009-11-03 18:53:44 +01:00
|
|
|
|
|
|
|
|
MAINTAINER= pallegra@gmail.com
|
|
|
|
|
HOMEPAGE= http://www.openfst.org/
|
|
|
|
|
COMMENT= OpenFst is a library for manipulating transducers
|
|
|
|
|
LICENSE= apache-2.0
|
|
|
|
|
|
2018-07-18 02:06:10 +02:00
|
|
|
USE_LANGUAGES= c c++03
|
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.
2009-11-03 18:53:44 +01:00
|
|
|
USE_LIBTOOL= yes
|
|
|
|
|
GNU_CONFIGURE= yes
|
|
|
|
|
|
|
|
|
|
.include "../../mk/dlopen.buildlink3.mk"
|
|
|
|
|
|
2019-11-02 17:16:18 +01:00
|
|
|
BUILDLINK_TRANSFORM+= opt:-ldl:${BUILDLINK_LDADD.dl:M*}
|
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.
2009-11-03 18:53:44 +01:00
|
|
|
|
|
|
|
|
.include "../../mk/bsd.pkg.mk"
|
