Finite-State Registered Automata and Their Uses in Natural Languages

  • Yael Cohen-Sygal
  • Shuly Wintner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4002)


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.


Natural Language Natural Language Processing Regular Expression Register Operation Definite Article 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Koskenniemi, K.: Two-Level Morphology: a General Computational Model for Word-Form Recognition and Production. The Department of General Linguistics, University of Helsinki (1983)Google Scholar
  2. 2.
    Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20, 331–378 (1994)Google Scholar
  3. 3.
    Karttunen, L., Chanod, J.P., Grefenstette, G., Schiller, A.: Regular expressions for language engineering. Natural Language Engineering 2, 305–328 (1996)CrossRefGoogle Scholar
  4. 4.
    Mohri, M.: On some applications of finite-state automata theory to natural language processing. Natural Language Engineering 2, 61–80 (1996)CrossRefGoogle Scholar
  5. 5.
    van Noord, G., Gerdemann, D.: An extendible regular expression compiler for finite-state approaches in natural language processing. In: Boldt, O., Jürgensen, H. (eds.) WIA 1999. LNCS, vol. 2214, p. 122. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Beesley, K.R.: Constraining separated morphotactic dependencies in finite-state grammars. In: FSMNLP 1998, Bilkent, Turkey, pp. 118–127 (1998)Google Scholar
  7. 7.
    Beesley, K.R., Karttunen, L.: Finite-State Morphology: Xerox Tools and Techniques. Cambridge University Press, Cambridge (forthcoming)Google Scholar
  8. 8.
    Kornai, A.: Vectorized finite state automata. In: Proceedings of the workshop on extended finite state models of languages in the 12th European Conference on Artificial Intelligence, Budapest, pp. 36–41 (1996)Google Scholar
  9. 9.
    Cohen-Sygal, Y., Gerdemann, D., Wintner, S.: Computational implementation of non-concatenative morphology. In: Proceedings of the Workshop on Finite-State Methods in Natural Language Processing, an EACL 2003 Workshop, pp. 59–66 (2003)Google Scholar
  10. 10.
    Sproat, R.W.: Morphology and Computation. MIT Press, Cambridge (1992)Google Scholar
  11. 11.
    Nash, D.: Topics in Warlpiri Grammar. PhD thesis, Massachusetts Institue of Technlogy (1980)Google Scholar
  12. 12.
    Cohen-Sygal, Y.: Computational implementation of non-concatenative morphology. Master’s thesis, University of Haifa (2004)Google Scholar
  13. 13.
    Yona, S., Wintner, S.: A finite-state morphological grammar of hebrew. In: Proceedings of the ACL 2005 Workshop on Computational Approaches to Semitic Languages (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yael Cohen-Sygal
    • 1
  • Shuly Wintner
    • 1
  1. 1.Department of Computer ScienceUniversity of HaifaIsrael

Personalised recommendations