Algorithm 1 Online LIFE 1: INPUT: a;b t ;g;b c ;w p ;S s ;t 1 ;t 2 ;t 3 2: for s=1 to S stream do 3: if s=1 then 5: 6: else 8: for each item w i ∈ Dic s−1 do 11: if w i ∈ Dic s then 12: 13: 14: for each w i ∈ Dic s do 16: 17: 18: end for for each w i ∈ Dic s do 20:  33: The LS dictionary of O-LIFE is updated as it reads data.
|Dic prev | ≤ |Dic cur | and Dic prev ⊆ Dic cur , where Dic prev is the previous dictionary and Dic cur is the current dictionary.