Abstract
This article presents a new tool, WFSC, for creating, manipulating, and applying weighted finite state automata. It inherits some powerful features from Xerox’s non-weighted XFST tool and represents a continuation of Xerox’s work in the field of finite state automata over two decades. The design is generic: algorithms work on abstract components of automata and on a generic abstract semiring, and are independent of their concrete realizations. Applications can access WFSC’s functions through an API or create automata through an end-user interface, either from an enumeration of their states and transitions or from rational expressions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdallahi, Lemine. 2002. Ocr postprocessing. Internal technical report, Xerox Research Centre Europe, Meylan, France.
Aït-Mokhtar, Salah and Jean-Pierre Chanod. 1997. Incremental finite-state parsing. In Proceedings of Applied Natural Language Processing, Washington, DC.
Beesley, Kenneth R. 2003. A language for finite state programming. In preparation.
Beesley, Kenneth R. and Lauri Karttunen. 2003. Finite State Morphology. CSLI Publications, Palo Alto, CA, USA. URL: http://www.fsmbook.com/.
Birkhoff, Garrett and Thomas C. Bartee. 1970. Modern Applied Algebra. McGraw-Hill, New York, USA.
Eilenberg, Samuel. 1974. Automata, Languages, and Machines, volume A. Academic Press, San Diego, CA, USA.
Grefenstette, Greg, Anne Schiller, and Salah Aït-Mokhtar. 2000. Recognizing lexical patterns in text. In F. Van Eynde and D. Gibbon, editors, Lexicon Development for Speech and Language Processing. Kluwer Academic Publishers, pages 431–453.
Kaplan, Ronald M. and Martin Kay. 1981. Phonological rules and finite state transducers. In Winter Meeting of the Linguistic Society of America, New York, USA. 109,
Karttunen, Lauri, Jean-Pierre Chanod, Greg Grefenstette, and Anne Schiller. 1997. Regular expressions for language engineering. Journal of Natural Language Engineering, 2(4):307–330.
Karttunen, Lauri, Tamás Gaál, Ronald M. Kaplan, André Kempe, Pasi Tapanainen, and Todd Yampol. 1996–2003. Xerox Finite-State Home Page. Xerox Research Centre Europe, Grenoble, France. URL: http://www.xrce.xerox.com/competencies/content-analysis/fst/.
Karttunen, Lauri, Ronald M. Kaplan, and Annie Zaenen. 1992. Two-level morphology with composition. In Proceedings of COLING’92, pages 141–148, Nantes, France.
Koskenniemi, Kimmo, Pasi Tapanainen, and Atro Voutilainen. 1992. Compiling and using finite-state syntactic rules. In Proceedings of COLING’92, volume 1, pages 156–162, Nantes, France.
Kuich, Werner and Arto Salomaa. 1986. Semirings, Automata, Languages. Number 5 in EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, Germany.
Manning, Christopher D. and Hinrich Schütze. 1999. Foundations of Statistical Natural Language Processing. MIT Press, Cambridge, MA, USA.
Mohri, Mehryar. 1997. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269–312.
Mohri, Mehryar. 2002. Generic epsilon-removal and input epsilon-normalization algorithms for weighted transducers. International Journal of Foundations of Computer Science, 13(1):129–143.
Mohri, Mehryar, Fernando C. N. Pereira, and Michael Riley. 1998. A rational design for a weighted finite-state transducer library. Number 1436 in Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany, pages 144–158.
Nicart, Florent. 2003. Toward scalable virtuality in C++. In preparation.
Pereira, Fernando C. N. and Michael D. Riley. 1997. Speech recognition by composition of weighted finite automata. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing. MIT Press, Cambridge, MA, USA, pages 431–453.
Rabiner, Lawrence R. 1990. A tutorial on hidden markov models and selected applications in speech recognition. In Alex Waibel and Kai-Fu Lee, editors, Readings in Speech Recognition. Morgan Kaufmann, pages 267–296.
Roche, Emmanuel and Yves Schabes. 1997. Finite-State Language Processing. MIT Press, Cambridge, MA, USA.
Silberztein, Max. 1999. INTEX: a finite state transducer toolbox. volume 231 of Theoretical Computer Science. Elsevier Science, pages 33–46.
Sproat, Richard. 1992. Morphology and Computation. MIT Press, Cambridge, MA.
Sproat, Richard. 2000. A Computational Theory of Writing Systems. Cambridge University Press, Cambridge, MA.
Sproat, Richard. 2003. Lextools Home Page. AT&T Labs — Research, Florham Park, NJ, USA. URL: http://www.research.att.com/sw/tools/lextools/.
van Noord, Gertjan. 2000. FSA6 — Finite State Automata Utilities Home Page. Alfa-informatica, University of Groningen, The Netherlands. URL: http://odur.let.rug.nl/vannoord/Fsa/.
Viterbi, Andrew J. 1967. Error bounds for convolutional codes and an asymptotical optimal decoding algorithm. In Proceedings of the IEEE, volume 61, pages 268–278. Institute of Electrical and Electronics Engineers.
Watson, Bruce W. 1994. The Design and Implementation of the FIRE engine: A C++ Toolkit for Finite Automata and Regular Expressions. Computing science note 94/22, Eindhoven University of Technology, The Netherlands.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kempe, A., Baeijs, C., Gaál, T., Guingne, F., Nicart, F. (2003). WFSC — A New Weighted Finite State Compiler. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_11
Download citation
DOI: https://doi.org/10.1007/3-540-45089-0_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40561-0
Online ISBN: 978-3-540-45089-4
eBook Packages: Springer Book Archive