Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Regular expressions for language engineering
Natural Language Engineering
Transducers from rewrite rules with backreferences
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
An efficient compiler for weighted rewrite rules
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Logical specification of finite-state transductions for natural language processing
Logical specification of finite-state transductions for natural language processing
The proper treatment of optimality in computational phonology: plenary talk
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
A finite-state morphological grammar of Hebrew
Semitic '05 Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages
Natural Language Engineering
Finite-State Technology as a Programming Environment
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
| Hi-index | 0.00 |
This paper introduces xfst2fsa, a compiler which translates grammars expressed in the syntax of the XFST finite-state tool-box to grammars in the language of the FSA Utilities package. Compilation to FSA facilitates the use of grammars developed with the proprietary XFST tool-box on a publicly available platform. The paper describes the non-trivial issues of the compilation process, highlighting several shortcomings of some published algorithms, especially where replace rules are concerned. The compiler augments FSA with most of the operators supported by XFST. Furthermore, it provides a means for comparing the two systems on comparable grammars. The paper presents the results of such a comparison.