Advertisement

A Programming Language for Finite State Transducers

  • Helmut Schmid
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4002)

Abstract

SFST-PL is a programming language for finite-state transducers which is based on extended regular expressions with variables. SFST-PL is used by the Stuttgart Finite-State-Transducer (SFST) tools which are available under the GNU public license. SFST-PL was designed as a general programming language for the development of tokenizers, pattern recognizers, computational morphologies and other FST applications. The first SFST application was the SMOR morphology [1], a large-scale German morphology which covers composition, derivation and inflection. An SFST program consists of a list of variable and alphabet assignments followed by a single regular expression which defines the resulting transducer.

References

  1. 1.
    Schmid, H., Fitschen, A., Heid, U.: SMOR: A German computational morphology covering derivation, composition and inflection. In: Proceedings of the 4th International Conference on Language Resources and Evaluation, Lisbon, Portugal, vol. 4, pp. 1263–1266 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Helmut Schmid
    • 1
  1. 1.Institute for Natural Language Processing (IMS)University of StuttgartGermany

Personalised recommendations