Bibliographic Details
| Title: |
Finite-State Registered Automata for Non-Concatenative Morphology. |
| Authors: |
Cohen-Sygal, Yael1 yaelc@cs.haifa.ac.il, Wintner, Shuly1 shuly@cs.haifa.ac.il |
| Source: |
Computational Linguistics. Mar2006, Vol. 32 Issue 1, p49-82. 34p. 16 Diagrams, 4 Charts. |
| Subjects: |
Sequential machine theory, Morphology (Grammar), Phonology, Computational linguistics, Machine theory |
| 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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computational Linguistics is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
