Open-World Knowledge Graph Completion with Linguistic Noise

Reasoning over Knowledge Bases is a wellestablished task in Artificial Intelligence, but when it comes to perform reasoning in an open-world scenario, in which entities involved in logical statements may be unknown to the reasoner, exact reasoning does not apply. In this work we deal with the case of Open-World Knowledge Graph Completion (KGC): a set of tasks concerning the assessment of the validity of new triples with unseen entities given a pre-existing Knowledge Graph. The use of Large Language Models to represent triples in a vector space is widespread, but most approaches either focus on injecting knowledge in the Language Model at training stage or adopt the LLMs to perform the tasks altogether. The main drawback of such approaches is the wrong prioritization of the LLM’s internal knowledge over the information present in the KG, which is also less subject to various forms of linguistic noise.