Ji-Rong Wen, Jinhao Jiang, Kun Zhou, Wayne Zhao
We lifted 17 functions out of this paper's own repositories and ran 9 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| RUCAIBox/UniKGQA | canonical | 9 of 17 |
| Function | Status | Where it lives |
|---|---|---|
| compute_gold_const_rel_recall | Ran | RUCAIBox/UniKGQA/UniModel/extract_abstract_subgraph.py code served (permissive licence) · get_code("33c05189007d001e") |
| compute_gold_rel_str_recall | Ran | RUCAIBox/UniKGQA/UniModel/extract_abstract_subgraph.py code served (permissive licence) · get_code("c9ddcdb426b7415c") |
| extract_shortest_paths | Ran | RUCAIBox/UniKGQA/UniModel/extract_abstract_subgraph.py code served (permissive licence) · get_code("a8bf75a4078ff37e") |
| get_answers | Ran | RUCAIBox/UniKGQA/UniModel/convert_abs_to_NSM_format.py code served (permissive licence) · get_code("6cc4c2a66647120f") |
| get_global_const_entities | Ran | RUCAIBox/UniKGQA/UniModel/convert_inst_to_NSM_format.py code served (permissive licence) · get_code("e27d30e88c385923") |
| get_global_topic_entities | Ran | RUCAIBox/UniKGQA/UniModel/convert_abs_to_NSM_format.py code served (permissive licence) · get_code("bc4cb80d7dd8de17") |
| get_global_topic_entity | Ran | RUCAIBox/UniKGQA/UniModel/convert_inst_to_NSM_format.py code served (permissive licence) · get_code("26dd036f60f5cb63") |
| get_meta_info_gold_entities | Ran | RUCAIBox/UniKGQA/UniModel/map_kg_2_global_id.py code served (permissive licence) · get_code("256c66dbbebcc087") |
| load_dict | Ran | RUCAIBox/UniKGQA/UniModel/convert_abs_to_NSM_format.py code served (permissive licence) · get_code("d1508d96f5948a8e") |
| construct_contrastive_pos_neg_paths | Not yet run | RUCAIBox/UniKGQA/UniModel/extract_valid_weak_paths.py code served (permissive licence) · get_code("8764d92556a06708") |
| construct_contrastive_pos_neg_paths | Not yet run | RUCAIBox/UniKGQA/UniModel/s1_construct_relation_retrieval_training_data.py code served (permissive licence) · get_code("8e4f03b5d7ed6f80") |
| extract_shortest_paths | Not yet run | RUCAIBox/UniKGQA/UniModel/s2_extract_abstract_subgraph.py code served (permissive licence) · get_code("e8ced166b1cf4873") |
| get_neg_rels_neibouring | Not yet run | RUCAIBox/UniKGQA/UniModel/s1_construct_relation_retrieval_training_data.py code served (permissive licence) · get_code("068354e2944b30d0") |
| get_paths_from_tpe_to_ans | Not yet run | RUCAIBox/UniKGQA/UniModel/s0_extract_weak_super_relations.py code served (permissive licence) · get_code("fba844611b43fecd") |
| get_paths_from_tpe_to_ans_with_specific_hop | Not yet run | RUCAIBox/UniKGQA/UniModel/s0_extract_weak_super_relations.py code served (permissive licence) · get_code("eb939eeb1bbe1dda") |
| get_paths_from_tpe_to_cpes | Not yet run | RUCAIBox/UniKGQA/UniModel/s0_extract_weak_super_relations.py code served (permissive licence) · get_code("a93b4bf7311c5d95") |
| get_subgraph | Not yet run | RUCAIBox/UniKGQA/UniModel/s2_extract_abstract_subgraph.py code served (permissive licence) · get_code("52af9ff41cf852e7") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Multi-hop Question Answering over Knowledge Graph (KGQA) aims to find the answer entities that are multiple hops away from the topic entities mentioned in a natural language question on a large-scale Knowledge Graph (KG). To cope with the vast search space, existing work usually adopts a two-stage approach: it first retrieves a relatively small subgraph related to the question and then performs the reasoning on the subgraph to find the answer entities accurately. Although these two stages are highly related, previous work employs very different technical solutions for developing the retrieval and reasoning models, neglecting their relatedness in task essence. In this paper, we propose UniKGQA, a novel approach for multi-hop KGQA task, by unifying retrieval and reasoning in both model architecture and parameter learning. For model architecture, UniKGQA consists of a semantic matching module based on a pre-trained language model (PLM) for question-relation semantic matching, and a matching information propagation module to propagate the matching information along the directed edges on KGs. For parameter learning, we design a shared pre-training task based on questionrelation matching for both retrieval and reasoning models, and then propose retrieval-and reasoning-oriented fine-tuning strategies. Compared with previous studies, our approach is more unified, tightly relating the retrieval and reasoning stages. Extensive experiments on three benchmark datasets have demonstrated the effectiveness of our method on the multi-hop KGQA task. Our codes and data are publicly available at https://github.com/RUCAIBox/UniKGQA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2212.00959")
get_code_for_paper("2212.00959")
have("2212.00959")
Connect an agent — have() is free.