Computational Implementation of Non-Concatenative Morphology

@inproceedings{CohenSygal2004ComputationalIO,
  title={Computational Implementation of Non-Concatenative Morphology},
  author={Yael Cohen-Sygal},
  year={2004}
}
We introduce finite state registered automata, a new computational model within the framework of finite state (FS) technology that accounts for nonconcatenative morphological processes such as word formation in Semitic languages. It extends existing FS techniques, which are presently suboptimal for describing such phenomena. We define the new model, prove its mathematical properties and exemplify its usability by describing some non-concatenative phenomena. 
6 Citations
15 References
Similar Papers

Similar Papers

Loading similar papers…