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.
ok jeremy@
Foma is a compiler, programming language, and C library for constructing
finite-state automata and transducers for various uses. It has specific
support for many natural language processing applications such as
producing morphological analyzers. Although NLP applications are
probably the main use of foma, it is sufficiently generic to use for a
large number of purposes.
ok jeremy@ pirofti@
Taking MAINTAINER (discussed with espie on icb).
OK ajacoutot@, sebastia@
At some point in the future, the language bindings should be
multi-packaged, but that is another story.
GeoGebra is free and multi-platform dynamic mathematics software for
learning and teaching.
based on an initial submission from Azwaw OUSADOU and reworked by myself
ok jasper@
Initial diff by Rafael Sadowski.
Patch to allow building with USE_SYSTRACE=Yes by lum@.
Tested by Amit Kulkarni, Benjamin Nadland and Stefan Unterweger.
Portswise OK sthen@
Don't redirect errors to /dev/null and don't return true(1)
unconditionally. Instead, don't check for the existence of index.theme.
This will allow us to catch errors that may be happening because of a
missing dependency in the chain.
Some hidden issues may appear, in which case please contact me.
discussed with and ok blind jasper@
