UNIGRAM SEARCH: SIMPLE BECAUSE IT IS MEMORYLESS

• The simplest N-gram search is the unigram search, since it is memoryless. The language model probability depends only on the current word:
  
• The grammar network can be viewed as follows:
  
  
  The final state of each word is connect to the collector state by a null transition. The collector state is connected to the start state with another null transition. Word expansion is trivial.