Paper: Nonconcatenative Finite-State Morphology

ACL ID E87-1002
Title Nonconcatenative Finite-State Morphology
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1987
Authors
  • Martin Kay (Palo Alto Research Center, Palo Alto CA)

device capable of combining components of these three kinds into a single sequence. Our solution will take the form of a set of one or more finite-state transducers that will work in parallel like those of Koskenniemmi(1983), but on four tapes rather than just two. There will not be space, in this paper, to give a detailed account, even of all the material in Table I, not to mention problems that would arise if we were to consider the full range of Arabic roots. What I do hope to do, however, is to establish a theoretical framework within which solutions to all of these problems could be developed. We must presumably expect the transducers we construct to account for the Arabic data to have transition functions from states and quadruples of symbols to states. In other words, we will be abl...