Given a knowledge graph G = (E, R, T), where E, R and T are the entity set, relation set and KG triple set, respectively, and a news text snippet for which entity linking has been performed to build the mentioned entity set L ⊂ E, the text-based knowledge graph updating task is to read the news snippet S and update T accordingly to get the final triple set T and the updated graph G = (E, R, T ).
this requires far more complicated updating rules.