Due to the incompleteness and tremendous size of ConceptNet, we find that it is impractical to retrieve a comprehensive but helpful set of knowledge facts this way.
we propose a straightforward yet effective graph construction algorithm via path finding among mentioned concepts (C q ∪ C a ).