A complex sentence with long range relations and substructures which are considered in each kernel are shown. a) a sentence with long range relations (bold ???: shortest path), b) examples of v-walk, c) examples of e-walks, ...One major approach to this issue is to adopt specific types of matching rules or patterns as the core relation discovery operation.