A finite and real-time processor for natural language
Communications of the ACM
Theoretical Computer Science
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
A design principles of a weighted finite-state transducer library
Theoretical Computer Science - Special issue on implementing automata
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic
Computational Linguistics - Special issue on finite-state methods in NLP
Finite-state reduplication in one-level prosodic morphology
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Regular expressions for language engineering
Natural Language Engineering
Nonconcatenative finite-state morphology
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Finite-state description of semitic morphology: a case study of Ancient Akkadian
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Finite-state non-concatenative morphotactics
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Constraining separated morphotactic dependencies in finite-state grammars
FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
A finite-state morphological grammar of Hebrew
Semitic '05 Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Natural Language Engineering
Finite-State Technology as a Programming Environment
CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
A Simple Formalism for Capturing Reduplication in Finite-State Morphology
Proceedings of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008
Semitic morphological analysis and generation using finite state transducers with feature structures
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Finite-state description of Vietnamese reduplication
ALR7 Proceedings of the 7th Workshop on Asian Language Resources
Arabic morphology parsing revisited
CICLing'08 Proceedings of the 9th international conference on Computational linguistics and intelligent text processing
| Hi-index | 0.00 |
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.