Let the walk wander, and write down the names.
Each step lands on a node; read the visits in order, and you get a sentence.
words 0
press space or → to walk, again to move on
← two vectors
predict what's nearby
inner product, then softmax
P(j | i) =
exp( ui · vj )
Σk exp( ui · vk )