Tools for Fast Morphological Analysis Based on Finite State Automata

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.

Autoři	ŠMERK Pavel
Rok publikování	2014
Druh	Článek ve sborníku
Konference	Eighth Workshop on Recent Advances in Slavonic Natural Language Processing
Fakulta / Pracoviště MU	Fakulta informatiky
Citace
www	https://nlp.fi.muni.cz/raslan/2014/17.pdf
Obor	Informatika
Klíčová slova	morphological analysis; minimal deterministic finite state automata
Popis	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.
Související projekty:	Projekt LINDAT-Clarin - Vybudování a provoz českého uzlu pan-evropské infrastruktury pro výzkum