4. The method of claim 1 wherein the computing of the one or more unreasonable answer probabilities further comprises: selecting one of the ranked answers from the set of ranked answers; generating a knowledge graph disjointedness score for the selected ranked answer based upon evaluating the selected ranked answer against a knowledge graph comprising a plurality of entity relationships, wherein at least one of the plurality of entity relationships is selected from the group consisting of a parent-child relationship, an SVO relationship, and an object-attribute relationship; and utilizing the knowledge graph disjointedness score in the computing of the unreasonable answer probability for the selected ranked answer.
4. The method of claim 1 wherein the computing of the one or more unreasonable answer probabilities further comprises: selecting one of the ranked answers from the set of ranked answers; generating a knowledge graph disjointedness score for the selected ranked answer based upon evaluating the selected ranked answer against a knowledge graph comprising a plurality of entity relationships, wherein at least one of the plurality of entity relationships is selected from the group consisting of a parent-child relationship, an SVO relationship, and an object-attribute relationship; and utilizing the knowledge graph disjointedness score in the computing of the unreasonable answer probability for the selected ranked answer. 6. The method of claim 4 further comprising: generating a taxonomy disjointedness score of the selected ranked answer based upon evaluating one or more tags corresponding to the selected ranked answer; and utilizing the taxonomy disjointedness score in the computing of the unreasonable answer probability of the selected ranked answer.