Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
FSA Utilities: A Toolbox to Manipulate Finite-State Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
A Rational Design for a Weighted Finite-State Transducer Library
WIA '97 Revised Papers from the Second International Workshop on Implementing Automata
One-level phonology: autosegmental representations and rules as finite automata
Computational Linguistics
Discovering phonotactic finite-state automata by genetic search
ACL '98 Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 2
Arabic finite-state morphological analysis and generation
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Constraining separated morphotactic dependencies in finite-state grammars
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Finite-State Registered Automata for Non-Concatenative Morphology
Computational Linguistics
A Simple Formalism for Capturing Reduplication in Finite-State Morphology
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
| Hi-index | 0.00 |
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-of-the-art computational morphology, since it involves copying of some part of a phonological string. In this paper I advocate a finite-state method that combines enriched lexical representations via intersection to implement the copying. The proposal includes a resource-conscious variant of automata and can benefit from the existence of lazy algorithms. Finally, the implementation of a complex case from Koasati is presented.