Abstract
We introduce finite-state registered automata (FSRAs), a new computational device within the framework of finite-state technology, specifically tailored for implementing non-concatenative morphological processes. This model extends and augments existing finite-state techniques, which are presently not optimized for describing this kind of phenomena. We first define the model and discuss its mathematical and computational properties. Then, we provide an extended regular language whose expressions denote FSRAs. Finally, we exemplify the utility of the model by providing several examples of complex morphological and phonological phenomena, which are elegantly implemented with FSRAs.
| Original language | English |
|---|---|
| Pages (from-to) | 49-82 |
| Number of pages | 34 |
| Journal | Computational Linguistics |
| Volume | 32 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2006 |
ASJC Scopus subject areas
- Language and Linguistics
- Linguistics and Language
- Computer Science Applications
- Artificial Intelligence