Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FSMNLP
2005
Springer

favoriteEmaildiscussreport

98views Natural Language Processing» more FSMNLP 2005»

A Programming Language for Finite State Transducers

13 years 10 months ago

A Programming Language for Finite State Transducers

Download www.ims.uni-stuttgart.de

This paper presents SFST-PL, a programming language for ﬁnite 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.

Helmut Schmid

Real-time Traffic

FSMNLP 2005 | Large-scale German Morphology | Natural Language Processing | Programming Language | ﬁnite State Transducers |

claim paper

Related Content

» FiniteState Transducer Cascade to Extract Proper Names in Texts

» Applications of FiniteState Transducers in Natural Language Processing

» Finite State Transducers Approximating Hidden Markov Models

» Guessers for FiniteState Transducer Lexicons

» A Stochastic FiniteState Morphological Parser for Turkish

» FiniteState Registered Automata and Their Uses in Natural Languages

» Arabic Language Modeling with Finite State Transducers

» Two Parsing Algorithms by Means of Finite State Transducers

» LargeScale Statistical Machine Translation with Weighted Finite State Transducers

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FSMNLP
Authors	Helmut Schmid

Comments (0)