Tools for Fast Morphological Analysis Based on Finite State Automata


This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on



Year of publication 2014
Type Article in Proceedings
Conference Eighth Workshop on Recent Advances in Slavonic Natural Language Processing
MU Faculty or unit

Faculty of Informatics

Field Informatics
Keywords morphological analysis; minimal deterministic finite state automata
Description The paper presents a new implementation of some of Jan Daciuk’s algorithms and tools for morphological analysis based on finite state automata. In particular, we offer a reimplemented version of the tool which builds the automata from an input set of strings and of the tool which performs the morphological analysis itself. In addition to 8-bit versions we also offer “Unicode-aware” versions with the Unicode characters encoded directly in the arcs of the automaton. The new implementation is faster than the original one and its code is much more simple and straightforward.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.