Computational Implementation of Non-Concatenative Morphology
Yael Cohen-Sygal · 2004
We introduce finite state registered machines, a new computational device within the framework of finite state technology that accounts for non-concatenative morphological processes such as word formation in Semitic languages. It extends and augments existing finite-state techniques, which are presently not sufficiently suitable for describing this kind of phenomena. We define the new model, prove it is indeed finite-state, show how it maintains the closure properties of regular languages and relations and use it to describe some non-concatenative phenomena of natural languages, including circumfixation, interdigitation and limited reduplication.