We assume that a morphological analysis consists of three processes: tokenization, dictionary lookup, and disambiguation.
the process can be implemented by a finite state machine or a simple pattern matcher.