Abstract
We extend finite-state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expressions denote arbitrary FSRAs and use it to describe some morphological and phonological phenomena. We also define several dedicated operators which support an easy and efficient implementation of some non-trivial morphological phenomena. In addition, we extend FSRA to finite-state registered transducers and demonstrate their space efficiency.
| Original language | English |
|---|---|
| Title of host publication | Finite-State Methods and Natural Language Processing - 5th InternationalWorkshop, FSMNLP 2005, Revised Papers |
| Editors | Anssi Yli-Jyra, Lauri Karttunen, Juhani Karhumaki |
| Publisher | Springer Verlag |
| Pages | 43-54 |
| Number of pages | 12 |
| ISBN (Print) | 9783540354673 |
| DOIs | |
| State | Published - 2006 |
| Event | 5th International Workshop of Finite-State Methods and Natural Language Processing, FSMNLP 2005 - Helsinki, Finland Duration: 1 Sep 2005 → 2 Sep 2005 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4002 LNAI |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 5th International Workshop of Finite-State Methods and Natural Language Processing, FSMNLP 2005 |
|---|---|
| Country/Territory | Finland |
| City | Helsinki |
| Period | 1/09/05 → 2/09/05 |
Bibliographical note
Funding Information:This research was supported by The Israel Science Foundation (grant number 136/01). We are grateful to Dale Gerdemann for his help.
Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2006.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)