Summary

FSTNs are the simplest approach to NLP.

FSTNs are of very little use by themselves.

FSTs map one string of symbols into another.

FSTs can be used for sublanguage translation.

FSTs can be used for morphological processing.

Finite state automata are easy to implement.

Finite state automata do not suffice for NLP.

Send us a comment.


[Contents] [Previous] [Next]
This document was translated by troff2html v0.21 on October 22, 1996.