AINeutralarXiv – CS AI · 11h ago6/10
🧠
LLMs Underperform Graph-Based Parsers on Supervised Relation Extraction for Complex Graphs
A new study comparing large language models against graph-based parsers for relation extraction demonstrates that smaller, specialized architectures significantly outperform LLMs when processing complex linguistic graphs with multiple relations. This finding challenges the prevailing assumption that larger language models are universally superior for natural language processing tasks.