Knowledge bases(KBs)are often greatly incomplete,necessitating a demand for KB completion.Although XLORE is an English-Chinese bilingual knowledge graph,there are only 423,974 cross-lingual links between English insta...Knowledge bases(KBs)are often greatly incomplete,necessitating a demand for KB completion.Although XLORE is an English-Chinese bilingual knowledge graph,there are only 423,974 cross-lingual links between English instances and Chinese instances.We present XLORE2,an extension of the XLORE that is built automatically from Wikipedia,Baidu Baike and Hudong Baike.We add more facts by making cross-lingual knowledge linking,cross-lingual property matching and fine-grained type inference.We also design an entity linking system to demonstrate the effectiveness and broad coverage of XLORE2.展开更多
Let Xi,X2,... ,Xk be k disjoint subsets of S with the same cardinality m. Define H（m,k） = {X lahtain in S ： X ￠Xi for 1 ≤ i≤ k} and P（m,k） = {X lohtain ni S ： X ∩ Xi ≠0 for at least two Xi＇s}. Suppose S=U...Let Xi,X2,... ,Xk be k disjoint subsets of S with the same cardinality m. Define H（m,k） = {X lahtain in S ： X ￠Xi for 1 ≤ i≤ k} and P（m,k） = {X lohtain ni S ： X ∩ Xi ≠0 for at least two Xi＇s}. Suppose S=Ui=1^k Xi , and let Q（m, k, 2） be the collection of all subsets K of S satisfying ｜K ∩ Xi｜ ≥ 2 for some 1 ≤ i ≤ k. For any two disjoint subsets Yi and Y2 of S, we define F1,j = {X lahtain in S ： either ｜X ∩Y1｜≥1 or ｜X ∩ Y2｜≥ j}. It is obvious that the four posets are graded posets ordered by inclusion. In this paper we will prove that the four posets are nested chain orders.展开更多
基金National Natural Science Foundation of China(NSFC)key project(No.61533018,No.U1736204 and No.61661146007)Ministry of Education and China Mobile Research Fund(No.20181770250)and THUNUS NExT Co-Lab.
文摘Knowledge bases(KBs)are often greatly incomplete,necessitating a demand for KB completion.Although XLORE is an English-Chinese bilingual knowledge graph,there are only 423,974 cross-lingual links between English instances and Chinese instances.We present XLORE2,an extension of the XLORE that is built automatically from Wikipedia,Baidu Baike and Hudong Baike.We add more facts by making cross-lingual knowledge linking,cross-lingual property matching and fine-grained type inference.We also design an entity linking system to demonstrate the effectiveness and broad coverage of XLORE2.
基金the National Natural Science Foundation of China （No. 10471016）.
文摘Let Xi,X2,... ,Xk be k disjoint subsets of S with the same cardinality m. Define H（m,k） = {X lahtain in S ： X ￠Xi for 1 ≤ i≤ k} and P（m,k） = {X lohtain ni S ： X ∩ Xi ≠0 for at least two Xi＇s}. Suppose S=Ui=1^k Xi , and let Q（m, k, 2） be the collection of all subsets K of S satisfying ｜K ∩ Xi｜ ≥ 2 for some 1 ≤ i ≤ k. For any two disjoint subsets Yi and Y2 of S, we define F1,j = {X lahtain in S ： either ｜X ∩Y1｜≥1 or ｜X ∩ Y2｜≥ j}. It is obvious that the four posets are graded posets ordered by inclusion. In this paper we will prove that the four posets are nested chain orders.
