http://netvouz.com/tag/fst?feed=rss Bookmarks tagged with "fst" on Netvouz http://www-i6.informatik.rwth-aachen.de/~kanthak/fsa.html FSA is an efficient and flexible toolkit to create, manipulate and optimize finite-state automata. It supports weighted and unweighted automata as well as transducers and is designed to use on-demand computations in order to keep memory footprint as low as possible. It may be used to model various problems from the field of natural language processing. The toolkit offers three different interfaces: a C++ library, a Python module and a command-line tool. Computational Linguistics > Finite State mcswell Wed, 22 Apr 2009 16:19:02 GMT