A computational framework for lexical description
Computational Linguistics - Special issue of the lexicon
Computational Complexity and Natural Language
Computational Complexity and Natural Language
A general computational model for word-form recognition and production
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
Parallel intersection and serial composition of finite state transducers
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Languages generated by two-level morphological rules
Computational Linguistics
Automatic learning of word transducers from examples
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation (sometimes left unspecified) into a form of finite-state transducers, or else have consisted of an informal outline of the intended interpretation of the rule-formalism itself. Analyses of the properties of the formalism have generally focussed on the transducer mechanism. It is, however, possible to give a fully formal definition of the original rule notation directly, in a way which reflects Koskenniemi's original informal characterisation and which does not depend directly on the notion of a transducer (although it must retain the essential nature of parts of the notation as being regular expressions). This re-formulation allows a proof that the ability of this formalism to characterise mappings between strings is more limited than that of arbitrary transducers.