Skip to main content
Springer Nature Link
Log in

Multi-tape automata for speech and language systems: A prolog implementation

  • Contributed Papers
  • Conference paper
  • First Online:
Automata Implementation (WIA 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1436))

Included in the following conference series:

Abstract

This paper describes a Prolog implementation of multi-tape finite-state automata and illustrates its use with a rewrite rules system. Operators which are multi-tape specific are defined and algorithms for constructing their behaviour into multi-tape machines are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Carlsson, M. 1996. Personal communication to Edmund Grimley-Evans and posting to the Usenet news groups comp. lang. prolog (16 july 1996).

    Google Scholar 

  • Eilenberg, S. 1974. Automata, Languages, and Machines, volume A. Academic Press.

    Google Scholar 

  • Elgot, C. and J. Mezei. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development, 9:47–68.

    Google Scholar 

  • Hopcroft, J. and J. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.

    Google Scholar 

  • Kaplan, R. and M. Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331–78.

    Google Scholar 

  • Kay, M. 1987. Nonconcatenative finite-state morphology. In Proceedings of the Third Conference of the European Chapter of the Association for Computational Linguistics, pages 2–10.

    Google Scholar 

  • Kiraz, G. 1994. Multi-tape two-level morphology: a case study in Semitic nonlinear morphology. In COLING-94: Papers Presented to the 15th International Conference on Computational Linguistics, volume 1, pages 180–6.

    Google Scholar 

  • Kiraz, G. [Forthcoming]. Computational Approach to Nonlinear Morphology: with emphasis on Semitic languages. Cambridge University Press.

    Google Scholar 

  • Mealy, G. 1955. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045–79.

    Google Scholar 

  • Nivat, M. 1968. Transductions des languages de Chomsky. Ann. Inst. Fourier (Grenoble), 18:339–455.

    Google Scholar 

  • O'Keefe, R. 1990. The Craft of Prolog. The MIT Press.

    Google Scholar 

  • Rabin, M. and D. Scott. 1959. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114–25. Reprinted in Moore, E. (ed.) Sequential Machines. Addison-Wesley, Reading, Massachussetts, 1964, pp. 63-91.

    Google Scholar 

  • Raymond, D. and D. Wood. 1996. The Grail papers. Technical report, University of Western Ontario, Department of Computer Science. Technical Report TR-491.

    Google Scholar 

  • Roche, E., editor. 1997. Finite-State Language Processing. MIT Press.

    Google Scholar 

  • Swedish Institute of Computer Science, 1995. SICStus Prolog User's Manual.

    Google Scholar 

  • Watson, B. 1995. Taxonomies and Toolkiis of Regular Language Algorithms. Ph.D. thesis, Technische Universiteit Eindhoven.

    Google Scholar 

  • Watson, B. 1996. Implementing and using finite automata toolkits. In ECAI Workshop on Extended Finite-State Models of Language.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, Lucent Technologies, 700 Mountain Ave., 07974, Murray Hill, NJ

    George Anton Kiraz

  2. Computer Laboratory, University of Cambridge, Pembroke Str, CB2 3QG, Cambridge

    Edmund Grimley-Evans

Authors
  1. George Anton Kiraz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edmund Grimley-Evans
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Derick Wood Sheng Yu

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiraz, G.A., Grimley-Evans, E. (1998). Multi-tape automata for speech and language systems: A prolog implementation. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031383

Download citation

  • DOI: https://doi.org/10.1007/BFb0031383

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64694-5

  • Online ISBN: 978-3-540-69104-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics