Rel-grams: a probabilistic model of relations in text
AKBC-WEKEX@NAACL-HLT, pp. 101-105, 2012.
We introduce the Rel-grams language model, which is analogous to an n-grams model, but is computed over relations rather than over words. The model encodes the conditional probability of observing a relational tuple R, given that R' was observed in a window of prior relational tuples. We build a database of Rel-grams co-occurence statisti...More
PPT (Upload PPT)