A Programming Language for Finite State Transducers

This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both simple and general and suitable for a wide range of possible applications. A compiler for the programming language is provided by the SFST tools which have successfully been used to implement a large-scale German morphology.

• Type: Conference
• Year: 2005
• Where: FSMNLP
• Authors: Helmut Schmid
• Keywords: FSMNLP 2005, Large-scale German Morphology, Natural Language Processing, Programming Language, finite State Transducers