Abstract
In this article we want to discuss the design patterns used and proposed for the realization of finite state automata. Various aspects in the design of a framework for the implementation of FSA will be treated, presenting not only the patterns for the single components, but the entire system design. Using design patterns to sketch a framework means performing an ”abstract implementation”, from which it is possible to realize concrete specific automata, simply customizing some classes. In order to test the framework, some concrete lexical tools have been created. The resulting automata and transducers are used to perform word form analysis, word form generation, creation and derivation history, spellchecking and phrase recognition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gamma E., Helm R., Johnson R., Vlissides J.: Design Patterns, Addison Wesley, 1995.
ten Hacken P, Bopp S., Domenig M., Holz D., Hsiung A, Pedrazzini S.: A Knowledge Acquisition and Management System for Morphological Dictionaries, In Proceedings of Coling-94, International Conference on Computer Linguistics, Kyoto, 1994.
Johnson R.E and Foote B., Designing reusable classes, Journal of Object-Oriented Programming, June/July 1988.
Karttunen Lauri: Finite-State Lexicon Compiler, Xerox Corporation Palo Alto Research Center, Technical Report [P93-00077], 1993.
Pedrazzini S.: Applying Software Design for Creating Customizable Lexical Tools, Technical Report 97–2, Universität Basel, July 1997.
Pedrazzini S., Hoffmann M.: From Lexical Acquisition to Lexical Reusable Tools, First International Conference on Language Resources and Evaluation (LERC), Granada, Spain, May 1998.
Watson B.: Implementing and using finite automata toolkits, in Natural Language Engineering, Vol 2, part 4, pp. 295–302, December 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pedrazzini, S. (1999). The Finite State Automata’s Design Patterns. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-48057-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66652-3
Online ISBN: 978-3-540-48057-0
eBook Packages: Springer Book Archive