Finite-State Registered Automata for Non-Concatenative Morphology.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 20338342 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Finite-State Registered Automata for Non-Concatenative Morphology. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Cohen-Sygal%2C+Yael%22">Cohen-Sygal, Yael</searchLink><relatesTo>1</relatesTo><i> yaelc@cs.haifa.ac.il</i><br /><searchLink fieldCode="AR" term="%22Wintner%2C+Shuly%22">Wintner, Shuly</searchLink><relatesTo>1</relatesTo><i> shuly@cs.haifa.ac.il</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Computational+Linguistics%22">Computational Linguistics</searchLink>. Mar2006, Vol. 32 Issue 1, p49-82. 34p. 16 Diagrams, 4 Charts. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Sequential+machine+theory%22">Sequential machine theory</searchLink><br /><searchLink fieldCode="DE" term="%22Morphology+%28Grammar%29%22">Morphology (Grammar)</searchLink><br /><searchLink fieldCode="DE" term="%22Phonology%22">Phonology</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+linguistics%22">Computational linguistics</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+theory%22">Machine theory</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=20338342 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1162/coli.2006.32.1.49 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 34 StartPage: 49 Subjects: – SubjectFull: Sequential machine theory Type: general – SubjectFull: Morphology (Grammar) Type: general – SubjectFull: Phonology Type: general – SubjectFull: Computational linguistics Type: general – SubjectFull: Machine theory Type: general Titles: – TitleFull: Finite-State Registered Automata for Non-Concatenative Morphology. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Cohen-Sygal, Yael – PersonEntity: Name: NameFull: Wintner, Shuly IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2006 Type: published Y: 2006 Identifiers: – Type: issn-print Value: 08912017 Numbering: – Type: volume Value: 32 – Type: issue Value: 1 Titles: – TitleFull: Computational Linguistics Type: main |
| ResultId | 1 |
