Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tuan-Phong Nguyen

dblp:193/0336 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
7since 2021 · last 2026
0000-0002-1674-2741ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 4 first-author · 5 since 2021Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
Knowledge representation and reasoning · 55% Information extraction and text analysis · 29% Language models and text generation · 12%
Databases, data mining, and information retrieval
3 papers
Knowledge graphs · 74% Data models and query languages · 26%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › commonsense reasoning
commonsense knowledge
1.832023
Extracting Cultural Commonsense Knowledge at Scale · WWW 2023
UnCommonSense in Action! Informative Negations for Commonsense Knowledge Bases · WSDM 2023
Advanced Semantics for Commonsense Knowledge Extraction · WWW 2021
Natural language and speech › Information extraction and text analysis
open information extraction
1.832023
Refined Commonsense Knowledge From Large-Scale Web Contents · IEEE Trans. Knowl. Data Eng. 2023
Extracting Cultural Commonsense Knowledge at Scale · WWW 2023
Advanced Semantics for Commonsense Knowledge Extraction · WWW 2021
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition
knowledge base construction
1.422025
Enabling LLM Knowledge Analysis via Extensive Materialization · ACL (1) 2025
Advanced Semantics for Commonsense Knowledge Extraction · WWW 2021
Knowledge graphs
knowledge graph construction
1.222026
GPTKB v1.5: A Massive Knowledge Base for Exploring Factual LLM Knowledge · AAAI 2026
Extracting Cultural Commonsense Knowledge at Scale · WWW 2023
Knowledge graphs
knowledge graph querying
1.012026
GPTKB v1.5: A Massive Knowledge Base for Exploring Factual LLM Knowledge · AAAI 2026
Data models and query languages › RDF query language
SPARQL
1.012026
GPTKB v1.5: A Massive Knowledge Base for Exploring Factual LLM Knowledge · AAAI 2026
Natural language and speech › Information extraction and text analysis › relation extraction
joint entity and relation extraction
0.912025
Enabling LLM Knowledge Analysis via Extensive Materialization · ACL (1) 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › commonsense reasoning
commonsense knowledge base
0.712023
UnCommonSense in Action! Informative Negations for Commonsense Knowledge Bases · WSDM 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › commonsense reasoning
cultural commonsense
0.712023
Extracting Cultural Commonsense Knowledge at Scale · WWW 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic programming
negation
0.712023
UnCommonSense in Action! Informative Negations for Commonsense Knowledge Bases · WSDM 2023
Knowledge graphs
commonsense knowledge
0.712023
Refined Commonsense Knowledge From Large-Scale Web Contents · IEEE Trans. Knowl. Data Eng. 2023
Natural language and speech › Language models and text generation › large language model › knowledge in language models
factual knowledge in language models
0.312026
GPTKB v1.5: A Massive Knowledge Base for Exploring Factual LLM Knowledge · AAAI 2026

Methods — techniques the papers use, named apart from their topics

massive-recursive LLM knowledge materialization · 2.0ranking · 1.3open information extraction · 1.3cleaning · 1.3classification-based filtering · 1.3result consolidation · 0.9recursive querying · 0.9language model cleaning · 0.5
YearPublicationVenuePosition
2026 GPTKB v1.5: A Massive Knowledge Base for Exploring Factual LLM Knowledge
abstract
Language models are powerful artifacts, yet their factual knowledge is still poorly understood, and inaccessible to ad-hoc browsing and scalable statistical analysis. This demonstration introduces GPTKB v1.5, a densely interlinked 100-million-triple knowledge base (KB) built for $14,000 from GPT-4.1, using the GPTKB methodology for massive-recursive LLM knowledge materialization. This demo focuses on three use cases: (1) link-traversal-based LLM knowledge exploration, (2) SPARQL-based structured LLM knowledge querying, (3) comparative exploration of the strengths and weaknesses of LLM knowledge. Massive-recursive LLM knowledge materialization is a groundbreaking opportunity both for the systematic analysis of LLM knowledge, as well as for automated KB construction.
Tuan-Phong Nguyen, Shrestha Ghosh, Simon Razniewski
AAAI2
2025 Enabling LLM Knowledge Analysis via Extensive Materialization
abstract
Large language models (LLMs) have majorly advanced NLP and AI, and next to their ability to perform a wide range of procedural tasks, a major success factor is their internalized factual knowledge.Since Petroni et al. (2019), analyzing this knowledge has gained attention.However, most approaches investigate one question at a time via modest-sized pre-defined samples, introducing an "availability bias" (Tversky and Kahneman, 1973) that prevents the analysis of knowledge (or beliefs) of LLMs beyond the experimenter's predisposition.To address this challenge, we propose a novel methodology to comprehensively materialize an LLM's factual knowledge through recursive querying and result consolidation.Our approach is a milestone for LLM research, for the first time providing constructive insights into the scope and structure of LLM knowledge (or beliefs).As a prototype, we extract a knowledge base (KB) comprising 101 million relational triples for over 2.9 million entities from GPT-4o-mini.We use this KB to exemplarily analyze GPT-4o-mini's factual knowledge in terms of scale, accuracy, bias, cutoff and consistency, at the same time.Our resource is accessible at https://gptkb.org.
Tuan-Phong Nguyen, Shrestha Ghosh, Simon Razniewski
ACL (1)2
2024 Cultural Commonsense Knowledge for Intercultural Dialogues
abstract
Despite recent progress, large language models (LLMs) still face the challenge of appropriately reacting to the intricacies of social and cultural conventions. This paper presents Mango, a methodology for distilling high-accuracy, high-recall assertions of cultural knowledge. We judiciously and iteratively prompt LLMs for this purpose from two entry points, concepts and cultures. Outputs are consolidated via clustering and generative summarization. Running the Mango method with GPT-3.5 as underlying LLM yields 167K high-accuracy assertions for 30K concepts and 11K cultures, surpassing prior resources by a large margin in quality and size. In an extrinsic evaluation for intercultural dialogues, we explore augmenting dialogue systems with cultural knowledge assertions. Notably, despite LLMs inherently possessing cultural knowledge, we find that adding knowledge from Mango improves the overall quality, specificity, and cultural sensitivity of dialogue responses, as judged by human annotators. Data and code are available for download.
Tuan-Phong Nguyen, Simon Razniewski, Gerhard Weikum
CIKM1
2023 UnCommonSense in Action! Informative Negations for Commonsense Knowledge Bases
abstract
Knowledge bases about commonsense knowledge i.e., CSKBs, are crucial in applications such as search and question answering. Prominent CSKBs mostly focus on positive statements. In this paper we show that materializing important negations increases the usability of CSKBs. We present Uncommonsense, a web portal to explore informative negations about everyday concepts: (i) in a research-focused interface, users get a glimpse into results-per-steps of the methodology; (ii) in a trivia interface, users can browse fun negative trivia about concepts of their choice; and (iii) in a query interface, users can submit triple-pattern queries with explicit negated relations and compare results with significantly less relevant answers from the positive-only baseline. It can be accessed at:https://uncommonsense.mpi-inf.mpg.de/.
Hiba Arnaout, Tuan-Phong Nguyen, Simon Razniewski, Gerhard Weikum
WSDM2
2023 Extracting Cultural Commonsense Knowledge at Scale
abstract
Structured knowledge is important for many AI applications. Commonsense knowledge, which is crucial for robust human-centric AI, is covered by a small number of structured knowledge projects. However, they lack knowledge about human traits and behaviors conditioned on socio-cultural contexts, which is crucial for situative AI. This paper presents Candle, an end-to-end methodology for extracting high-quality cultural commonsense knowledge (CCSK) at scale. Candle extracts CCSK assertions from a huge web corpus and organizes them into coherent clusters, for 3 domains of subjects (geography, religion, occupation) and several cultural facets (food, drinks, clothing, traditions, rituals, behaviors). Candle includes judicious techniques for classification-based filtering and scoring of interestingness. Experimental evaluations show the superiority of the Candle CCSK collection over prior works, and an extrinsic use case demonstrates the benefits of CCSK for the GPT-3 language model. Code and data can be accessed at https://candle.mpi-inf.mpg.de/.
Tuan-Phong Nguyen, Simon Razniewski, Aparna S. Varde, Gerhard Weikum
WWW1
2023 Refined Commonsense Knowledge From Large-Scale Web Contents
abstract
Commonsense knowledge (CSK) about concepts and their properties is helpful for AI applications. Prior works, such as ConceptNet, have compiled large CSK collections. However, they are restricted in their expressiveness to subject-predicate-object (SPO) triples with simple concepts for S and strings for P and O. This paper presents a method called ASCENT++ to automatically build a large-scale knowledge base (KB) of CSK assertions, with refined expressiveness and both better precision and recall than prior works. ASCENT++ goes beyond SPO triples by capturing composite concepts with subgroups and aspects, and by refining assertions with semantic facets. The latter is essential to express the temporal and spatial validity of assertions and further qualifiers. Furthermore, ASCENT++ combines open information extraction (OpenIE) with judicious cleaning and ranking by typicality and saliency scores. For high coverage, our method taps into the large-scale crawl C4 with broad web contents. The evaluation with human judgments shows the superior quality of the ASCENT++ KB, and an extrinsic evaluation for QA-support tasks underlines the benefits of ASCENT++. A web interface, data, and code can be accessed athttps:// ascentpp.mpi-inf.mpg.de/.
Tuan-Phong Nguyen, Simon Razniewski, Julien Romero, Gerhard Weikum
IEEE Trans. Knowl. Data Eng.1
2021 Advanced Semantics for Commonsense Knowledge Extraction
abstract
Commonsense knowledge (CSK) about concepts and their properties is useful for AI applications such as robust chatbots. Prior works like ConceptNet, TupleKB and others compiled large CSK collections, but are restricted in their expressiveness to subject-predicate-object (SPO) triples with simple concepts for S and monolithic strings for P and O. Also, these projects have either prioritized precision or recall, but hardly reconcile these complementary goals. This paper presents a methodology, called Ascent, to automatically build a large-scale knowledge base (KB) of CSK assertions, with advanced expressiveness and both better precision and recall than prior works. Ascent goes beyond triples by capturing composite concepts with subgroups and aspects, and by refining assertions with semantic facets. The latter are important to express temporal and spatial validity of assertions and further qualifiers. Ascent combines open information extraction with judicious cleaning using language models. Intrinsic evaluation shows the superior size and quality of the Ascent KB, and an extrinsic evaluation for QA-support tasks underlines the benefits of Ascent. A web interface, data and code can be found at https://www.mpi-inf.mpg.de/ascent.
Tuan-Phong Nguyen, Simon Razniewski, Gerhard Weikum
WWW1