In any knowledge graph, a sentence is represented as triple with <subject, predicate, object>.
we rank the candidates by creating a triple consisting of the relation and entity candidates from DBpedia entity candidates and DBpedia relation candidates, then check if these triples exist in the DBpedia KG.