Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Rapid development of morphological descriptions for full language processing systems
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
A morphographemic model for error correction in nonconcatenative strings
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Multi-tape two-level morphology: a case study in semitic non-linear morphology
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Constructing lexical transducers
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
The applicaton of two-level morphology to non-concatenative German morphology
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Applications of Finite-State Transducers in Natural Language Processing
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Compiling regular formalisms with rule features into finite-state automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Approximating context-free grammars with a finite-state calculus
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
SEMHE: a generalised two-level system
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
The Karamel system and semitic languages: structured multi-tiered morphology
Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
A method for compiling two-level rules with multiple contexts
SIGMORPHON '10 Proceedings of the 11th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology
Compiling simple context restrictions with nondeterministic automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard one deriving from Koskenniemi's work: it is believed to have some practical descriptive advantages, and is quite widely used, but has a different interpretation. Efficient interpreters exist for the notation, but until now it has not been clear how to compile to equivalent automata in a transparent way. The present paper shows how to do this, using some of the conceptual tools provided by Kaplan and Kay's regular relations calculus.