| << Prev | - Up - |
Further reading.
This lecture is partly based on Chapter 3 of [JM00]. There you can read more about morphology and finite state transducers and find some more details about the mathematical properties of FSTs.
The introduction to morphology in this lecture was very quick and superficial. If you want to know more, any introductory text to linguistics should help.
If you are interested in more details about the relation between transducers, regular relations, and rewriting grammars, have a look at [KK94].
Gert-Jan van Noord has developed a system called FSA Utilities which let's you specify regular expressions and builds the corresponding automaton for you. It can also do various operations on automata (minimization, determinization, union ...)
| << Prev | - Up - |