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

Udit Sharma

dblp:96/892 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 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
1 paper
Question answering and dialogue systems · 87% Knowledge representation and reasoning · 13%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems
knowledge base question answering
0.712023
Best of Both Worlds: Towards Improving Temporal Knowledge Base Question Answering via Targeted Fact Extraction · EMNLP 2023
Natural language and speech › Question answering and dialogue systems › reasoning-based question answering
temporal question answering
0.712023
Best of Both Worlds: Towards Improving Temporal Knowledge Base Question Answering via Targeted Fact Extraction · EMNLP 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
fact extraction
0.212023
Best of Both Worlds: Towards Improving Temporal Knowledge Base Question Answering via Targeted Fact Extraction · EMNLP 2023

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

open-domain question answering · 0.7language model · 0.7
YearPublicationVenuePosition
2023 Best of Both Worlds: Towards Improving Temporal Knowledge Base Question Answering via Targeted Fact Extraction
abstract
Temporal question answering (QA) is a special category of complex question answering task that requires reasoning over facts asserting time intervals of events.Previous works have predominately relied on Knowledge Base Question Answering (KBQA) for temporal QA.One of the major challenges faced by these systems is their inability to retrieve all relevant facts due to factors such as incomplete KB and entity/relation linking errors (Patidar et al., 2022).A failure to fetch even a single fact will block KBQA from computing the answer.Such cases of KB incompleteness are even more profound in the temporal context.To address this issue, we explore an interesting direction where a targeted temporal fact extraction technique is used to assist KBQA whenever it fails to retrieve temporal facts from the KB.We model the extraction problem as an open-domain question answering task using offthe-shelf language models.This way, we target to extract from textual resources those facts that failed to get retrieved from the KB.Experimental results on two temporal QA benchmarks show promising ~30% & ~10% relative improvements in answer accuracies without any additional training cost.
Nithish Kannen, Udit Sharma, Sumit Neelam, Dinesh Khandelwal, Shajith Ikbal, Hima P. Karanam, L. Venkata Subramaniam
EMNLP2
2020 A sanitization approach for big data with improved data utility
Udit Sharma, Durga Toshniwal
Appl. Intell.1