Adaptive Relation Linking Boosts Multihop Question Answering Over Knowledge Graphs

Answering a complex natural language question with the help of a knowledge graph sounds deceptively simple: parse the question, find the relevant entities, follow the right connections, and read off the answer. In practice, the hardest step is often the quietest one. Every knowledge graph stores its facts as triples of entities and relations, and those relations carry formal names such as birthPlace or associatedBand that rarely match the way humans phrase things. Translating a loose relation phrase like “where was the singer born” into the precise predicate inside a graph of millions of edges is the task known as relation linking, and errors there ripple through the entire question answering pipeline, garbling the query and producing confident nonsense.

Researchers C. M. Suneera and Jay Prakash of the Department of Computer Science and Engineering at the National Institute of Technology Calicut have now introduced a new approach to this problem, described in the International Journal of Data Science and Analytics. Their method, called Entity Dependent and Independent Relation Linking, or EDIRL, takes aim at a rigidity that has plagued earlier systems: the habit of applying a single linking strategy to every question, regardless of what kind of question is being asked.

Existing relation linking techniques generally fall into two camps. Entity-dependent methods assume the question contains a topic entity whose surrounding subgraph can be searched for candidate predicates, an approach that works well when the relation is explicit and the entity anchors the search. Entity-independent methods, by contrast, map relation phrases directly to knowledge graph properties without leaning on entity context, which helps when the mention is vague or the entity subgraph is uninformative. Most prior systems commit to one strategy wholesale, and that one-size-fits-all choice breaks down precisely on the questions that matter most in multihop scenarios, where ambiguity and implicit relation mentions are common.

EDIRL’s central idea is adaptivity. Rather than forcing every question through the same funnel, the system first determines the question type and then checks whether matching predicates actually exist in the candidate entity subgraph. If the entity-dependent path promises a solid match, the system exploits it; if the entity subgraph offers nothing useful, the system switches to the entity-independent route. This decision, made per question rather than per system, is what allows EDIRL to handle both direct relation mentions and the subtler, implied cases that have historically tripped up automated pipelines.

Underneath that adaptive decision sits a carefully staged pipeline. The input question undergoes preprocessing, including dependency tree analysis that exposes the grammatical relationships among tokens, information that earlier methods largely ignored. The system then performs candidate entity linking to ground the question’s topic entity in the graph, extracts the entity’s subgraph, and compares relation phrases against both property lists and ontology classes associated with the entity’s type. Exploiting the class of the topic entity, a step many competing approaches neglect, narrows the search space dramatically and filters out predicates that could not plausibly apply.

The final semantic matching stage leans on modern language model machinery. EDIRL employs BERT-based relation embeddings to measure the similarity between a natural language relation mention and the formal predicates of the knowledge graph, capturing paraphrase and synonymy that surface-level string matching misses. Because the authors had previously demonstrated the value of BERT-based relation mapping for question answering, the embedding component builds on a validated foundation while the adaptive routing layer adds the flexibility that fixed pipelines lack.

The evaluation targeted multihop question answering, where an answer cannot be read from a single triple but requires chaining several relations across the graph. Questions such as “which movies starring the director of a given film were released after a certain year” demand that the system correctly link not one but multiple relation mentions, and a single linking error derails the whole chain. This makes relation linking accuracy disproportionately important as question complexity grows, and it is exactly the regime where entity-dependent and entity-independent strategies diverge most sharply in their failure modes.

Benchmark experiments showed that EDIRL outperformed existing relation linking approaches in F1-score, the harmonic mean of precision and recall that balances finding all relevant relations against avoiding false matches. The gain matters because relation linking sits upstream of query construction: a system that links relations more accurately can translate questions into correct formal queries against the graph, improving answer quality for every downstream component. The improvements were especially notable for ambiguous and implicit relation mentions, the categories where conventional approaches most often returned incorrect predictions.

The work arrives amid a lively debate about how large language models and structured knowledge should interact. While LLMs excel at linguistic fluency, they hallucinate facts, and knowledge graphs offer verifiable structure that can anchor their answers. Hybrid systems that inject graph knowledge into language model reasoning are proliferating, but they all inherit the same bottleneck: the quality of the mapping between human language and graph formalism. Advances in relation linking therefore remain foundational even, and perhaps especially, in the era of generative AI, since a language model reasoning over a knowledge graph still needs to know which edges to traverse.

For practitioners, EDIRL offers a practical lesson: question type and data availability should drive the choice of technique, not the other way around. By combining dependency parsing, question classification, subgraph analysis, ontology-aware matching, and contextual embeddings into a single adaptive framework, the NIT Calicut team has shown that relation linking need not be a fixed compromise between two imperfect strategies. As knowledge graphs continue to underpin search engines, recommendation systems, medical informatics, and question answering assistants, methods that bridge the gap between how people ask and how machines store will determine how much of that stored knowledge actually becomes retrievable.

Subject of Research: Adaptive relation linking for multihop question answering over knowledge graphs

Article Title: EDIRL: An effective relation linking approach for multihop question answering over knowledge graphs

Article References: EDIRL: An effective relation linking approach for multihop question answering over knowledge graphs. (n.d.). https://doi.org/10.1007/s41060-026-01289-1

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01289-1

Keywords: knowledge graph question answering, relation linking, multihop question answering, BERT, entity linking, natural language processing, dependency parsing, ontology, knowledge graphs, question classification, F1-score, semantic web