Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Using Finite State Technology in Natural Language Processing of Basque
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Foma: a finite-state compiler and library
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
Hi-index | 0.00 |
Basque is a morphologically rich language, of which several finite-state morphological descriptions have been constructed, primarily using the Xerox/PARC finite-state tools. In this paper we describe the process of porting a previous description of Basque morphology to foma, an open-source finite-state toolkit compatible with Xerox tools, provide a comparison of the two tools, and contrast the development of a twolevel grammar with parallel alternation rules and a sequential grammar developed by composing individual replacement rules.