Note that the time complexity of the first stage is O(|Ω|) since the cost of each update in Lines 8-10 is independent of the size of the corpus.
to see this, supposeÛ := {û w } w∈W andV := {v c } c∈C minimizes (9).