Research Article
Few-Shot Multihop Question Answering over Knowledge Base
Algorithm 1
Multihop relation extraction. For each query schema, we generate a set of candidate query paths
, where
represents the hop number of the schema.
Input:, question , topic entity set , number of hops | Output: | 1: Initialize: | 2: for t=1,2,...,do | 3: | 4: | 5: for each do | 6: | 7: for eachdo | 8: ifthen | 9: | 10: else | 11: | 12: end if | 13: | 14: | 15: end for | 16: end for | 17: score all elements in and rank all corresponding elements in | 18: end for |
|