Papers by Rajiv Jain
TIMERS: Document-level Temporal Relation Extraction (2021.acl-short)
Copied to clipboard
| Challenge: | Existing methods for temporal relation extraction focus on extracting temporal relations between event pairs present in the same sentence or adjacent sentences, mostly ignoring document-level pairs. |
| Approach: | They propose a TIME, Rhetorical and Syntactic-aware model for document-level temporal relation classification in the English language that leverages rhetorical discourse features and temporal arguments from semantic role labels. |
| Outcome: | The proposed model outperforms previous methods on the TDDiscourse, TimeBank-Dense, and MATRES datasets due to its discourse-level modeling. |
MACRONYM: A Large-Scale Dataset for Multilingual and Multi-Domain Acronym Extraction (2022.coling-1)
Copied to clipboard
Amir Pouran Ben Veyseh, Nicole Meister, Seunghyun Yoon, Rajiv Jain, Franck Dernoncourt, Thien Huu Nguyen
| Challenge: | Acronym extraction is the task of identifying acronyms and their expanded forms in texts . existing AE methods for English are limited to specific languages and domains . |
| Approach: | They propose to annotate 27,200 sentences in 6 different languages and 2 new domains for AE. |
| Outcome: | The proposed dataset shows that AE in different languages and learning settings has unique challenges . |
Towards Interpreting and Mitigating Shortcut Learning Behavior of NLU models (2021.naacl-main)
Copied to clipboard
Mengnan Du, Varun Manjunatha, Rajiv Jain, Ruchi Deshpande, Franck Dernoncourt, Jiuxiang Gu, Tong Sun, Xia Hu
| Challenge: | Recent studies indicate that NLU models are prone to rely on shortcut features for prediction, without achieving true language understanding. |
| Approach: | They propose a shortcut mitigation framework to suppress NLU models from making overconfident predictions for samples with large shortcut degree. |
| Outcome: | The proposed framework suppresses the model from making overconfident predictions for samples with large shortcut degree. |
DocScript: Document-level Script Event Prediction (2024.lrec-main)
Copied to clipboard
Puneet Mathur, Vlad I. Morariu, Aparna Garimella, Franck Dernoncourt, Jiuxiang Gu, Ramit Sawhney, Preslav Nakov, Dinesh Manocha, Rajiv Jain
| Challenge: | Existing script event prediction frameworks such as ChatGPT and FlanT5 lack the ability to learn long-range dependencies between events. |
| Approach: | They propose a novel script event prediction task which aims to predict the next event from a candidate list of narrative events in long-form documents. |
| Outcome: | The proposed architecture can learn sequential ordering between events at the document scale. |
Keyphrase Prediction from Video Transcripts: New Dataset and Directions (2022.coling-1)
Copied to clipboard
Amir Pouran Ben Veyseh, Quan Hung Tran, Seunghyun Yoon, Varun Manjunatha, Hanieh Deilamsalehy, Rajiv Jain, Trung Bui, Walter W. Chang, Franck Dernoncourt, Thien Huu Nguyen
| Challenge: | Existing studies on keyphrase prediction have focused on formal texts and informal-text domains. |
| Approach: | They propose to annotate large-scale video transcripts with keyphrases from live-stream video . they propose to feed models with paragraph-level keyphrase extraction to foster future research . |
| Outcome: | The proposed model improves keyphrase prediction in live-stream video transcripts by feeding models with paragraph-level keyphrases. |
Syntopical Graphs for Computational Argumentation Tasks (2021.acl-long)
Copied to clipboard
Joe Barrow, Rajiv Jain, Nedim Lipka, Franck Dernoncourt, Vlad Morariu, Varun Manjunatha, Douglas Oard, Philip Resnik, Henning Wachsmuth
| Challenge: | adler and van Doren (1940) proposed a formalized manual process for understanding a topic based on multiple viewpoints. |
| Approach: | They propose a syntopical reading process that emphasizes comparing and contrasting viewpoints to improve topic understanding. |
| Outcome: | The proposed method outperforms approaches that do not use collection-level information. |
DocTime: A Document-level Temporal Dependency Graph Parser (2022.naacl-main)
Copied to clipboard
Puneet Mathur, Vlad Morariu, Verena Kaynig-Fittkau, Jiuxiang Gu, Franck Dernoncourt, Quan Tran, Ani Nenkova, Dinesh Manocha, Rajiv Jain
| Challenge: | Document dependency graphs (TDGs) are used to understand the temporal relations between events mentioned in a document and to improve downstream tasks such as timeline creation and time-aware summarization. |
| Approach: | They propose a temporal dependency graph parser that takes input from a text document and produces a graph that incorporates longer range dependencies. |
| Outcome: | The proposed framework outperforms existing models on three datasets and improves tasks such as timeline creation, time-aware summarization, and temporal information extraction. |
Chain of Logic: Rule-Based Reasoning with Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Logic models are prone to hallucinations and are not able to perform basic tasks like drafting and drafting documents. |
| Approach: | They propose a new prompting method which elicits rule-based reasoning through decomposition and recomposition. |
| Outcome: | The proposed method outperforms other prompting methods including chain of thought and self-ask on eight rule-based reasoning tasks. |
Unveiling Inherent Visual Grounding in Multimodal LLMs for Text-Rich Images (2026.findings-acl)
Copied to clipboard
Shijie Zhou, Jihyung Kil, Ming Li, Jiuxiang Gu, Curtis Wigington, Rajiv Jain, Changyou Chen, Ruiyi Zhang
| Challenge: | Existing multimodal large language model (MLLM) approaches struggle to align query tokens with visual–text patches, heavily relying on lengthy OCR inputs. |
| Approach: | They propose an OCR-free approach that leverages the MLLM's inherent multi-head attention for multi-patch grounding. |
| Outcome: | Empirical results show that the proposed approach outperforms existing approaches on challenging document grounding benchmarks. |
DocEdit-v2: Document Structure Editing Via Multimodal LLM Grounding (2024.emnlp-main)
Copied to clipboard
Manan Suri, Puneet Mathur, Franck Dernoncourt, Rajiv Jain, Vlad Morariu, Ramit Sawhney, Preslav Nakov, Dinesh Manocha
| Challenge: | Document structure editing involves manipulating localized textual, visual, and layout components in document images based on user’s requests. |
| Approach: | They propose a framework that performs end-to-end document editing by leveraging Large Multimodal Models (LMMs) by localizing edit regions of interest and disambiguating user edit requests into edit commands. |
| Outcome: | The proposed framework outperforms baselines on edit command generation (2-33%), RoI bounding box detection (12-31%), and overall document editing (1-12%) tasks. |
A Joint Model for Document Segmentation and Segment Labeling (2020.acl-main)
Copied to clipboard
| Challenge: | Existing approaches to text segmentation focus on document segmentation and segment labeling separately. |
| Approach: | They propose a method for jointly segmenting a document and labeling segments . they show that S-LSTM reduces segmentation error by 30% on average . |
| Outcome: | The proposed method reduces segmentation error by 30% while improving segment labeling. |
Self-Cleaning: Improving a Named Entity Recognizer Trained on Noisy Data with a Few Clean Instances (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods to train named entity recognition models on noisy data are expensive and time-intensive to accumulate. |
| Approach: | They propose to denoise noisy NER data with guidance from a small set of clean instances. |
| Outcome: | The proposed method can improve on large-scale datasets with a small guidance set. |
LegalCore: A Dataset for Event Coreference Resolution in Legal Documents (2025.findings-acl)
Copied to clipboard
Kangda Wei, Xi Shi, Jonathan Tong, null Sai Ramana Reddy, Anandhavelu Natarajan, Rajiv Jain, Aparna Garimella, Ruihong Huang
| Challenge: | Existing research on event coreference resolution is limited to news articles . existing datasets for news articles are limited to events and coreferences . |
| Approach: | They present a dataset for the legal domain LegalCore which has been annotated with event and event coreference information. |
| Outcome: | The legal contract documents annotated in this dataset are several times longer than news articles, with an average length of around 25k tokens per document. |
OpenExempt: A Diagnostic Benchmark for Legal Reasoning and a Framework for Creating Custom Benchmarks on Demand (2026.findings-acl)
Copied to clipboard
| Challenge: | Reasoning benchmarks are expensive to build and ill suited for isolating specific failure modes. |
| Approach: | They propose a framework and benchmark for diagnostic evaluation of legal reasoning that uses symbolic representations of U.S. Bankruptcy Code statutes to generate large space of reasoning tasks and their machine-computable solutions on demand. |
| Outcome: | The proposed framework and benchmark provides diagnostic insights into the competencies and failure modes of language models. |
IGA: An Intent-Guided Authoring Assistant (2021.emnlp-main)
Copied to clipboard
Simeng Sun, Wenlong Zhao, Varun Manjunatha, Rajiv Jain, Vlad Morariu, Franck Dernoncourt, Balaji Vasan Srinivasan, Mohit Iyyer
| Challenge: | Pretrained language models have improved writing assistance functions such as autocomplete, but more complex and controllable writing assistants have yet to be explored. |
| Approach: | They build an intent-guided authoring assistant that follows fine-grained author directives by specifying different writing intents. |
| Outcome: | The proposed system generates output satisfying the author's intent and can be rephrased to their liking. |
ClauseRec: A Clause Recommendation Framework for AI-aided Contract Authoring (2021.emnlp-main)
Copied to clipboard
| Challenge: | Contracts are a common type of legal document that frequent in business workflows, but there has been limited NLP research in understanding and generating them. |
| Approach: | They propose a task of clause recommendation to help automate contract authoring . they first predict if a specific clause type is relevant to be added in a contract . then they propose two-staged pipeline to recommend top clauses based on the contract context . |
| Outcome: | The proposed pipeline predicts if a clause type is relevant to be added in a contract and recommends the top clauses for the given type based on the contract context. |