Skip to main content
SpringerLink
Log in

Applications of Finite-State Transducers in Natural Language Processing

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2000)

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

Included in the following conference series:

Abstract

This paper is a review of some of the major applications of finite-state transducers in Natural Language Processing ranging from morphological analysis to finite-state parsing. The analysis and generation of inflected word forms can be performed efficiently by means of lexical transducers. Such transducers can be compiled using an extended regular expression calculus with restriction and replacement operators. These operators facilitate the description of complex linguistic phenomena involving morphological alternations and syntactic patterns. Because regular languages and relations can be encoded as finite-automata, new languages and relations can be derived from them directly by the finite-state calculus. This is a fundamental advantage over higher-level linguistic formalisms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kenneth R. Beesley and Lauri Karttunen. Finite-State Morphology: Xerox Tools and Techniques. Cambridge University Press, 2000. To appear.

    Google Scholar 

  2. Kenneth R. Beesley and Lauri Karttunen. Finite-state non-concatenative morphotactics. In Lauri Karttunen Jason Eisner and Alain Thériault, editors, SIGPHON-2000, pages 1–12, August 6 2000. Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology.

    Google Scholar 

  3. N. Chomsky. Syntactic Structures. Mouton, Gravenhage, Netherlands, 1957.

    Google Scholar 

  4. Noam Chomsky and Morris Halle. The Sound Pattern of English. Harper and Row, New York, 1968.

    Google Scholar 

  5. Edmund Grimley-Evans, George Anton Kiraz, and Stephen G. Pulman. Compiling a partition-based two-level formalism. In Proceedings of the 16th International Conference on Computational Linguistics, Copenhagen, 1996.

    Google Scholar 

  6. C. Douglas Johnson. Formal Aspects of Phonological Description. Mouton, The Hague, 1972.

    Google Scholar 

  7. Ronald M. Kaplan and Martin Kay. Phonological rules and finite-state transducers. In Linguistic Society of America Meeting Handbook, Fifty-Sixth Annual Meeting, New York, December 27-30 1981. Abstract.

    Google Scholar 

  8. Ronald M. Kaplan and Martin Kay. Regular models of phonological rule systems. Computational Linguistics, 20(3):331–378, 1994.

    Google Scholar 

  9. Lauri Karttunen. Finite-state lexicon compiler. Technical Report ISTL-NLTT-1993-04-02, Xerox Palo Alto Research Center, Palo Alto, CA, April 1993.

    Google Scholar 

  10. Lauri Karttunen. The replace operator. In ACL’95, Cambridge, MA, 1995. cmp-lg/9504032.

    Google Scholar 

  11. Lauri Karttunen. Directed replacement. In ACL’96, Santa Cruz, CA, 1996. cmp-lg/9606029.

    Google Scholar 

  12. Lauri Karttunen and Kenneth R. Beesley. Two-level rule compiler. Technical Report ISTL-92-2, Xerox Palo Alto Research Center, Palo Alto, CA, October 1992.

    Google Scholar 

  13. Lauri Karttunen, Jean-Pierre Chanod, Gregory Grefenstette, and Anne Schiller. Regular expressions for language engineering. Journal of Natural Language Engineering, 2(4): 305–328, 1996.

    Article  Google Scholar 

  14. Lauri Karttunen, Kimmo Koskenniemi, and Ronald M. Kaplan. A compiler for two-level phonological rules. Technical report, Xerox Palo Alto Research Center and Center for the Study of Language and Information, Stanford University, June 25 1987.

    Google Scholar 

  15. André Kempe and Lauri Karttunen. Parallel replacement in finite-state calculus. In COLING’96, Copenhagen, August 5-9 1996. cmp-lg/9607007.

    Google Scholar 

  16. Kimmo Koskenniemi. Two-level morphology: A general computational model for word-form recognition and production. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki, 1983.

    Google Scholar 

  17. Mehryar Mohri and Richard Sproat. An efficient compiler for weighted rewrite rules. In ACL’96, Santa Cruz, CA, 1996.

    Google Scholar 

  18. Gertjan van Noord and Dale Gerdemann. An extendible regular expression compiler for finite-state approaches in natural language processing. In O. Boldt, H. Juergensen, and L. Robbins, editors, Workshop on Implementing Automata; WIA99 Pre-Proceedings, Potsdam Germany, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xerox Research Centre Europe, 6, chemin de Maupertuis, F, 38240, Meylan, France

    Lauri Karttunen

Authors
  1. Lauri Karttunen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Middlesex College, The University of Western Ontario, London, ON, Canada, N6A 5B7

    Shen Yu  & Andrei Păun  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karttunen, L. (2001). Applications of Finite-State Transducers in Natural Language Processing. In: Yu, S., Păun, A. (eds) Implementation and Application of Automata. CIAA 2000. Lecture Notes in Computer Science, vol 2088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44674-5_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44674-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42491-8

  • Online ISBN: 978-3-540-44674-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation