Finite-State Registered Automata and Their Uses in Natural Languages

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.

• Type: Conference
• Year: 2005
• Where: FSMNLP
• Authors: Yael Cohen-Sygal, Shuly Wintner
• Keywords: Extended Regular Expression, FSMNLP 2005, Natural Language Processing, Non-trivial Morphological Phenomena, finite-state Registered Transducers