External Links
Google Scholar
provided by
German Research Center for Artificial Intelligence
with support by
as well as by

Finite State Technology

abbreviation(s): FST, FS Technology
definition: Finite-state devices such as finite-state automata and finite-state transducers have been known since the emergence of computer science and are recently extensively used in many areas of natural language processing. Their use is motivated by their time and space efficiency and the fact that many relevant local language phenomena can be easily and intuitively expressed as finite-state devices.
See also the corresponding HLT Survey chapter: http://www.lt-world.org/hlt_survey/ltw-chapter11-5.pdf
related organisation(s):
  • AT&T Labs Research
  • Xerox-Parc Content Analysis
related person(s):
  • Gertjan Van Noord
  • Wojciech Skut
  • Mehryar Mohri
  • Fernando C. N. Pereira
  • Lauri Karttunen
  • George Anton Kiraz
  • Richard Watson
  • Emmanuel Roche
  • Kemal Oflazer
  • Jan Daciuk
  • Bruce W. Watson
  • Stoyan Mihov
  • Atro Voutilainen
  • Michael Riley
  • Yves Schabes
related system(s) / resource(s):
  • Ragel State Machine Compiler
  • An Interactive Editor for the Statecharts Graphical Language
  • The Grail+
  • Finite state utilities
  • Finite-state machines
  • FLAP
  • AT&T FSM LibraryTM – Finite-State Machine Library
related publication(s):

On some Applications of Finite-State Automata theory to Natural Language Processing.
Mohri M. Natural Language Engineering. 2 (1). 1996. 61-80.

Finite-state transducers in language and speech processing.