The first alternative approach was a standard cache model (Kuhn and de Mori 1990), which boosts the probabilities of previously observed unigrams and bigrams, on the theory that tokens tend to repeat themselves over longer distances.
this does not seem to be true for DA sequences in our corpus, as the cache model showed no improvement over the standard N-gram.