Dhananjay Bhandiwad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Dhananjay Bhandiwad has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jens Lehmann
Faculty of Computer Science, TUD Dresden University of Technology, Dresden, Germany
3 shared publications - Sahar Vahdati
TU Dresden
3 shared publications - Preetam Gattogi
Center for Interdisciplinary Digital Sciences (CIDS), ScaDS.AI Dresden/Leipzig, Technische Universitt Dresden, Dresden, Germany
2 shared publications - Sébastien Ferré
Univ Rennes, CNRS, Inria, Insa Rennes, IRISA
2 shared publications - Andrei Aioanei
TIB Leibniz Information Centre for Science and Technology Hannover Germany
1 shared publication - Ashish Kangen1 shared publication
Latest Publications
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 9290-9301
ARC-TGI: Human-Validated Task Generators with Reasoning Chain Templates for ARC-AGI
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 9290-9301
Open AccessARC-TGI: Human-Validated Task Generators with Reasoning Chain Templates for ARC-AGI
- Open Access
- 28 January 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 337
Bridging language models and knowledge graphs with controlled natural languages
- 28 January 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 337
Open AccessBridging language models and knowledge graphs with controlled natural languages
- Open Access
- 28 September 2023
- Published by IOS Press
- p. 1348-1356
Language Models as Controlled Natural Language Semantic Parsers for Knowledge Graph Question Answering
We propose the use of controlled natural language as a target for knowledge graph question answering (KGQA) semantic parsing via language models as opposed to using formal query languages directly. Controlled natural languages are close to (human) natural languages, but can be unambiguously translated into a formal language such as SPARQL. Our research hypothesis is that the pre-training of large language models (LLMs) on vast amounts of textual data leads to the ability to parse into controlled natural language for KGQA with limited training data requirements. We devise an LLM-specific approach for semantic parsing to study this hypothesis. To conduct our study, we created a dataset that allows the comparison of one formal and two different controlled natural languages. Our analysis shows that training data requirements are indeed substantially reduced when using controlled natural languages, which is relevant since collecting and maintaining high-quality KGQA semantic parsing training data is very expensive and time-consuming.
- 28 September 2023
- Published by IOS Press
- p. 1348-1356
Open AccessLanguage Models as Controlled Natural Language Semantic Parsers for Knowledge Graph Question Answering
We propose the use of controlled natural language as a target for knowledge graph question answering (KGQA) semantic parsing via language models as opposed to using formal query languages directly. Controlled natural languages are close to (human) natural languages, but can be unambiguously translated into a formal language such as SPARQL. Our research hypothesis is that the pre-training of large language models (LLMs) on vast amounts of textual data leads to the ability to parse into controlled natural language for KGQA with limited training data requirements. We devise an LLM-specific approach for semantic parsing to study this hypothesis. To conduct our study, we created a dataset that allows the comparison of one formal and two different controlled natural languages. Our analysis shows that training data requirements are indeed substantially reduced when using controlled natural languages, which is relevant since collecting and maintaining high-quality KGQA semantic parsing training data is very expensive and time-consuming.