Re: NEW: math/openfst

2012-10-17 Thread Paul Irofti
On Fri, Oct 12, 2012 at 04:44:52PM -0600, Anthony J. Bentley wrote:
 Hi,
 
 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.
 
 
 Note that this is not the latest version. openfst-1.3.2 has a bug that
 prevents hfst (upcoming port) from compiling.
 
 ok?

I get this after compiling for a while on my x61s.

virtual memory exhausted: Cannot allocate memory



NEW: math/openfst

2012-10-12 Thread Anthony J. Bentley
Hi,

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.


Note that this is not the latest version. openfst-1.3.2 has a bug that
prevents hfst (upcoming port) from compiling.

ok?

--
Anthony J. Bentley


openfst.tar.gz
Description: openfst.tar.gz