1.   The major failing with finite state grammars is their inability to deal with any dependencies that exist between non-adjacent words.

2.   The finite state grammar allowed the width of the beam to be calculated with very little chance that the correct hypothesis would be eliminated.

3.   HARPY takes the types represented by its finite state grammar and compiles out all the tokens -- the possible utterances in the system -- ahead of time.

4.   In the ARPA project, most of the search strategies relied on properties of finite state grammars to limit the search.