DFKI finite-state machine toolkit

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 language technology. The use of finite-state devices is mainly motivated by their time and space efficiency. In this paper we present the Finite-State Machine Toolkit for building, combining and optimizing the finite-state machines, developed at the Language Technology Lab of the German Research Center for Artificial Intelligence.

[1]  Arto Salomaa,et al.  Semirings, Automata, Languages , 1985, EATCS Monographs on Theoretical Computer Science.

[2]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[3]  Jean-Pierre Chanod,et al.  Incremental Finite-State Parsing , 1997, ANLP.

[4]  Gertjan van Noord,et al.  Finite Automata for Compact Representation of Language Models in NLP , 2001, CIAA.

[5]  J. Daciuk.  Computer-Assisted Enlargement of Morphological Dictionaries , 2001 .

[6]  B. Watson.  A taxonomy of finite automata minimization algorithms , 1993 .

[7]  Michael Riley,et al.  Speech Recognition by Composition of Weighted Finite Automata , 1996, ArXiv.

[8]  Maurice Gross,et al.  The Use of Finite Automata in the Lexical Representaion of Natural Language , 1987, Electronic Dictionaries and Automata in Computational Linguistics.

[9]  George Anton Kiraz,et al.  Compressed Storage of Sparse Finite-State Transducers , 1999, WIA.

[10]  Martin Kay,et al.  Regular Models of Phonological Rule Systems , 1994, CL.

[11]  Mehryar Mohri,et al.  The Design Principles of a Weighted Finite-State Transducer Library , 2000, Theor. Comput. Sci..

[12]  Mehryar Mohri,et al.  A Rational Design for a Weighted Finite-State Transducer Library , 1997, Workshop on Implementing Automata.

[13]  Yves Schabes,et al.  Deterministic Part-of-Speech Tagging with Finite-State Transducers , 1995, Comput. Linguistics.

[14]  Yves Schabes,et al.  Speech Recognition by Composition of Weighted Finite Automata , 1997 .

[15]  Raffaele Giancarlo,et al.  On the Determinization of Weighted Finite Automata , 2000, SIAM J. Comput..

[16]  Dominique Revuz,et al.  Minimisation of Acyclic Deterministic Automata in Linear Time , 1992, Theor. Comput. Sci..

[17]  Max Silberztein,et al.  Dictionnaires électroniques et analyse automatique de textes : le système intex , 1993 .

[18]  Kimmo Koskenniemi,et al.  Finite state methods in natural language processing , 2003, Nat. Lang. Eng..

[19]  Mark-Jan Nederhof,et al.  Regular Approximation of Context-Free Grammars through Transformation , 2001 .

[20]  Alan W. Black.  Finite State Machines from Feature Grammars , 1989, IWPT.

[21]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[22]  J. Brzozowski.  Canonical regular expressions and minimal state graphs for definite events , 1962 .

[23]  Reinhard Wilhelm,et al.  Übersetzerbau - Theorie, Konstruktion, Generierung , 1992 .

[24]  Jan Daciuk.  Finite State Tools for Natural Language Processing , 2000, COLING 2000.

[25]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[26]  Jan Daciuk,et al.  Incremental Construction of Minimal Acyclic Finite State Automata and Transducers , 1998 .

[27]  Berndt Farwer,et al.  ω-automata , 2002 .

[28]  Gregory Grefenstette,et al.  Regular expressions for language engineering , 1996, Natural Language Engineering.

[29]  Gertjan van Noord,et al.  An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing , 1999, WIA.

[30]  Robert E. Tarjan,et al.  Storing a sparse table , 1979, CACM.

[31]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[32]  Eric Brill,et al.  A Simple Rule-Based Part of Speech Tagger , 1992, HLT.

[33]  Mehryar Mohri,et al.  On some applications of finite-state automata theory to natural language processing , 1996, Nat. Lang. Eng..

[34]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[35]  Kepa Sarasola,et al.  Application of finite-state transducers to the acquisition of verb subcategorization information , 2003, Nat. Lang. Eng..

[36]  Emmanuel Roche,et al.  Finite-State Language Processing , 1997 .

[37]  Paul Althaus Smith,et al.  Pure and applied mathematics; : a series of monographs and textbooks. , 2003 .

[38]  Feiyu Xu,et al.  A Framework for Domain and Task Adaptive Named-Entity Recognition , 2002, BalticDB&IS.

[39]  Yves Schabes,et al.  Introduction to Finite-State Devices in Natural Language Processing , 1996 .

[40]  Mark-Jan Nederhof,et al.  Approximating Context-Free by Rational Transduction for Example-Based MT , 2001, DDMMT@ACL.

[41]  Gregory Grefenstette.  Light parsing as finite state filtering , 1999 .

[42]  Mehryar Mohri.  Minimization of Sequential Transducers , 1994, CPM.

[43]  Núria Gala Pavia.  Using the incremental finite-state architecture to create a Spanish shallow parser , 1999 .

[44]  Steven P. Abney.  Partial parsing via finite-state cascades , 1996, Natural Language Engineering.

[45]  R. Erdoğan.  Turkey , 1997, The Lancet.

[46]  Günter Neumann,et al.  An Intelligent Text Extraction and Navigation System , 2000, RIAO.

[47]  Kimmo Koskenniemi,et al.  A General Computational Model for Word-Form Recognition and Production , 1984, ACL.