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

Parag Jain

dblp:98/1178 · DBLP profile ↗
← Back
11ranked-venue papers
4as first author
5since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 9 · 4 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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
Language models and text generation · 34% Question answering and dialogue systems · 22% Information extraction and text analysis · 20%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation › structured generation
structured text generation
0.812024
STRUCTSUM Generation for Faster Text Comprehension · ACL (1) 2024
Natural language and speech › Information extraction and text analysis › natural language semantics › semantic interpretation
text comprehension
0.812024
STRUCTSUM Generation for Faster Text Comprehension · ACL (1) 2024
Computer vision › Segmentation and scene understanding
context modeling
0.712023
Conversational Semantic Parsing using Dynamic Context Graphs · EMNLP 2023
Natural language and speech › Question answering and dialogue systems › dialogue understanding
conversational semantic parsing
0.712023
Conversational Semantic Parsing using Dynamic Context Graphs · EMNLP 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
knowledge graph querying
0.712023
Conversational Semantic Parsing using Dynamic Context Graphs · EMNLP 2023
Natural language and speech › Question answering and dialogue systems › knowledge base question answering
logical form generation
0.712023
Conversational Semantic Parsing using Dynamic Context Graphs · EMNLP 2023
Natural language and speech › Language models and text generation
controllable text generation
0.412019
Unsupervised Controllable Text Formalization · AAAI 2019
Natural language and speech › Information extraction and text analysis
semantic parsing
0.412019
Unified Semantic Parsing with Weak Supervision · ACL (1) 2019
Natural language and speech › Language models and text generation › text generation
text simplification
0.412019
Unsupervised Neural Text Simplification · ACL (1) 2019
Natural language and speech › Language models and text generation › controllable text generation
text style transfer
0.412019
Unsupervised Controllable Text Formalization · AAAI 2019
Knowledge graphs
knowledge graph construction
0.312017
Creation and Interaction with Large-scale Domain-Specific Knowledge Bases · Proc. VLDB Endow. 2017
Machine learning › Deep learning architectures and training
encoder-decoder architecture
0.112019
Unsupervised Controllable Text Formalization · AAAI 2019
Natural language and speech › Language models and text generation
text generation
0.112019
Unsupervised Neural Text Simplification · ACL (1) 2019
Natural language and speech › Information extraction and text analysis
natural language query
0.112017
Creation and Interaction with Large-scale Domain-Specific Knowledge Bases · Proc. VLDB Endow. 2017

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

prompting strategies · 1.5large language model · 1.5AUTO-QA · 1.5encoder-decoder · 0.8graph neural network · 0.7dynamic context graph · 0.7weak supervision · 0.4scorers · 0.4reinforcement learning · 0.4multi-policy distillation · 0.4
YearPublicationVenuePosition
2024 STRUCTSUM Generation for Faster Text Comprehension
abstract
We consider the task of generating structured representations of text using large language models (LLMs).We focus on tables and mind maps as representative modalities.Tables are more organized way of representing data, while mind maps provide a visually dynamic and flexible approach, particularly suitable for sparse content.Despite the effectiveness of LLMs on different tasks, we show that current models struggle with generating structured outputs.In response, we present effective prompting strategies for both of these tasks.We introduce a taxonomy of problems around factuality, global and local structure, common to both modalities and propose a set of critiques to tackle these issues resulting in an absolute improvement in accuracy of +37pp (79%) for mind maps and +15pp (78%) for tables.To evaluate semantic coverage of generated structured representations we propose AUTO-QA, and we verify the adequacy of AUTO-QA using SQuAD dataset.We further evaluate the usefulness of structured representations via a text comprehension user study.The results show a significant reduction in comprehension time compared to text when using table (42.9%) and mind map (31.9%), without loss in accuracy.
Parag Jain, Andreea Marzoca, Francesco Piccinno
ACL (1)1
2023 Semantic Parsing for Conversational Question Answering over Knowledge Graphs
abstract
In this paper, we are interested in developing semantic parsers which understand natural language questions embedded in a conversation with a user and ground them to formal queries over definitions in a general purpose knowledge graph (KG) with very large vocabularies (covering thousands of concept names and relations, and millions of entities).To this end, we develop a dataset where user questions are annotated with SPARQL parses and system answers correspond to execution results thereof.We present two different semantic parsing approaches and highlight the challenges of the task: dealing with large vocabularies, modelling conversation context, predicting queries with multiple entities, and generalising to new questions at test time.We hope our dataset will serve as useful testbed for the development of conversational semantic parsers. 1
Laura Perez-Beltrachini, Parag Jain, Emilio Monti, Mirella Lapata
EACL2
2023 Conversational Semantic Parsing using Dynamic Context Graphs
abstract
In this paper we consider the task of conversational semantic parsing over general purpose knowledge graphs (KGs) with millions of entities, and thousands of relation-types.We focus on models which are capable of interactively mapping user utterances into executable logical forms (e.g., SPARQL) in the context of the conversational history.Our key idea is to represent information about an utterance and its context via a subgraph which is created dynamically, i.e., the number of nodes varies per utterance.Rather than treating the subgraph as a sequence, we exploit its underlying structure and encode it with a graph neural network which further allows us to represent a large number of (unseen) nodes.Experimental results show that dynamic context modeling is superior to static approaches, delivering performance improvements across the board (i.e., for simple and complex questions).Our results further confirm that modeling the structure of context is better at processing discourse information, (i.e., at handling ellipsis and resolving coreference) and longer interactions.
Parag Jain, Mirella Lapata
EMNLP1
2021 Evaluating Augmented Reality for Wireless Network Security Education
abstract
In this innovative practice full paper, we investigate the benefits of using an augmented reality (AR) application in wireless network security education. For this purpose, we design and implement an AR application which passively captures wireless network traffic and superimposes the otherwise imperceptible network packets on the camera image of sending and receiving devices. We perform a user-study with 25 participants, who are provided with a laptop which runs our application. Students are tasked to spot Evil Twin, Address-Resolution Protocol (ARP) Poisoning and Denial of Service (DoS) attacks launched on a 802.11 Wi-Fi network by observing it with the AR application. We find that students were able to spot and describe those attacks intuitively. From those results we conclude that an AR-based approach is a valuable addition to wireless network security laboratory courses. Additionally, our results indicate, that our application provides access to this complex topic even for users without a technical background. To the best of our knowledge, this is the first experimental study, which shows the beneficial effects of using AR in wireless network security education.
Martin Striegel, Jonas Erasmus, Parag Jain
FIE3
2021 Memory-Based Semantic Parsing
abstract
Abstract We present a memory-based model for context- dependent semantic parsing. Previous approaches focus on enabling the decoder to copy or modify the parse from the previous utterance, assuming there is a dependency between the current and previous parses. In this work, we propose to represent contextual information using an external memory. We learn a context memory controller that manages the memory by maintaining the cumulative meaning of sequential user utterances. We evaluate our approach on three semantic parsing benchmarks. Experimental results show that our model can better process context-dependent information and demonstrates improved performance without using task-specific decoders.
Parag Jain, Mirella Lapata
Trans. Assoc. Comput. Linguistics1
2019 Unsupervised Controllable Text Formalization
abstract
We propose a novel framework for controllable natural language transformation. Realizing that the requirement of parallel corpus is practically unsustainable for controllable generation tasks, an unsupervised training scheme is introduced. The crux of the framework is a deep neural encoder-decoder that is reinforced with text-transformation knowledge through auxiliary modules (called scorers). These scorers, based on off-the-shelf language processing tools, decide the learning scheme of the encoder-decoder based on its actions. We apply this framework for the text-transformation task of formalizing an input text by improving its readability grade; the degree of required formalization can be controlled by the user at run-time. Experiments on public datasets demonstrate the efficacy of our model towards: (a) transforming a given text to a more formal style, and (b) varying the amount of formalness in the output text based on the specified input control. Our code and datasets are released for academic use.
Parag Jain, Abhijit Mishra, Amar Prakash Azad, Karthik Sankaranarayanan
AAAI1
2019 Unified Semantic Parsing with Weak Supervision
abstract
Semantic parsing over multiple knowledge bases enables a parser to exploit structural similarities of programs across the multiple domains.However, the fundamental challenge lies in obtaining high-quality annotations of (utterance, program) pairs across various domains needed for training such models.To overcome this, we propose a novel framework to build a unified multi-domain enabled semantic parser trained only with weak supervision (denotations).Weakly supervised training is particularly arduous as the program search space grows exponentially in a multi-domain setting.To solve this, we incorporate a multipolicy distillation mechanism in which we first train domain-specific semantic parsers (teachers) using weak supervision in the absence of the ground truth programs, followed by training a single unified parser (student) from the domain specific policies obtained from these teachers.The resultant semantic parser is not only compact but also generalizes better, and generates more accurate programs.It further does not require the user to provide a domain label while querying.On the standard OVERNIGHT dataset (containing multiple domains), we demonstrate that the proposed model improves performance by 20% in terms of denotation accuracy in comparison to baseline techniques.
Priyanka Agrawal, Ayushi Dalmia, Parag Jain, Abhishek Bansal 0004, Ashish R. Mittal, Karthik Sankaranarayanan
ACL (1)3
2019 Unsupervised Neural Text Simplification
abstract
The paper presents a first attempt towards unsupervised neural text simplification that relies only on unlabeled text corpora.The core framework is composed of a shared encoder and a pair of attentional-decoders, crucially assisted by discrimination-based losses and denoising.The framework is trained using unlabeled text collected from en-Wikipedia dump.Our analysis (both quantitative and qualitative involving human evaluators) on public test data shows that the proposed model can perform text-simplification at both lexical and syntactic levels, competitive to existing supervised methods.It also outperforms viable unsupervised baselines.Adding a few labeled pairs helps improve the performance further.
Sai Surya, Abhijit Mishra, Anirban Laha, Parag Jain, Karthik Sankaranarayanan
ACL (1)4
2019 Scalable Micro-planned Generation of Discourse from Structured Data
abstract
We present a framework for generating natural language description from structured data such as tables; the problem comes under the category of data-to-text natural language generation (NLG). Modern data-to-text NLG systems typically use end-to-end statistical and neural architectures that learn from a limited amount of task-specific labeled data, and therefore exhibit limited scalability, domain-adaptability, and interpretability. Unlike these systems, ours is a modular, pipeline-based approach, and does not require task-specific parallel data. Rather, it relies on monolingual corpora and basic off-the-shelf NLP tools. This makes our system more scalable and easily adaptable to newer domains. Our system utilizes a three-staged pipeline that: (i) converts entries in the structured data to canonical form, (ii) generates simple sentences for each atomic entry in the canonicalized representation, and (iii) combines the sentences to produce a coherent, fluent, and adequate paragraph description through sentence compounding and co-reference replacement modules. Experiments on a benchmark mixed-domain data set curated for paragraph description from tables reveals the superiority of our system over existing data-to-text approaches. We also demonstrate the robustness of our system in accepting other popular data sets covering diverse data types such as knowledge graphs and key-value maps.
Anirban Laha, Parag Jain, Abhijit Mishra, Karthik Sankaranarayanan
Comput. Linguistics2
2018 Generating Descriptions from Structured Data Using a Bifocal Attention Mechanism and Gated Orthogonalization
abstract
Preksha Nema, Shreyas Shetty, Parag Jain, Anirban Laha, Karthik Sankaranarayanan, Mitesh M. Khapra. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). 2018.
Preksha Nema, Shreyas Shetty, Parag Jain, Anirban Laha, Karthik Sankaranarayanan, Mitesh M. Khapra
NAACL-HLT3
2017 Creation and Interaction with Large-scale Domain-Specific Knowledge Bases
abstract
The ability to create and interact with large-scale domain-specific knowledge bases from unstructured/semi-structured data is the foundation for many industry-focused cognitive systems. We will demonstrate the Content Services system that provides cloud services for creating and querying high-quality domain-specific knowledge bases by analyzing and integrating multiple (un/semi)structured content sources. We will showcase an instantiation of the system for a financial domain. We will also demonstrate both cross-lingual natural language queries and programmatic API calls for interacting with this knowledge base.
Shreyas Bharadwaj, Laura Chiticariu, Marina Danilevsky, Samarth Dhingra, Samved Divekar, Arnaldo Carreno-Fuentes, Nitin Gupta 0005, Sang-Don Han, Mauricio A. Hernández, C. T. Howard Ho, Parag Jain, Salil Joshi 0001, Hima P. Karanam, Saravanan Krishnan, Rajasekar Krishnamurthy, Yunyao Li 0001, Satishkumaar Manivannan, Ashish R. Mittal, Fatma Özcan 0001, Abdul Quamar, Poornima Chozhiyath Raman, Diptikalyan Saha, Karthik Sankaranarayanan, Jaydeep Sen, Prithviraj Sen, Shivakumar Vaithyanathan, Mitesh Vasa, Huaiyu Zhu 0001
Proc. VLDB Endow.12