In this paper we presented a novel online algorithm for building a lexicon from ambiguously supervised relational data.
to the previous approach that computed common subgraphs between different contexts in which an n-gram appeared, we instead focus on small, connected subgraphs and introduce an algorithm, SGOLL, that is an order of magnitude faster.