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.
Cite
CITATION STYLE
Cohen-Sygal, Y., & Wintner, S. (2006). Finite-state registered automata and their uses in natural languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4002 LNAI, pp. 43–54). Springer Verlag. https://doi.org/10.1007/11780885_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
