Demo Data from VLDB 2026 / reviewers in the wild / expert
Weicheng Yu
dblp:218/6701
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2
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.
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 46% Data models and query languages · 23% Query processing and optimization · 23% | |
| Artificial intelligence
1 paper |
Information extraction and text analysis · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
fact-checking |
0.8 | 2 | 2019 | AggChecker: A Fact-Checking System for Text Summaries of Relational Data Sets · Proc. VLDB Endow. 2019 Verifying Text Summaries of Relational Data Sets · SIGMOD Conference 2019 |
Query processing and optimization
aggregate query processing |
0.4 | 1 | 2019 | AggChecker: A Fact-Checking System for Text Summaries of Relational Data Sets · Proc. VLDB Endow. 2019 |
Data models and query languages
natural language interface |
0.4 | 1 | 2019 | Verifying Text Summaries of Relational Data Sets · SIGMOD Conference 2019 |
Natural language and speech › Information extraction and text analysis › argument mining
claim detection |
0.1 | 1 | 2019 | Verifying Text Summaries of Relational Data Sets · SIGMOD Conference 2019 |
Data integration and cleaning
data quality |
0.1 | 1 | 2019 | AggChecker: A Fact-Checking System for Text Summaries of Relational Data Sets · Proc. VLDB Endow. 2019 |
Methods — techniques the papers use, named apart from their topics
result caching · 0.8query merging · 0.8probabilistic model · 0.8natural language processing · 0.4machine learning · 0.4information retrieval · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Verifying Text Summaries of Relational Data SetsabstractWe present a novel natural language query interface, the AggChecker, aimed at text summaries of relational data sets. The tool focuses on natural language claims that translate into an SQL query and a claimed query result. Similar in spirit to a spell checker, the AggChecker marks up text passages that seem to be inconsistent with the actual data. At the heart of the system is a probabilistic model that reasons about the input document in a holistic fashion. Based on claim keywords and the document structure, it maps each text claim to a probability distribution over associated query translations. By efficiently executing tens to hundreds of thousands of candidate translations for a typical input document, the system maps text claims to correctness probabilities. This process becomes practical via a specialized processing backend, avoiding redundant work via query merging and result caching. Verification is an interactive process in which users are shown tentative results, enabling them to take corrective actions if necessary. We tested our system on 53 publicly available articles containing 392 claims. Our tool revealed erroneous claims in roughly a third of test cases. Also, AggChecker compares favorably against several automated and semi-automated fact checking baselines. Saehan Jo, Immanuel Trummer, Weicheng Yu, Xuezhi Wang 0002, Cong Yu 0001, Daniel Liu, Niyati Mehta |
SIGMOD Conference | 3 |
| 2019 | AggChecker: A Fact-Checking System for Text Summaries of Relational Data SetsabstractWe demonstrate AggChecker, a novel tool for verifying textual summaries of relational data sets. The system automatically verifies natural language claims about numerical aggregates against the underlying raw data. The system incorporates a combination of natural language processing, information retrieval, machine learning, and efficient query processing strategies. Each claim is translated into a semantically equivalent SQL query and evaluated against the database. Our primary goal is analogous to that of a spell-checker: to identify erroneous claims and provide guidance in correcting them. In this demonstration, we show that our system enables users to verify text summaries much more efficiently than a standard SQL interface. Saehan Jo, Immanuel Trummer, Weicheng Yu, Xuezhi Wang 0002, Cong Yu 0001, Daniel Liu, Niyati Mehta |
Proc. VLDB Endow. | 3 |