Papers by Paolo Gajo
LLMs Underperform Graph-Based Parsers on Supervised Relation Extraction for Complex Graphs (2026.acl-short)
Copied to clipboard
| Challenge: | Relation extraction is a core NLP task which involves extracting [head, relation, dependent] RDF triples from text. |
| Approach: | They evaluate four large language models against a graph-based parser on six relation extraction datasets with sentence graphs of varying sizes and complexities. |
| Outcome: | The graph-based parser outperforms the LLMs on six relation extraction datasets with sentence graphs of varying sizes and complexities. |