- Most of the algorithms in this scenario have a final stage which takes the top j
entities and the top k relations returned by the entity and relation inference steps,
searches the knowledge base for triples containing those entities and relations, and
then ranks those triples.
- Thus, results are heuristic.

Saint Olaf College

+ An RDF triple is a 3-tuple, a predicate with two arguments, expressing
some simple relation or proposition.
+ Can be used to answer text questions like “When was Ada Lovelace
born?” or “Who was born in 1815?”.




Knowledge-Based QA from RDF triple stores (Graph-based QA)

+ Can be done in a way resembling the neural entity linking models: computing similarity between the encoding of the question text and the encoding for each possible relation.

Learn Before

Related