Matches can be exact or fuzzy; the latter is similar to the identification of graph neighborhoods in our approach.
our GBL scheme propagates similarity scores not just from known to unknown sentences but also indirectly, via connections through other unknown sentences.