([[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]])
}
input_ids包含输入查询中令牌的数字id。...Token_type_ids表示每个令牌所属的片段或句子(本例中第一个句子为0)。
接下来,就可以根据编码查询从语料库中检索相关段落。我们使用余弦相似度计算查询嵌入和段落嵌入之间的相似度分数。...下面是实现:
import networkx as nx
# Create a directed graph
knowledge_graph = nx.DiGraph()
# Add nodes...and edges from cleaned triples
for (subject, relation, object) in cleaned_triples:
knowledge_graph.add_edge...(subject, object, relation=relation)
# Visualize the knowledge graph
nx.draw(knowledge_graph, with_labels