Each run of the BFS calculates the minimum distance paths between v i and the rest of concepts of G KB .
we are interested in the minimum distance paths between v i and the concepts associated to the rest of the words in the context, v j ∈ j =i Concepts j .