Carolin Lawrence, Kiril Gashteovski, Gorjan Radevski, Goran Glavaš, Chia-Chien Hung
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Open Information Extraction (OIE) methods extract facts from natural language text in the form of ("subject"; "relation"; "object") triples. These facts are, however, merely surface forms, the ambiguity of which impedes their downstream usage; e.g., the surface phrase "Michael Jordan" may refer to either the former basketball player or the university professor. Knowledge Graphs (KGs), on the other hand, contain facts in a canonical (i.e., unambiguous) form, but their coverage is limited by a static schema (i.e., a fixed set of entities and predicates). To bridge this gap, we need the best of both worlds: (i) high coverage of free-text OIEs, and (ii) semantic precision (i.e., monosemy) of KGs. In order to achieve this goal, we propose a new benchmark with novel evaluation protocols that can, for example, measure fact linking performance on a granular triple slot level, while also measuring if a system has the ability to recognize that a surface form has no match in the existing KG. Our extensive evaluation of several baselines shows that detection of out-of-KG entities and predicates is more difficult than accurate linking to existing ones, thus calling for more research efforts on this difficult task. We publicly release all resources (data, benchmark and code) 1 .
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2310.14909")
get_code_for_paper("2310.14909")
have("2310.14909")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2310.14909.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2310.14909)
Connect an agent — have() is free.