Our proposal is instead to consider for S those words that are Algorithm 1 Growing a network after each input u. for all w in u do update P (.|w) using Eqn.
(2) update current connections of w select S(w), a subset of words in the network for all w in S(w) do if w and w are sufficiently similar then connect w and w with an edge end if end for end for likely to be similar to w. since the network only needs to connect similar words to w, if we can guess what (some of) those words are, then we will do best at approximating the situation of comparing w to all words.