Semirings, automata, languages
Semirings, automata, languages
A tutorial on hidden Markov models and selected applications in speech recognition
Readings in speech recognition
Foundations of statistical natural language processing
Foundations of statistical natural language processing
Theoretical Computer Science - Special issue on implementing automata
Automata, Languages, and Machines
Automata, Languages, and Machines
Finite-State Language Processing
Finite-State Language Processing
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
Finite-state transducers in language and speech processing
Computational Linguistics
Incremental finite-state parsing
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Regular expressions for language engineering
Natural Language Engineering
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Compiling and using finite-state syntactic rules
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
A Computational Theory of Writing Systems (Studies in Natural Language Processing)
A Computational Theory of Writing Systems (Studies in Natural Language Processing)
Towards scalable virtuality in C++
Software—Practice & Experience
Selected operations and applications of n-tape weighted finite-state machines
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Multi-tape automata with symbol classes
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
| Hi-index | 0.00 |
This article presents a new tool, WFSC, for creating, manipulating, and applying weighted finite state automata. It inherits some powerful features from Xerox's non-weighted XFST tool and represents a continuation of Xerox's work in the field of finite state automata over two decades. The design is generic: algorithms work on abstract components of automata and on a generic abstract semiring, and are independent of their concrete realizations. Applications can access WFSC's functions through an API or create automata through an end-user interface, either from an enumeration of their states and transitions or from rational expressions.