Introduction to algorithms
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Phrase-Based Statistical Machine Translation
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Finite-State Speech-to-Speech Translation
ICASSP '97 Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97) -Volume 1 - Volume 1
Finite-state transducers in language and speech processing
Computational Linguistics
Generalized algorithms for constructing statistical language models
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Improved statistical alignment models
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Stochastic finite-state models for spoken language machine translation
NAACL-ANLP-EMTS '00 Proceedings of the 2000 NAACL-ANLP Workshop on Embedded machine translation systems - Volume 5
A fast finite-state relaxation method for enforcing global constraints on sequence decoding
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Integration of speech to computer-assisted translation using finite-state automata
COLING-ACL '06 Proceedings of the COLING/ACL on Main conference poster sessions
Natural Language Engineering
Robust understanding in multimodal interfaces
Computational Linguistics
Novel reordering approaches in phrase-based statistical machine translation
ParaText '05 Proceedings of the ACL Workshop on Building and Using Parallel Texts
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Tiburon: a weighted tree automata toolkit
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Vietnamese automatic speech recognition: the FLaVoR approach
ISCSLP'06 Proceedings of the 5th international conference on Chinese Spoken Language Processing
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
A phrase-based context-dependent joint probability model for named entity translation
IJCNLP'05 Proceedings of the Second international joint conference on Natural Language Processing
Juicer: a weighted finite-state transducer speech decoder
MLMI'06 Proceedings of the Third international conference on Machine Learning for Multimodal Interaction
| Hi-index | 0.00 |
In this paper we present the RWTH FSA toolkit --- an efficient implementation of algorithms for creating and manipulating weighted finite-state automata. The toolkit has been designed using the principle of on-demand computation and offers a large range of widely used algorithms. To prove the superior efficiency of the toolkit, we compare the implementation to that of other publically available toolkits. We also show that on-demand computations help to reduce memory requirements significantly without any loss in speed. To increase its flexibility, the RWTH FSA toolkit supports high-level interfaces to the programming language Python as well as a command-line tool for interactive manipulation of FSAs. Furthermore, we show how to utilize the toolkit to rapidly build a fast and accurate statistical machine translation system. Future extensibility of the toolkit is ensured as it will be publically available as open source software.