(Choose
1
What is FSA (Finite State Automata)?
A. Finite state automaton is a model of behavior composed of state, transitions and actions.
answer)
B. This consists of rules which map the two representations to each other. Each rule is described through a finite-state transducer
C. It takes raw corpus as input and produces a segmentation of the word forms observed in the text.
D. None of the others
6
