Similar to Clarkson and Robinson (1997), we implemented an exponentially decaying cache of length l (usually between 100 and 1000), using the following decay function for a word w i and its position p in the cache.
using the results of our 8 samples, we performed paired t tests for every method with the baseline as well as with the cache model.