The grounded schema graphs are usually much more complicated and noisier, unlike the ideal case shown in the figure.
for each question concept c i ∈ C q and answer concept c j ∈ C a , we can efficiently find paths between them that are shorter than k concepts 4 .