A class-hierarchy pruning algorithm that asks a large language model to choose among knowledge graph categories improves zero-shot entity disambiguation over a plain-prompt baseline.
Journal of Network and Computer Applications 185, 103076 (2021)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Knowledge Graphs for Enhancing Large Language Models in Entity Disambiguation
A class-hierarchy pruning algorithm that asks a large language model to choose among knowledge graph categories improves zero-shot entity disambiguation over a plain-prompt baseline.