Papers with F1
MoNaCo: More Natural and Complex Questions for Reasoning Across Dozens of Documents (2026.tacl-1)
Copied to clipboard
Tomer Wolfson, Harsh Trivedi, Mor Geva, Yoav Goldberg, Dan Roth, Tushar Khot, Ashish Sabharwal, Reut Tsarfaty
| Challenge: | Automated agents powered by large language models are becoming more ingrained into how people seek information . but evaluation benchmarks for LLMs rarely feature natural questions that are time-consuming . a new benchmark, MoNaCo, aims to address this gap by eliciting and manually answering time-wasting questions . |
| Approach: | They propose a benchmark of 1,315 natural and time-consuming questions that require dozens of intermediate steps to solve. |
| Outcome: | MoNaCo benchmarks achieve at least 61.2% F1 in real-world time-consuming questions hampered by low recall and hallucinations . Frontier LLMs evaluated on MoN achieving at least 61% F1, harmed by low memory and halluzinations. |
Joint Bootstrapping Machines for High Confidence Relation Extraction (N18-1)
Copied to clipboard
| Challenge: | Existing semi-supervised bootstrapping methods for relationship extraction lack labeled data. |
| Approach: | They propose a semi-supervised bootstrapping method that protects against semantic drift . they expand entities and templates in parallel and in mutually constraining fashion in each iteration . |
| Outcome: | Experimental results show that BREX improves on state-of-the-art methods for four relationships. |
On the Role of Negative Precedent in Legal Outcome Prediction (2023.tacl-1)
Copied to clipboard
| Challenge: | Legal outcome prediction is an increasingly popular task in AI. |
| Approach: | They propose to use the dynamics of a court process to develop two new models inspired by the dynamics. |
| Outcome: | The proposed model improves positive outcome prediction score to 77.15 F1 and doubles negative outcome prediction performance to 24.01 F1. |
A Generalized Knowledge Hunting Framework for the Winograd Schema Challenge (N18-4)
Copied to clipboard
| Challenge: | a new system that performs well on common-sense reasoning tasks is developed . the Winograd Schema Challenge (WSC) is a popular alternative to the Turing test . |
| Approach: | They propose an automatic system that performs well on two common-sense reasoning tasks. |
| Outcome: | The proposed system improves performance on the Winograd Schema Challenge and COPA by 0.16 over the previous best. |
Salient Information Prompting to Steer Content in Prompt-based Abstractive Summarization (2024.emnlp-industry)
Copied to clipboard
| Challenge: | Existing approaches to generate concise summarizations require extensive modifications to the architecture. |
| Approach: | They propose a lightweight model that can be finetuned to extract salient keyphrases from the source document to enhance ROUGE F1 and recall. |
| Outcome: | The proposed model can be finetuned to extract salient keyphrases without any LLM customization. |
SpanBERT: Improving Pre-training by Representing and Predicting Spans (2020.tacl-1)
Copied to clipboard
| Challenge: | Pre-training methods like BERT mask individual words or subword units, but many tasks involve reasoning about relationships between two or more spans of text. |
| Approach: | They propose a pre-training method that masks contiguous random spans instead of random tokens to train the span boundary representations to predict the entire content of the masked span. |
| Outcome: | The proposed method outperforms BERT and its better-tuned baselines on span selection tasks and on coreference resolution tasks. |
Canine: Pre-training an Efficient Tokenization-Free Encoder for Language Representation (2022.tacl-1)
Copied to clipboard
| Challenge: | End-to-end neural models have replaced the traditional pipeline and require an explicit tokenization step. |
| Approach: | They propose a neural encoder that operates directly on character sequences without explicit tokenization or vocabulary and a pre-training strategy that optionally uses subwords as a soft inductive bias. |
| Outcome: | The proposed model outperforms a comparable mBert model on a multilingual benchmark by 5.7 F1 on the TyDi QA benchmark. |
ARES: A Reading Comprehension Ensembling Service (2020.emnlp-demos)
Copied to clipboard
Anthony Ferritto, Lin Pan, Rishav Chakravarti, Salim Roukos, Radu Florian, J. William Murdock, Avi Sil
| Challenge: | ARES is a machine reading comprehension (MRC) demonstration system which utilizes an ensemble of models to increase F1 by 2.3 points. |
| Approach: | They propose a machine reading comprehension (MRC) demonstration system which utilizes an ensemble of models to increase F1 by 2.3 points. |
| Outcome: | The proposed system increases F1 by 2.3 points on a short answer task using an ensemble of models. |
Reasoning Over Paragraph Effects in Situations (D19-58)
Copied to clipboard
| Challenge: | a key component of reading a passage is the ability to apply knowledge gained from the passage to a new situation. |
| Approach: | They propose a benchmark for reading comprehension targeting Reasoning Over Paragraph Effects in Situations. |
| Outcome: | The proposed model performs slightly better than randomly guessing an answer of the correct type, but is below the human performance of 89.0%. |
Distance-Free Modeling of Multi-Predicate Interactions in End-to-End Japanese Predicate-Argument Structure Analysis (C18-1)
Copied to clipboard
| Challenge: | Existing models for analyzing PASs in Japanese are lacking in identifying elliptical arguments. |
| Approach: | They propose to extend the input and last layers of a bidirectional recurrent neural network model to capture the potential interactions among multiple PASs. |
| Outcome: | The proposed models improve prediction accuracy on a benchmark corpus and achieve state-of-the-art on standardized corpus. |
Towards building a Robust Industry-scale Question Answering System (2020.coling-industry)
Copied to clipboard
| Challenge: | Existing systems that use “zero-shot transfer learning” (ZSTL) are difficult to train and have observation biases. |
| Approach: | They propose a production model called GAAMA which has two characteristics . it is robust and efficient, and trains on the recently introduced Natural Questions dataset . |
| Outcome: | The proposed model performs on two benchmarks: BioASQ and CovidQA. |
FLEEK: Factual Error Detection and Correction with Evidence Retrieved from External Knowledge (2023.emnlp-demo)
Copied to clipboard
Farima Fatahi Bayat, Kun Qian, Benjamin Han, Yisi Sang, Anton Belyy, Samira Khorshidi, Fei Wu, Ihab Ilyas, Yunyao Li
| Challenge: | Existing large language models (LLMs) have a tendency to hallucinate and provide creative and fluent responses that are not factually accurate. |
| Approach: | They propose a tool that automatically extracts factual claims from text, gathers evidence from external knowledge sources, evaluates the factuality of each claim, and suggests revisions for identified errors. |
| Outcome: | The proposed tool detects errors in text and evaluates their factuality and suggests revisions based on the collected evidence. |
Hierarchical Text Classification with LLM-Refined Taxonomies (2026.eacl-long)
Copied to clipboard
| Challenge: | Hierarchical text classification (HTC) relies on taxonomies that organize labels into structured hierarchies, but many real-world taxonomies introduce ambiguities, such as identical leaf names under similar parent nodes, which prevent language models from learning clear decision boundaries. |
| Approach: | They propose a framework that uses large language models to transform entire taxonomies through operations such as renaming, merging, splitting, and reordering to better match the semantics encoded by LMs. |
| Outcome: | The proposed framework outperforms human-curated taxonomies in three HTC benchmarks and shows that it aligns better with the model's actual confusion patterns. |
Impact of Training Instance Selection on Domain-Specific Entity Extraction using BERT (2022.naacl-srw)
Copied to clipboard
| Challenge: | Named entity recognition (NER) tasks require a large number of training examples and handcrafted features. |
| Approach: | They propose to fine-tune pre-trained language models such as BERT to achieve up to 80% F1 when fine- tuned on only 70 training examples. |
| Outcome: | The proposed model achieves 80% F1 when fine-tuned on only 70 training examples, especially on biomedical domain. |
Do Multi-hop Readers Dream of Reasoning Chains? (D19-58)
Copied to clipboard
| Challenge: | Existing models for multihop reasoning are limited in their performance . multi-hop reasoning requires the ability to gather information from multiple passages . |
| Approach: | They propose a method that provides the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
| Outcome: | The proposed model improves on existing models by providing the full reasoning chain of multiple passages instead of just one final passage where the answer appears. |
Predicting the Outcome of Deliberative Democracy: A Research Proposal (P19-2)
Copied to clipboard
| Challenge: | Deliberative dialogue is a structured, face-to-face method of public interaction that is fundamental to the concept of deliberative democracy. |
| Approach: | They propose to use a combination of lexical, sentiment, durational and further ‘derivative’ features of adjacency pairs to train traditional classification models. |
| Outcome: | The proposed method improves the accuracy of classification models and prediction tasks and shows that the task of recognising agreement is demanding but possible. |
Acoustic-Prosodic and Lexical Cues to Deception and Trust: Deciphering How People Detect Lies (2020.tacl-1)
Copied to clipboard
| Challenge: | LieCatcher collects ratings of perceived deception using corpus of deceptive and truthful interviews . acoustic-prosodic and linguistic characteristics of language trusted and mistrusted are not reliable cues . |
| Approach: | They used a game framework to collect ratings of perceived deception using deceptive and truthful interviews to understand how perception aligns with reality. |
| Outcome: | The proposed framework detects deception using a corpus of deceptive and truthful interviews. |
Dr. Livingstone, I presume? Polishing of foreign character identification in literary texts (2022.naacl-srw)
Copied to clipboard
| Challenge: | Current state-of-the-art models that use neural networks can help with character identification in agglutinative languages. |
| Approach: | They propose to use a search for the shortest version of the name to identify the baseform of the character's lemma to align different appearances of the same character in the narrative. |
| Outcome: | The proposed method is the easiest, best performing and resource-independent method. |
Retrieval Enhanced Data Augmentation for Question Answering on Privacy Policies (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing labeled datasets are heavily imbalanced, limiting the QA performance in this domain. |
| Approach: | They propose a question answering task that captures relevant text segments from unlabeled policy documents and expands the positive examples in the training set. |
| Outcome: | The proposed framework elevates the baseline by a large margin (10% F1) and achieves a new state-of-the-art F1 score of 50%. |
Multi-step Entity-centric Information Retrieval for Multi-Hop Question Answering (D19-58)
Copied to clipboard
Rajarshi Das, Ameya Godbole, Dilip Kavarthapu, Zhiyu Gong, Abhishek Singhal, Mo Yu, Xiaoxiao Guo, Tian Gao, Hamed Zamani, Manzil Zaheer, Andrew McCallum
| Challenge: | Multi-hop question answering (QA) requires an information retrieval system that can find multiple supporting evidence needed to answer the question. |
| Approach: | They propose a technique that uses information of entities present in the initial retrieved evidence to learn to ‘hop’ onto other relevant evidence. |
| Outcome: | The proposed method boosts retrieval performance on a multi-hop question answering dataset with 5 million Wikipedia paragraphs and a model without training increases its performance by 10.59 F1. |
Evaluating Question Answering Evaluation (D19-58)
Copied to clipboard
| Challenge: | Existing n-gram based QA metrics have a number of drawbacks and are not suitable for all extractive tasks. |
| Approach: | They propose to use BERTScore to evaluate translation for question answering (QA) they also explore whether existing n-gram based metrics are suitable for generative QA . |
| Outcome: | The proposed BERTScore metric fails to provide stronger correlation with human judgements . |
Recognizing UMLS Semantic Types with Deep Learning (D19-62)
Copied to clipboard
Isar Nejadgholi, Kathleen C. Fraser, Berry De Bruijn, Muqun Li, Astha LaPlante, Khaldoun Zine El Abidine
| Challenge: | Entity recognition is a critical first step to a number of clinical NLP applications, such as entity linking and relation extraction. |
| Approach: | They propose to use general and domain-specific information to combine general and specific information to create a new entity recognition method. |
| Outcome: | The proposed method produces a state-of-the-art result on a newly released dataset, MedMentions. |
Understanding BERT performance in propaganda analysis (D19-50)
Copied to clipboard
| Challenge: | Despite the challenging nature of the shared task, our pretrained BERT model scored 0.62 F1 on the test set and ranked third among 25 teams who participated in the contest. |
| Approach: | They propose to use a dataset to fine-tune a model for propaganda analysis at sentence level to determine whether a text is 'propaganda' and to examine false-positive cases. |
| Outcome: | The proposed model scored 0.62 F1 on the test set and ranked third among 25 teams who participated in the shared task. |
Tomayto, Tomahto. Beyond Token-level Answer Equivalence for Question Answering Evaluation (2022.emnlp-main)
Copied to clipboard
| Challenge: | despite the importance of question answering, evaluations of QA systems are typically limited by manual annotations . despite this, little progress has been made in QA evaluations based on a single answer . |
| Approach: | They propose to extend over exact match (EM) with predefined rules or token-level F1 measure . they propose to use a BERT matching measure to approximate QA predictions . |
| Outcome: | The proposed model improves AE approximations and more accurately reflects the performance of systems. |
An Improved Baseline for Sentence-level Relation Extraction (2022.aacl-short)
Copied to clipboard
| Challenge: | Sentence-level relation extraction (RE) aims at identifying the relationship between two entities in a sentence. |
| Approach: | They propose to improve sentence-level relation extraction by adding entity representations with typed markers to the model. |
| Outcome: | The proposed model outperforms existing methods on entity representation and noisy labels on TACRED dataset. |
TMR: Evaluating NER Recall on Tough Mentions (2021.eacl-srw)
Copied to clipboard
| Challenge: | a NER evaluation tool is available via a repository. |
| Approach: | They propose to use Tough Mentions Recall to supplement traditional named entity recognition evaluation by examining recall on specific subsets of ”tough” mentions. |
| Outcome: | The proposed metrics enable differentiation between otherwise similar-scoring systems and identify patterns in performance that would go unnoticed from overall precision, recall, and F1. |
Analogical Structure, Minimal Contextual Cues and Contrastive Distractors: Input Design for Sample-Efficient Linguistic Rule Induction (2026.eacl-long)
Copied to clipboard
| Challenge: | Recent systems that use analogical reasoning require extensive knowledge engineering and even transformer-based models show inconsistent results across complexity levels. |
| Approach: | They propose to implement analogical structure, contrastive learning, and minimal contextual cue principles into large language models that train on English verb alternations. |
| Outcome: | The proposed models learn the alternation rules with high F1 on English verb alternations. |
Retrieval-Enhanced Dual Encoder Training for Product Matching (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Recent work has proposed a dual encoder for product matching due to its high performance and computation efficiency. |
| Approach: | They propose retrieval-enhanced dual encoder training to improve product matching . they use public and real-world product matching datasets to train the dual encoded model . |
| Outcome: | The proposed approach improves on a public and real-world product matching datasets. |
A Stylometric Inquiry into Hyperpartisan and Fake News (P18-1)
Copied to clipboard
| Challenge: | a style analysis of hyperpartisan news and fake news can distinguish them from mainstream news . left-wing and right-wing news share significantly more stylistic similarities than mainstream news does . |
| Approach: | a comparative style analysis of hyperpartisan news and fake news is carried out . authors show that left-wing and right-wing news share significantly more stylistic similarities . |
| Outcome: | a style analysis can distinguish hyperpartisan news from mainstream, satire from both . left-wing and right-wing news share significantly more stylistic similarities than mainstream . |
Semantic Role Labeling of NomBank Partitives (2025.coling-main)
Copied to clipboard
| Challenge: | Semantic role labeling (SRL) is a way to represent semantic concepts via labeled predicate/argument pairs. |
| Approach: | They describe a semantic role labeling task that uses a set of predicate/argument pairs to represent semantic concepts. |
| Outcome: | The highest scoring system achieves an F1 of 91.74% using “gold” parses from the Penn Treebank and 91.12% when using the Berkeley Neural parser. |
What Is Overlap Knowledge in Event Argument Extraction? APE: A Cross-datasets Transfer Learning Model for EAE (2023.acl-long)
Copied to clipboard
| Challenge: | Existing approaches ignore the overlap knowledge across datasets, preventing models from achieving better performance. |
| Approach: | They propose to divide the EAE knowledge into overlap knowledge across datasets and specific knowledge of the target dataset. |
| Outcome: | The proposed model outperforms the baseline model with a large margin when only ten records are available in the target dataset. |
ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking (2022.naacl-industry)
Copied to clipboard
| Challenge: | Entity linking is the task of recognising mentions of entities in unstructured text documents and linking them to the corresponding entities in a Knowledge Base (KB) the largest public EL dataset is Wikipedia, which covers just 3% of the entities in Wikidata. |
| Approach: | They propose a model which performs mention detection, fine-grained entity typing, and entity disambiguation for all mentions within a document in a single forward pass. |
| Outcome: | The proposed model outperforms state-of-the-art methods on standard datasets by an average of 3.7 F1 and can generalise to large-scale knowledge bases such as Wikidata and zero-shot entity linking. |
Low-Resource Name Tagging Learned with Weakly Labeled Data (D19-1)
Copied to clipboard
| Challenge: | Existing methods for name tagging in low-resource languages or domains require extensive human efforts for training annotations. |
| Approach: | They propose a neural model for name tagging based on weakly labeled (WL) data. |
| Outcome: | The proposed model outperforms existing models in five low-resource languages and fine-grained food domains and shows that it is more efficient and efficient than existing models. |
TSTR: Too Short to Represent, Summarize with Details! Intro-Guided Extended Summary Generation (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for extractive and abstract summarization are limited to short abstracts . however, extended summaries provide detailed information beyond coarse information . |
| Approach: | They propose an extractive summarization tool that utilizes the introductory information of documents as pointers to their salient information. |
| Outcome: | The proposed extractive summarization improves on existing datasets with human-written summaries . the proposed summarizing improves in terms of cohesion and completeness compared to baselines and state-of-the-art . |
NER-MQMRC: Formulating Named Entity Recognition as Multi Question Machine Reading Comprehension (2022.naacl-industry)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a task of locating and classifying entities mentioned in unstructured text into predefined categories. |
| Approach: | They propose to use a BERT-based multi-question MRC task where multiple questions (one question per entity) are considered at the same time for a single text. |
| Outcome: | The proposed architecture leads to 2.5 times faster training and 2.3 times faster inference on three NER datasets. |
Event-Event Relation Extraction using Probabilistic Box Embedding (2022.acl-short)
Copied to clipboard
| Challenge: | Existing frameworks of event relation extraction do not guarantee coherence between different relation types, such as anti-symmetry. |
| Approach: | They propose to modify existing ERE framework to guarantee coherence by representing each event as a box representation without applying explicit constraints. |
| Outcome: | The proposed model shows stronger conjunctive constraint satisfaction compared to previous models with constraint injection. |
TopiOCQA: Open-domain Conversational Question Answering with Topic Switching (2022.tacl-1)
Copied to clipboard
| Challenge: | Current datasets for conversational question answering do not contain topic switches . people often engage in information-seeking conversations to discover new knowledge . |
| Approach: | They propose an open-domain conversational dataset with topic switches based on Wikipedia. |
| Outcome: | The proposed dataset achieves an F1 of 55.8, falling short of human performance by 14.2 points, indicating the difficulty of the dataset. |
Pointing to Subwords for Generating Function Names in Source Code (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods for generating function names from source code face difficulties in generating low-frequency or out-of-vocabulary subwords. |
| Approach: | They propose two strategies for copying low-frequency or out-of-vocabulary subwords in inputs. |
| Outcome: | The proposed method improves on the Java-small and Java-large datasets and improves the existing method on the GitHub platform. |
Sentence-Incremental Neural Coreference Resolution (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing systems for identifying spans as mentions are based on mention-pair formulations, but they are not generalized beyond pronouns. |
| Approach: | They propose a sentence-incremental neural coreference resolution system which incrementally builds clusters after marking mention boundaries in a shift-reduce method. |
| Outcome: | The proposed system outperforms state-of-the-art methods on OntoNotes and CODI-CRAC 2021 datasets and is comparable to state- of-the art methods. |
Developing a Production System for Purpose of Call Detection in Business Phone Conversations (2022.naacl-industry)
Copied to clipboard
| Challenge: | a commercial system detects Purpose of Call statements in call transcripts . the model is based on a set of rules and a neural model . |
| Approach: | They propose a system to detect Purpose of Call statements in English business call transcripts in real time. |
| Outcome: | The proposed model achieves 88.6 F1 on average in various types of business calls and has low inference time. |
An Exploration of Data Augmentation and Sampling Techniques for Domain-Agnostic Question Answering (D19-58)
Copied to clipboard
| Challenge: | XLNet model is domain-agnostic for the MRQA 2019 Shared Task . a negative sampling technique is particularly effective for datasets that include unanswerable questions . |
| Approach: | They develop a domain-agnostic question answering model for the MRQA 2019 Shared Task . they use large pre-trained language models, various data sampling strategies and query and context paraphrases generated by back-translation . |
| Outcome: | The proposed model achieves second best Exact Match and F1 in the MRQA leaderboard competition. |
CEREC: A Corpus for Entity Resolution in Email Conversations (2020.coling-main)
Copied to clipboard
| Challenge: | e-mail corpus for entity resolution in email conversations is first large scale annotated corpus . ecc is a two-step process with minimal manual effort. |
| Approach: | They present the first large scale corpus for entity resolution in email conversations . they use 6001 email threads and 38,996 entity coreference chains to construct the corpus . |
| Outcome: | The proposed corpus is the first large scale annotated corpus for entity resolution in email conversations. |
Debiasing Logical Fallacy Detection for Real-World Robustness via Counterfactually Augmented Data (2026.acl-srw)
Copied to clipboard
| Challenge: | Logical fallacy detection models often over-flag valid reasoning due to spurious correlations. |
| Approach: | They propose to augment CAD models with counterfactually-augmented data to debias them . they found that the models often over-flag valid reasoning due to spurious correlations . |
| Outcome: | The proposed approach reduces false positive rate by 58% on a 300-sample set. |
Causal Reasoning of Entities and Events in Procedural Texts (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing work on entity state tracking or event reasoning is limited to procedural texts. |
| Approach: | They propose a benchmark for causal reasoning of event plausibility and entity states . they represent entities as programming languages while prompting language models . |
| Outcome: | The proposed model outperforms existing models on human reasoning and event reasoning. |
♫ MuSiQue: Multihop Questions via Single-hop Question Composition (2022.tacl-1)
Copied to clipboard
| Challenge: | Existing multihop reasoning benchmarks are largely solvable via shortcuts . a bottom–up approach allows us to create a multihop QA dataset that requires proper multihop thinking. |
| Approach: | They propose a bottom–up approach that selects composable pairs of single-hop questions that are connected and adds stringent filters to the construction process. |
| Outcome: | The proposed approach creates a multihop question answering dataset with 25K 2–4 hop questions. |
Question Decomposition for Retrieval-Augmented Generation (2025.acl-srw)
Copied to clipboard
| Challenge: | Retrieval-augmented generation (RAG) is effective for question answering tasks . multi-hop questions, such as "Which company among NVIDIA, Apple, and Google made the biggest profit in 2023?" challenge RAG because relevant facts are often distributed across multiple documents . |
| Approach: | They propose a pipeline that incorporates question decomposition to ground large language models in verifiable external sources. |
| Outcome: | The proposed approach improves retrieval and answer accuracy over standard RAG . multi-hop questions often require multiple documents to support the model . |
CroAno : A Crowd Annotation Platform for Improving Label Consistency of Chinese NER Dataset (2021.emnlp-demo)
Copied to clipboard
Baoli Zhang, Zhucong Li, Zhen Gan, Yubo Chen, Jing Wan, Kang Liu, Jun Zhao, Shengping Liu, Yafei Shi
| Challenge: | Existing crowd annotation tools for named entity recognition (NER) focus on efficiency and don't consider consistency of datasets. |
| Approach: | They propose a crowd annotation platform for Chinese named entity recognition (NER) CroAno provides a systematic solution for improving label consistency of Chinese NER datasets. |
| Outcome: | The proposed platform improves label consistency of Chinese NER datasets. |
CASPER: Bridging Discrete and Continuous Prompt Optimization through Feedback-Guided Gradient Descent (2026.eacl-industry)
Copied to clipboard
| Challenge: | Existing pipelines for generative tasks require extensive manual effort and domain expertise to achieve task-optimal performance. |
| Approach: | They propose a framework bridging discrete and continuous prompt optimization through feedback-guided gradient descent in embedding space. |
| Outcome: | The proposed framework bridges discrete and continuous prompt optimization through feedback-guided gradient descent in embedding space. |
Contextual ASR Error Handling with LLMs Augmentation for Goal-Oriented Conversational AI (2025.coling-industry)
Copied to clipboard
Yuya Asano, Sabit Hassan, Paras Sharma, Anthony B. Sicilia, Katherine Atwell, Diane Litman, Malihe Alikhani
| Challenge: | Existing ASR correction methods rely on prior user data or named entities . Existing methods based on prior data are not available for goal-oriented dialogues . |
| Approach: | They propose a method that integrates contextual information from the dialogue states of a goal-oriented conversational AI and its tasks into a large language model. |
| Outcome: | The proposed method improves recall and F1 of correction by 34% and 16% while maintaining precision and false positive rate. |
Literature-Augmented Clinical Outcome Prediction (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to clinical outcome prediction use only clinical notes and general biomedical literature. |
| Approach: | They propose to retrieve patient-specific medical literature and incorporate it into predictive models by combining clinical notes with language models. |
| Outcome: | The proposed approach boosts predictive performance on three important clinical tasks in comparison to strong LM baselines, increasing F1 by up to 5 points and precision@Top-K by a large margin of over 25%. |
BERT Goes Off-Topic: Investigating the Domain Transfer Challenge using Genre Classification (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Pretrained language models have improved performance of text classification tasks, but they still suffer from spurious domain-specific clues. |
| Approach: | They propose a method to augment pretrained language models by generating texts in any desired genre and on any desired topic. |
| Outcome: | The proposed method improves on genre classification tasks while showing no improvement for other topics. |
NEST: Nested Evidence Survival for Retrieval (2026.acl-industry)
Copied to clipboard
| Challenge: | Existing approaches to retrieval-augmented generation (RAG) rely on rigid heuristics or computational overhead. |
| Approach: | They propose a lightweight, training-free RAG framework that separates recall amplification from precision selection. |
| Outcome: | Evaluated on WebQuestions, HotpotQA and internalQA benchmarks, NEST outperforms strong adaptive RAG baselines. |
EDM3: Event Detection as Multi-task Text Generation (2024.starsem-1)
Copied to clipboard
| Challenge: | Existing methods for Event Detection (ED) cannot easily leverage pre-trained semantic knowledge. |
| Approach: | They propose to decompose and reformulate ED and fine-tune over its atomic subtasks to enhance knowledge transfer while mitigating prediction error propagation inherent in pipelined approaches. |
| Outcome: | The proposed method achieves state-of-the-art performance on RAMS, MAVEN, and MLEE, while achieving 90% accuracy over rare event types. |
Leveraging HTML in Free Text Web Named Entity Recognition (2020.coling-main)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is the identification of the proper names of objects. |
| Approach: | They compare HTML tags discarded in free text Named Entity Recognition from Web pages . they find an increased F1 performance for Text+Tags of between 0.9% and 13.2% . |
| Outcome: | The proposed method improves F1 performance over datasets, variants and models. |
Pragmatic Reasoning Unlocks Quantifier Semantics for Foundation Models (2023.emnlp-main)
Copied to clipboard
| Challenge: | Generalized quantifiers are used to indicate the proportions predicates satisfy (e.g., some apples are red). |
| Approach: | They propose a framework to model quantifier semantics for textbased foundation models by combining natural language inference and the Rational Speech Acts framework. |
| Outcome: | The proposed framework shows a 20% improvement over a literal listener baseline in predicting percentage scopes for quantifier comprehension even with no training. |
UERLens: Understanding Event Relations in Large Language Models (2026.acl-short)
Copied to clipboard
| Challenge: | Existing studies on event relation extraction (ERE) have focused on improving model performance. |
| Approach: | They propose an interpretability framework for understanding event relations in large language models . they first construct a counterfactual dataset that includes causal, temporal, and sub-event relations . |
| Outcome: | The proposed framework improves event relation extraction by leveraging internal features to train a lightweight classifier. |
Semantic Span Annotation: An Exploratory Study of LLM Annotation (2026.acl-srw)
Copied to clipboard
| Challenge: | Structured span extraction research is siloed by context length, annotation task, and domain . Identifying a span within a natural language text and affixing it with a semantic label has been considered a core task in NLP . |
| Approach: | They propose a framework for structured span annotation that integrates five datasets under a common JSONL format with character-level offsets. |
| Outcome: | The proposed framework can generalize across four domains under three prompting configurations. |
Extractive Entity-Centric Summarization as Sentence Selection using Bi-Encoders (2022.aacl-short)
Copied to clipboard
| Challenge: | Entity-centric summarization is a type of controllable summarizing that aims to produce a summary specific to a given target entity. |
| Approach: | They propose to recast a sentence selection task as a controllable summarization using a dataset supported by EntSUM. |
| Outcome: | The proposed framework outperforms the current state-of-the-art in the sentence selection task and outperformed the competitive entity-centric Lead 3 heuristic by 1.1 F1. |
Joint Event and Temporal Relation Extraction with Shared Representations and Structured Prediction (D19-1)
Copied to clipboard
| Challenge: | Existing systems treat this task as a pipeline of two separate subtasks, i.e., event extraction and temporal relation classification. |
| Approach: | They propose a joint event and temporal relation extraction model with shared representation learning and structured prediction. |
| Outcome: | The proposed method improves both event extraction and temporal relation extraction over state-of-the-art systems. |
Open-Domain Question Answering Goes Conversational via Question Rewriting (2021.naacl-main)
Copied to clipboard
Raviteja Anantha, Svitlana Vakulenko, Zhucheng Tu, Shayne Longpre, Stephen Pulman, Srinivas Chappidi
| Challenge: | Existing large-scale benchmarks for conversational QA limit the topic of conversation to the content of a single document. |
| Approach: | They propose a dataset for Question Rewriting in Conversational Context (QReCC) the dataset contains 14K conversations with 80K question-answer pairs. |
| Outcome: | The proposed approach shows that the first baseline for the QReCC dataset is 19.10, compared to the human upper bound of 75.45, indicating the difficulty of the setup and a large room for improvement. |
BanSuite: A Unified Toolkit and Software Platform for Low-Resource NLP in Bangla (2026.eacl-demo)
Copied to clipboard
Md. Abu Sayed, Faisal Ahamed Khan, Jannatul Ferdous Tuli, Nabeel Mohammed, Mohammad Ruhul Amin, Mohammad Mamun Or Rashid
| Challenge: | Existing efforts to improve Bangla's NLP performance have focused on isolated tasks such as Part-of-Speech tagging and Named Entity Recognition (NER) but comprehensive, integrated systems for core NLP tasks such Shallow Parsing and Dependency Parser are largely absent. |
| Approach: | They propose to integrate a large-scale, manually annotated Bangla Treebank with high-quality pretrained models for POS tagging, NER, shallow parsing, and dependency parse. |
| Outcome: | The proposed system achieves strong in-domain baseline performance while maintaining high efficiency in resource usage. |
Towards General-Domain Word Sense Disambiguation: Distilling Large Language Model into Compact Disambiguator (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for Word Sense Disambiguation rely heavily on manually annotated data, which limits coverage and generalization. |
| Approach: | They propose a framework that leverages large language models as knowledge distillers to build silver-standard WSD corpora by combining generation-based distillation and annotation-based disambiguation. |
| Outcome: | The proposed framework outperforms existing methods on general-domain benchmarks by 50% on the most challenging test set and by 1000 times fewer parameters. |
EvoAgentX: An Automated Framework for Evolving Agentic Workflows (2025.emnlp-demos)
Copied to clipboard
| Challenge: | Existing MAS frameworks often require manual workflow configuration and lack native support for dynamic evolution and performance optimization. |
| Approach: | They propose an open-source platform that automates generation, execution, and evolutionary optimization of multi-agent workflows. |
| Outcome: | The proposed platform automates generation, execution, and evolutionary optimization of multi-agent workflows. |
Systems’ Agreements and Disagreements in Temporal Processing: An Extensive Error Analysis of the TempEval-3 Task (L18-1)
Copied to clipboard
| Challenge: | Temporal Processing systems are crucial for timelines and storylines . TempEval-3 is the latest evaluation campaign on open-domain TP in english . |
| Approach: | They present a Temporal Processing system that incorporates high level lexical semantic features and uses them to evaluate temporal relation classification. |
| Outcome: | The proposed system achieves the best scores for event detection and temporal relation classification from raw text, but the errors are not as robust as previous systems. |
End-to-End Argument Mining as Biaffine Dependency Parsing (2021.eacl-main)
Copied to clipboard
| Challenge: | Argumentation mining (AM) is a new field of research that uses dependency parsing to analyse arguments. |
| Approach: | They propose a neural end-to-end approach to argument mining based on dependency parsing . their model is biaffine dependency parsed and outperforms the current state-of-the-art . |
| Outcome: | The proposed model outperforms the state-of-the-art in component identification and relation identification. |
Bring Your Own KG: Self-Supervised Program Synthesis for Zero-Shot KGQA (2024.findings-naacl)
Copied to clipboard
| Challenge: | a universal question-answering system that can operate on any knowledge graph is presented . previous work that relied on training data to query structured data stores is unrealistic . |
| Approach: | They propose a universal question-answering system that can operate on any knowledge graph . they use an LLM-backed symbolic agent to generate query-program exemplars . |
| Outcome: | The proposed system outperforms state-of-the-art model on domain-specific KGs by 7.08 F1 . the proposed system can be ready to use within a day, the authors show . |
How Well Do Multi-hop Reading Comprehension Models Understand Date Information? (2022.aacl-short)
Copied to clipboard
| Challenge: | Existing multi-hop reading comprehension datasets have reasoning shortcuts that can be used to answer comparison questions without performing multi- hop reasoning. |
| Approach: | They propose a dataset with three probing tasks in addition to the main question . they then evaluate the model's ability to understand date information . |
| Outcome: | The proposed model performs well in date comparison and number subtraction tasks. |
Zero-shot Fact Verification by Claim Generation (2021.acl-short)
Copied to clipboard
| Challenge: | Existing methods for fact verification require large datasets, which can be expensive. |
| Approach: | They propose a framework for training a robust fact verification model by using automatically generated claims that can be supported, refuted, or unverifiable from evidence from Wikipedia. |
| Outcome: | The proposed framework reduces the demand for human-annotated training data and improves a model's F1 from 50% to 77%, equivalent in performance to 2K+ manually-curated examples. |
Discontinuous Named Entity Recognition as Maximal Clique Discovery (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for named entity recognition break the recognition process into several sequential steps. |
| Approach: | They propose a method that breaks the recognition process into several sequential steps . they construct a segment graph for each sentence and a grid tagging scheme to learn it . |
| Outcome: | Experiments show that the proposed method outperforms the state-of-the-art model and achieves 5x speedup over the SOTA model. |
Self-Training Pre-Trained Language Models for Zero- and Few-Shot Multi-Dialectal Arabic Sequence Labeling (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing approaches to fine-tune pre-trained language models for downstream tasks require labeled data. |
| Approach: | They propose to self-train pre-trained language models to improve performance on data-scarce varieties by as large as 10% F1 and 2% accuracy. |
| Outcome: | The proposed model improves zero-shot MSA-to-DA transfer by as large as 10% F1 (NER) and 2% accuracy (POS tagging). |
Frowning Frodo, Wincing Leia, and a Seriously Great Friendship: Learning to Classify Emotional Relationships of Fictional Characters (N19-1)
Copied to clipboard
| Challenge: | Existing literature analysis does not focus on roles of characters or on relationships between them. |
| Approach: | They propose to combine emotion and character identification into a unified framework for character network extraction from fictional texts. |
| Outcome: | The proposed task is based on fan-fiction short stories and is able to predict emotion relations in the extracted network graph. |
Learning Rich Representation of Keyphrases from Text (2022.findings-naacl)
Copied to clipboard
| Challenge: | Prior work has referred to extractive (part of document) or abstractive (not part of document). |
| Approach: | They propose to use a new pre-training objective to introduce keyphrases into transformer language models in discriminative and generative settings. |
| Outcome: | The proposed model improves performance in discriminative and generative settings and also improves on named entity recognition, question answering, relation extraction and abstractive summarization tasks. |
Document-Level Event Argument Extraction by Conditional Generation (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing event extraction models have been limited to the sentence level . this formulation signifies a misalignment between the information seeking behavior and the informative seeking behavior. |
| Approach: | They propose a document-level neural event argument extraction model by formulating the task as conditional generation following event templates. |
| Outcome: | The proposed model achieves 7.6% F1 and 5.7% F1 over the best baseline on the document-level event extraction dataset WikiEvents and 9.3% F1 on the informative argument extraction task. |
Protein-STORY: Semantic Text-Oriented Representation Yields biologically meaningful Protein embeddings (2026.acl-short)
Copied to clipboard
| Challenge: | Unsupervised representation learning relying on sequence data often overlooks decades of expert-curated biological knowledge stored in textual formats. |
| Approach: | They propose a pipeline that synthesizes protein embeddings from diverse, multi-source text descriptions and a network architecture that integrates high-fidelity functional and structural insights into a unified representation. |
| Outcome: | The proposed pipeline outperforms existing models on diverse downstream tasks (+2 pts F1) and enables zero-shot text-prompted protein search. |
Event Extraction as Multi-turn Question Answering (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Current approaches to event extraction fail to model rich interactions among event types and arguments of different roles. |
| Approach: | They propose a new paradigm that formulates event extraction as multi-turn question answering . they propose to use reading comprehension problems to extract triggers and arguments . |
| Outcome: | The proposed approach outperforms current state-of-the-art on argument extraction tasks . it makes full use of dependency among arguments and event types, and generalizes well . |
Policy Gradient as a Proxy for Dynamic Oracles in Constituency Parsing (P18-2)
Copied to clipboard
| Challenge: | Existing models for constituency parsing are transition based, decomposing production of each parse tree into a sequence of action decisions. |
| Approach: | They propose to use a policy gradient method to reduce exposure bias by allowing exploration during training. |
| Outcome: | The proposed method outperforms static oracle likelihood training on four constituency parsers in three languages on four parser-agnostic languages. |
Crowdsourcing and Aggregating Nested Markable Annotations (P19-1)
Copied to clipboard
| Challenge: | Existing methods for identifying markables for coreference annotation are task and language-independent and can be used for a variety of other annotation tasks. |
| Approach: | They propose a method for identifying markables for coreference annotation that combines automatic markable detectors with checking with a Game-With-A-Purpose (GWAP) and aggregation using a Bayesian annotation model. |
| Outcome: | The proposed method improves mention boundaries on news and other genres by over seven percentage points compared with state-of-the-art, domain-independent automatic mention detectors and almost three points over an in-domain mention detector. |
Simpler but More Accurate Semantic Dependency Parsing (P18-2)
Copied to clipboard
| Challenge: | Syntactic dependency parsing is the most popular method for automatically extracting low-level relationships between words in a sentence. |
| Approach: | They extend a syntactic dependency parser to train on and generate graph-structured representations that capture between-word relationships that are more closely related to the meaning of a sentence. |
| Outcome: | The proposed system beats the current state-of-the-art system by 0.6% and linguistically richer representations push the margin even higher. |
A Discriminative Neural Model for Cross-Lingual Word Alignment (D19-1)
Copied to clipboard
| Challenge: | a novel word alignment model for machine translation has been developed for a number of languages . explicit word-to-word alignments have largely been lost in neural MT systems . |
| Approach: | They propose a discriminative word alignment model which integrates into a Transformer-based machine translation model. |
| Outcome: | The proposed model performs better on Chinese and Arabic alignments than standard models. |
MoqaGPT : Zero-Shot Multi-modal Open-domain Question Answering with Large Language Model (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) like GPT-4 are not able to handle multi-modal open-domain question answering in a zero-shot manner. |
| Approach: | MoqaGPT uses divide-and-conquer strategy to extract answers from each modality separately. |
| Outcome: | MoqaGPT improves on MMCoQA dataset by +37.91 points and EM by +34.07 points. |
IIRC: A Dataset of Incomplete Information Reading Comprehension Questions (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing reading comprehension tasks focus on questions for which the contexts provide all the information required to answer them, thus not evaluating a system’s performance at identifying a potential lack of sufficient information and locating sources for that information. |
| Approach: | They propose to use a dataset with 13K questions over paragraphs from English Wikipedia that provide only partial information to answer them, with the missing information occurring in one or more linked documents. |
| Outcome: | The proposed model achieves 31.1% F1 on the reading comprehension task, while estimated human performance is 88.4%. |
Systematic Evaluation of Long-Context LLMs on Financial Concepts (2024.emnlp-industry)
Copied to clipboard
| Challenge: | Long-context large language models (LC LLMs) are promising for tasks with long context windows . however, their ability to reliably utilize their growing context windows remains under investigation . |
| Approach: | They evaluate the performance of long-context large language models using a real-world financial news dataset. |
| Outcome: | The proposed models exhibit brittleness at longer context lengths even for simple tasks, the authors show . they advocate for more rigorous evaluation of LC LLMs by employing holistic metrics such as F1 (rather than recall) |
Injecting Numerical Reasoning Skills into Language Models (2020.acl-main)
Copied to clipboard
| Challenge: | Existing models for numerical reasoning are limited by their flexibility and require specialized architectures to capture high-level skills. |
| Approach: | They propose to inject numerical reasoning skills into pre-trained LMs by generating large amounts of data and training in a multi-task setup. |
| Outcome: | The proposed model performs better on DROP than other models of comparable size while maintaining high performance on standard RC tasks. |
Anchor and Broadcast: An Efficient Concept Alignment Approach for Evaluation of Semantic Graphs (2024.lrec-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a sentencelevel formalism designed for English. |
| Approach: | They present an intuitive tool for evaluating graph-based meaning representations . they use an anchor broadcast alignment algorithm that is not subject to local maxima . |
| Outcome: | The proposed tool is highly correlated with the widely used Smatch score, but computation takes only about 40% the time. |
Ghostbuster: Detecting Text Ghostwritten by Large Language Models (2024.naacl-long)
Copied to clipboard
| Challenge: | Ghostbuster is a system that passes documents through weaker language models, runs a structured search over possible combinations of their features, and trains a classifier on the selected features. |
| Approach: | They propose a method that passes documents through weaker language models, runs a structured search over possible combinations of their features, and trains a classifier on the selected features. |
| Outcome: | The proposed method outperforms existing detectors and a new baseline on student essays, creative writing, and news articles. |
Co-training an Unsupervised Constituency Parser with Weak Supervision (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for unsupervised parsing that use bootstrapping classifiers to identify if a node dominates a span are lacking. |
| Approach: | They propose a method for unsupervised parsing that relies on bootstrapping classifiers to identify if a node dominates a specific span. |
| Outcome: | The proposed method achieves 63.1 F1 on the English test set and new state-of-the-art on treebanks for Chinese and Japanese. |
Reasoning Implicit Sentiment with Chain-of-Thought Prompting (2023.acl-short)
Copied to clipboard
| Challenge: | In implicit sentiment analysis, the opinion cues come in an implicit and obscure manner. |
| Approach: | They propose a three-step prompting principle for THOR to step-by-step induce the implicit aspect, opinion and finally the sentiment polarity. |
| Outcome: | The proposed framework pushes the state-of-the-art (SoTA) by over 6% F1 on supervised setup and more strikingly, boosts the SoTA by over 50% F1 with THOR+GPT3. |
Structure-Guided Entity Resolution: Fine-Tuning LLMs for Robust Name Matching in Complex Linguistic Contexts (2026.acl-industry)
Copied to clipboard
| Challenge: | Variations in naming conventions, inconsistent transliteration across scripts, and frequent data entry errors make it difficult to unify user identities, an essential requirement for Know Your Customer (KYC) compliance. |
| Approach: | They propose a framework that fine-tunes an LLM through a two-phase curriculum to match person names across heterogeneous records. |
| Outcome: | The proposed framework outperforms GPT-4o and single-stage fine-tuning baselines in the Indian identity data. |
ChatR1: Reinforcement Learning for Conversational Reasoning and Retrieval Augmented Question Answering (2026.acl-long)
Copied to clipboard
| Challenge: | Unlike static ‘rewrite, retrieve, and generate’ pipelines, ChatR1 interleaves search and reasoning across turns, enabling exploratory and adaptive behaviors learned through RL. |
| Approach: | They propose a reasoning framework based on reinforcement learning (RL) for conversational question answering that interleaves search and reasoning across turns and provides turn-level feedback. |
| Outcome: | The proposed framework outperforms competing models on five CQA datasets, measured by different metrics (F1, BERTScore, and LLM-as-judge). |
Extending a Parser to Distant Domains Using a Few Dozen Partially Annotated Examples (P18-1)
Copied to clipboard
| Challenge: | Statistical parsers are often criticized for their performance outside of the domain they were trained on . we show that word representations reduce the need for domain adaptation when the target domain is syntactically similar to the source domain. |
| Approach: | They propose a way to adapt a parser to a syntactically similar target domain using partial annotations. |
| Outcome: | The proposed model increases the accuracy of a parser on the Wall Street Journal by 1.7% over the previous state-of-the-art model. |
Harvesting Events from Multiple Sources: Towards a Cross-Document Event Extraction Paradigm (2024.findings-acl)
Copied to clipboard
| Challenge: | Document-level event extraction aims to extract structured information from unstructured text. |
| Approach: | They propose a cross-document event extraction pipeline that integrates event information from multiple documents and provides a comprehensive perspective on events. |
| Outcome: | The proposed pipeline achieves about 72% F1 in end-to-end cross-document event extraction, setting up a benchmark for future research. |
Biomedical Event Extraction with Hierarchical Knowledge Graphs (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Biomedical event extraction is critical in understanding biomolecular interactions described in scientific corpus. |
| Approach: | They propose to integrate domain knowledge from Unified Medical Language System (UMLS) to a pre-trained language model using Graph Edge-conditioned Attention Networks and hierarchical graph representation. |
| Outcome: | The proposed approach achieves 1.41% F1 and 3.19% F1 improvements on the BioNLP 2011 GENIA Event Extraction task. |
An Expert Annotated Dataset for the Detection of Online Misogyny (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing studies have found that misogynistic content is pervasive on some Reddit communities, but a training dataset for misogorical classification has not been created with the data. |
| Approach: | They propose a hierarchical taxonomy and an expert labelled dataset to enable automatic classification of online misogynistic content. |
| Outcome: | The proposed taxonomy and an expert labelled dataset are made freely available for future research. |
GEMNET: Effective Gated Gazetteer Representations for Recognizing Complex Entities in Low-context Input (2021.naacl-main)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is difficult in real-world settings due to short texts, emerging entities, and complex entities. |
| Approach: | They propose a flexible Gazetteer Representation encoder and a Mixture-of-Experts gating network for gazetteer knowledge integration. |
| Outcome: | The proposed approach shows large gains (up to +49% F1) in recognizing difficult entities compared to baselines. |
An Untold Story of Preprocessing Task Evaluation: An Alignment-based Joint Evaluation Approach (2024.lrec-main)
Copied to clipboard
Eunkyul Leah Jo, Angela Yoonseo Park, Grace Tianjiao Zhang, Izia Xiaoxiao Wang, Junrui Wang, MingJia Mao, Jungyeul Park
| Challenge: | a preprocessing task such as tokenization and sentence boundary detection (SBD) has been considered as a solution to many NLP challenges . however, the low error rates of current methods are mainly specific to certain tasks and rule-based tokenization can be difficult to use across different systems. |
| Approach: | They propose an evaluation algorithm that combines both tokenization and SBD results to improve evaluation reliability. |
| Outcome: | The proposed evaluation algorithm improves the reliability of evaluations by reevaluating the counts of true positive cases for F1 measures in both preprocessing tasks jointly. |
ComFact: A Benchmark for Linking Contextual Commonsense Knowledge (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to retrieve facts from commonsense knowledge graphs are imprecise, requiring heuristics that ignore contexts and ambiguity . a novel benchmark, ComFact, contains 293k in-context relevance annotations for commonsensense triplets . |
| Approach: | They propose a task of commonsense fact linking where models are given contexts and trained to identify situationally-relevant commonsensical knowledge from KGs. |
| Outcome: | The proposed benchmark shows that heuristic fact linking approaches are imprecise . however, the models still significantly underperform humans in the commonsense augmentation task . |
FiNERweb: Datasets and Artifacts for Scalable Multilingual Named Entity Recognition (2026.findings-eacl)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is the task of identifying tokens that belong to a predefined set of classes such as "person" or "location" |
| Approach: | They propose a dataset-creation pipeline that scales the teacher-student paradigm to 91 languages and 25 scripts. |
| Outcome: | The proposed model achieves comparable or improved performance in English, Thai, and Swahili despite being trained on 19x less data than strong baselines. |
Know What You Don’t Know: Unanswerable Questions for SQuAD (P18-2)
Copied to clipboard
| Challenge: | Existing datasets focus on answerable questions or use automatically generated unanswerable questions that are easy to identify. |
| Approach: | They propose a dataset that combines the Stanford Question Answering Dataset with 50,000 unanswerable questions written by crowdworkers to look similar to answerable ones. |
| Outcome: | The proposed dataset looks similar to answerable questions on crowd-written questions . strong neural system that gets 86% F1 on SQuAD achieves only 66% F1. |
Double Graph Based Reasoning for Document-level Relation Extraction (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for document-level relation extraction fail to recognize relations between entities across sentences. |
| Approach: | They propose a method to recognize relations for long paragraphs by a Graph Aggregation-and-Inference Network (GAIN) they propose to use a heterogeneous mention-level graph and an entity-level EG graph to analyze the relationships. |
| Outcome: | The proposed method achieves a significant performance improvement (2.85 on F1) over the previous state-of-the-art. |
PV2TEA: Patching Visual Modality to Textual-Established Information Extraction (2023.findings-acl)
Copied to clipboard
| Challenge: | Empirical results show up to 11.74% absolute (20.97% relative) increase over unimodal baselines. |
| Approach: | They propose to patch the visual modality to the textual-established attribute in- formation extractor. |
| Outcome: | Empirical results show up to 11.74% absolute (29.9% relative) increase over unimodal baselines. |
Event Extraction as Machine Reading Comprehension (2020.emnlp-main)
Copied to clipboard
| Challenge: | Event extraction (EE) is a crucial information extraction task that aims to extract event information in texts. |
| Approach: | They propose a new learning paradigm for event extraction by explicitly casting it as a machine reading comprehension problem. |
| Outcome: | The proposed model achieves state-of-the-art performance on the data-scarce scenario, achieving 49.8% in F1 for event argument extraction with only 1% data, compared with 2.2% of the previous method. |
Document-Level Relation Extraction with Adaptive Focal Loss and Knowledge Distillation (2022.findings-acl)
Copied to clipboard
| Challenge: | Document-level relation extraction (DocRE) is a more challenging task than sentence-level one. |
| Approach: | They propose a semi-supervised framework for document-level relation extraction with three components . they use an axial attention module for learning the interdependency among entity-pairs . |
| Outcome: | The proposed model outperforms baseline models on two DocRE datasets and outperformed previous models on human annotated data and distantly supervised data. |
CliCR: a Dataset of Clinical Case Reports for Machine Reading Comprehension (N18-1)
Copied to clipboard
| Challenge: | Currently, machine comprehension datasets are extremely scarce for specialized domains. |
| Approach: | They propose a dataset for machine comprehension in the medical domain using clinical case reports with around 100,000 gap-filling queries about these cases. |
| Outcome: | The proposed dataset uses clinical case reports with around 100,000 gap-filling queries about these cases. |
Seeing is Believing: Emotion-Aware Audio-Visual Language Modeling for Expressive Speech Generation (2025.findings-emnlp)
Copied to clipboard
| Challenge: | AVLM integrates full-face visual cues into a pre-trained expressive speech model. |
| Approach: | They propose an Audio-Visual Language Model (AVLM) for expressive speech generation by integrating full-face visual cues into a pre-trained expressive speech model. |
| Outcome: | The proposed model incorporates full-face visual cues into a pre-trained expressive speech model. |
DIA-HARM: Dialectal Disparities in Harmful Content Detection Across 50 English Dialects (2026.acl-long)
Copied to clipboard
| Challenge: | Current disinformation detection systems are predominantly developed and evaluated on Standard American English (SAE) . however, their robustness to dialectal variation is unexplored. |
| Approach: | They propose a benchmark for evaluating disinformation detection robustness across 50 English dialects . they use multi-value's linguistically-grounded transformations to introduce D-CUBE (Dialectal Disinformation Detection Corpus) |
| Outcome: | The proposed model outperforms zero-shot LLMs in human-written dialects while AI-generated content remains stable. |
Investigating Non-local Features for Neural Constituency Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | Constituency parsers have been able to achieve competitive performance by using local features. |
| Approach: | They propose to inject non-local features into the training process of a local span-based parser by predicting constituent n-gram non-local patterns and ensuring consistency between constituents and local constituents. |
| Outcome: | The proposed method outperforms the self-attentive parser in multi-lingual and zero-shot cross-domain settings. |
A Multi- versus a Single-classifier Approach for the Identification of Modality in the Portuguese Language (L18-1)
Copied to clipboard
| Challenge: | Comparative study of two different approaches to build an automatic classification system for Modality values in the Portuguese language. |
| Approach: | They propose to use a single multi-class classifier with the full Portuguese language dataset that includes eleven modal verbs and a weighted average approach to build different classifiers for each verb. |
| Outcome: | The proposed system is based on a Portuguese language dataset with 11 modal verbs and two different classifiers, one for each verb. |
UDAPTER - Efficient Domain Adaptation Using Adapters (2023.eacl-main)
Copied to clipboard
| Challenge: | Using adapters, unsupervised domain adaptation (UDA) is more parameter efficient and requires large-scale data to be effective. |
| Approach: | They propose to add small bottleneck layers to each layer of a pre-trained language model to make it more parameter efficient by adding adapters. |
| Outcome: | The proposed methods outperform unsupervised domain adaptation methods such as DANN and DSN in natural language inference and sentiment classification tasks. |
Constrained Decoding for Computationally Efficient Named Entity Recognition Taggers (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Named entity recognition models use a conditional random field as the final layer . current work eschews prior knowledge of how the span encoding scheme works . |
| Approach: | They propose to constrain the output to suppress illegal transitions to train a tagger with a cross-entropy loss twice as fast as a CRF. |
| Outcome: | The proposed model trains twice as fast as a CRF with statistically insignificant differences in F1 . the proposed model is open source and can be used in PyTorch and TensorFlow. |
A Weak Supervision Approach for Few-Shot Aspect Based Sentiment Analysis (2024.eacl-long)
Copied to clipboard
Robert Vacareanu, Siddharth Varia, Kishaloy Halder, Shuai Wang, Giovanni Paolini, Neha Anna John, Miguel Ballesteros, Smaranda Muresan
| Challenge: | Existing methods to improve few-shot performance in aspect-based sentiment analysis (ABSA) require complex interactions between the target and the polarity of the sentiment. |
| Approach: | They propose a pipeline approach to construct a noisy ABSA dataset and adapt it to the ABSA tasks. |
| Outcome: | The proposed model outperforms the state-of-the-art on the aspect extraction sentiment classification task and is capable of performing the harder aspect sentiment triplet extraction task. |
MAFiD: Moving Average Equipped Fusion-in-Decoder for Question Answering over Tabular and Textual Data (2023.findings-eacl)
Copied to clipboard
| Challenge: | Experimental results show that Transformer-based questions have a "long" hybrid sequence over tabular and textual elements, causing long-range reasoning problems. |
| Approach: | They propose a moving average-equipped fusion-in-decoder to handle long-range reasoning problems . they use FiD and EMA to combine different levels of reasoning . |
| Outcome: | Experimental results show that the proposed model increases exact matching and F1 by 1.1 and 1.7 on the blind test set. |
Multi-grained Chinese Word Segmentation with Weakly Labeled Data (2020.coling-main)
Copied to clipboard
| Challenge: | Existing work on single-grained word segmentation (SWS) focuses on segmenting a sentence into multiple word sequences to preserve all words of different granularities. |
| Approach: | They propose to use a graph-based parser to accommodate weakly labeled data for MWS by employing a simple yet competitive graph-basic parsers with local loss. |
| Outcome: | The proposed model outperforms the state-of-the-art model on weakly labeled data on a high-quality dataset from canonical newswire (NEWS) and non-canonical web (BAIKE) data. |
ERGO: Event Relational Graph Transformer for Document-level Event Causality Identification (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods to identify event-event causal relations in a document are noisy and require heuristic rules or external tools. |
| Approach: | They propose a document-level event-event causality identification framework that uses heuristic rules to design edges between events. |
| Outcome: | The proposed framework outperforms existing state-of-the-art methods on two benchmark datasets. |
A Span Selection Model for Semantic Role Labeling (D18-1)
Copied to clipboard
| Challenge: | Existing models for semantic role labeling use BIO tags to predict argument spans . but performance of these approaches is weak . |
| Approach: | They propose a span-based model that takes into account all possible argument spans and scores them for each label. |
| Outcome: | The proposed model achieves state-of-the-art results on the CoNLL-2005 and 2012 datasets. |
Global Constraints with Prompting for Zero-Shot Event Argument Classification (2023.findings-eacl)
Copied to clipboard
| Challenge: | Existing zero-shot trigger extraction models require annotations, which is not practical for open-domain applications. |
| Approach: | They propose to use global constraints with prompting to tackle event argument classification without annotation and task-specific training. |
| Outcome: | The proposed model outperforms the best zero-shot baselines by 12.5% and 10.9% F1 on ACE and ERE with given argument spans and by 4.3% and 3.3% F1 without given argument spas. |
Validating Automatic Evaluation of Controllable Counterspeech Generation: Rankings Matter More Than Scores (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing methods for evaluating attributes of counterspeech are limited and the validity of such evaluations is questionable when the classifiers themselves have only modest performance. |
| Approach: | They examine the automatic evaluation of counterspeech attributes using a multi-attribute counterseech dataset containing 2,728 samples. |
| Outcome: | The proposed model can be trusted by classifier validation, and it can rank models with confidence. |
HateXScore: A Metric Suite for Evaluating Reasoning Quality in Hate Speech Explanations (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing evaluation frameworks do not assess why a text is deemed hateful . authors present a new metric to evaluate the reasoning quality of model explanations . |
| Approach: | They propose a metric suite to evaluate the reasoning quality of model explanations. |
| Outcome: | The proposed metric validates it as a practical tool for trustworthy and transparent moderation on six diverse hate speech datasets. |
KoBLEX: Open Legal Question Answering with Multi-hop Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable performances in general domains and are now extending into the expert domain of law. |
| Approach: | They propose a Korean Benchmark for Legal EXplainable QA (KoBLEX) that evaluates provision-grounded, multi-hop legal reasoning. |
| Outcome: | The proposed method outperforms baselines and shows a high correlation with human judgments. |
Multimedia Event Extraction with LLM Knowledge Editing (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing multimodal event extraction methods focus on weakly aligning features from wellpretrained unimodal encoders, resulting in redundant feature perception. |
| Approach: | They propose a multimodal event extraction strategy with a redundant feature selection mechanism that enhances event understanding ability of multimodal large language models. |
| Outcome: | The proposed method outperforms the state-of-the-art (SOTA) baselines on the M2E2 benchmark. |
N-ary Constituent Tree Parsing with Recursive Semi-Markov Model (2021.acl-long)
Copied to clipboard
| Challenge: | Existing graph-based constituent parsing methods generate hidden nodes with the dummy label inside the n-ary nodes to transform the tree into a binary tree for prediction. |
| Approach: | They propose a graph-based constituent parsing framework that uses a 1-order semi-Markov model to predict the immediate children sequence of a constituent candidate. |
| Outcome: | The proposed framework obtains the F1 of 95.92% and 92.50% on the datasets of PTB and CTB 5.1 respectively. |
Improving Entity Disambiguation by Reasoning over a Knowledge Base (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent work in entity disambiguation relies on a limited subset of KB facts to link entities . less common entities are prone to missing or inconsistent KB information, which is problematic for models which rely on 'one source' |
| Approach: | They propose an ED model which links entities by reasoning over a symbolic knowledge base in a fully differentiable fashion. |
| Outcome: | The proposed model outperforms state-of-the-art models on six well-established datasets by 1.3 F1 on average. |
ReBPE: Iteratively Improving the Internal Structure of a Structured Tokeniser by Mining its Internal Structure (2026.findings-eacl)
Copied to clipboard
| Challenge: | Recent work explores pruning merges from BPE subword tokenisers using corpus data as a signal for which merges to prune. |
| Approach: | They propose a pruning algorithm that inspects the effects left by pruning . they propose reification of the tokenisers and a new pruning algorithm . |
| Outcome: | The proposed algorithm outperforms the original BPE-knockout algorithm on alignment in all 14 languages tested by over 11% F1 on average. |
On-the-fly Definition Augmentation of LLMs for Biomedical NER (2024.naacl-long)
Copied to clipboard
| Challenge: | Despite their general capabilities, LLMs struggle on biomedicalNER tasks due to specialized terminology and lack of training data. |
| Approach: | They propose a new knowledge augmentation approach which incorporates definitions of relevant concepts on-the-fly. |
| Outcome: | The proposed approach improves performance on biomedicalNER tasks by 15% (on average) The proposed method outperforms fine-tuned language models in few-shot settings. |
A Knowledge Hunting Framework for Common Sense Reasoning (D18-1)
Copied to clipboard
| Challenge: | a new system that uses common sense to solve a common sense problem is developed . a winograd schema challenge and a choice of plausible alternatives are popular tests . |
| Approach: | They propose an automatic system that achieves state-of-the-art results on the Winograd Schema Challenge . they use a knowledge hunting module to gather web text for problem resolutions . |
| Outcome: | The proposed system achieves state-of-the-art on the Winograd Schema Challenge . it improves F1 performance on the full WSC by 0.21 over the previous best . |
Learned Incremental Representations for Parsing (2022.acl-long)
Copied to clipboard
| Challenge: | a new syntactic representation that commits to syntakic choices is proposed for humans . we use a system that uses only incremental processing of a prefix to predict the word in a sentence . |
| Approach: | They propose a syntactic representation that commits to syntakic choices incrementally . they say the system can achieve 93.72 F1 on the Penn Treebank with as few as 5 bits per word . |
| Outcome: | The proposed representation achieves 93.72 F1 on the Penn Treebank with as few as 5 bits per word . the analysis of the representations shows they have interpretable features and deferred resolution of syntactic ambiguities. |
ReCoT-NER: Enhancing Zero-Shot Named Entity Recognition through Chain-of-Thought Prompting and Recall-Oriented Loss Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a key component of natural language processing (NLP) but it is difficult to implement in specialized domains such as wind power fault diagnosis. |
| Approach: | They propose a reasoning-enhanced generative framework that integrates Chain-of-Thought prompting and recall-oriented loss optimization to address these challenges. |
| Outcome: | The proposed framework improves recall and overall F1 performance across general and industrial domains. |
Head-Driven Phrase Structure Grammar Parsing on Penn Treebank (P19-1)
Copied to clipboard
| Challenge: | Head-driven phrase structure grammars have a uniform formalism representing rich contextual syntactic and even semantic meanings. |
| Approach: | They propose to integrate constituent and dependency formal representations into head-driven phrase structure. |
| Outcome: | The proposed parser achieves state-of-the-art performance on Penn Treebank and Chinese Penn TreeBank. |
Attention-Guided Answer Distillation for Machine Reading Comprehension (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to reading comprehension systems are vulnerable to adversarial attacks. |
| Approach: | They propose to use knowledge distillation to transfer knowledge from an ensemble to a single model. |
| Outcome: | The proposed methods outperform the teacher on adversarial datasets and NarrativeQA benchmarks. |
Neural Generative Rhetorical Structure Parsing (D19-1)
Copied to clipboard
| Challenge: | Existing approaches to RST parsing use discriminative models, but these are less sample efficient and datasets are typically small. |
| Approach: | They propose a document-level RNN grammar with a bottom-up traversal order and a beam search algorithm that keeps track of both structure-and word-generating actions without exhibit-ing this branching bias. |
| Outcome: | The proposed model outperforms a discriminative model with the same features by 2.6 F1points and achieves comparable performance to the state-of-the-art. |
Programmable Annotation with Diversed Heuristics and Data Denoising (2022.coling-1)
Copied to clipboard
| Challenge: | Neural natural language generation and understanding models require massive amounts of annotated data to be competitive. |
| Approach: | They propose a data programming framework that can jointly construct labeled data for language generation and understanding tasks by allowing annotators to modify an automatically-inferred alignment rule set between sequence labels and text. |
| Outcome: | The proposed framework generates high-quality data within a 1.48 BLEU and 6.42 slot F1 of 100% human-labeled data with just 100 labeled data samples outperforming benchmark annotation frameworks and other semi-supervised approaches. |
Few-Shot Question Answering by Pretraining Span Selection (2021.acl-long)
Copied to clipboard
| Challenge: | Pretraining models with recurring span selection are effective, but perform poorly in a few-shot setting. |
| Approach: | They propose recurring span selection scheme that asks model to select correct span in passage with multiple sets of recurring recurrings. |
| Outcome: | The proposed model achieves 72.7 F1 on multiple benchmarks while maintaining competitive performance in the high-resource setting. |
OpenEL: An Annotated Corpus for Entity Linking and Discourse in Open Domain Dialogue (2022.lrec-1)
Copied to clipboard
| Challenge: | Named entity recognition (NER), named entity linking and discourse modeling are crucial aspects of natural language understanding for open domain dialogue systems. |
| Approach: | They present an annotated multi-domain corpus for linking entities in open-domain dialogue . they use dialogue context and anaphora resolution to assess the effectiveness of the task . |
| Outcome: | The OpenEL corpus is an annotated multi-domain corpus for linking entities in open-domain dialogue . the system Flair + BLINK has the best performance with a 0.65 F1 score . |
QuAC: Question Answering in Context (D18-1)
Copied to clipboard
Eunsol Choi, He He, Mohit Iyyer, Mark Yatskar, Wen-tau Yih, Yejin Choi, Percy Liang, Luke Zettlemoyer
| Challenge: | a dataset for Question Answering in Context contains 14K information-seeking QA dialogs . questions are often more open-ended, unanswerable, or only meaningful within the dialog context . |
| Approach: | They propose a dataset for Question Answering in Context that contains 14K dialogs . they use a student to ask questions about a Wikipedia section and a teacher to answer them . |
| Outcome: | The proposed dataset underperforms humans in a number of reference models . the dataset contains 14K information-seeking dialogs over sections from Wikipedia . |
Be Consistent! Improving Procedural Text Comprehension using Label Consistency (N19-1)
Copied to clipboard
| Challenge: | Existing systems for procedural text comprehension still struggle with this task . evaluative work shows that consistent predictions from multiple entities can improve performance . |
| Approach: | They propose a framework that leverages label consistency during training to improve prediction performance. |
| Outcome: | The proposed framework significantly improves prediction performance over previous state-of-the-art systems on a standard benchmark dataset for procedural text, ProPara. |
The Causal News Corpus: Annotating Causal Relations in Event Sentences from News (2022.lrec-1)
Copied to clipboard
Fiona Anting Tan, Ali Hürriyetoğlu, Tommaso Caselli, Nelleke Oostdijk, Tadashi Nomoto, Hansi Hettiarachchi, Iqra Ameer, Onur Uca, Farhana Ferdousi Liza, Tiancheng Hu
| Challenge: | Existing annotation guidelines for event causality focus on only explicit relations or clauses. |
| Approach: | They propose an annotation schema for event causality that addresses these concerns . they annotated 3,559 event sentences from protest event news with labels on whether it contains causal relations or not. |
| Outcome: | The proposed annotation schema for event causality addresses these concerns . it performs well with 81.20% F1 score on test set and 83.46% in 5-folds cross-validation . |
Improving Multi-label Malevolence Detection in Dialogues through Multi-faceted Label Correlation Enhancement (2022.acl-long)
Copied to clipboard
| Challenge: | Current methods for detecting dialogue malevolence neglect label correlation. |
| Approach: | They propose to crowdsource a multi-label dataset for detecting malevolent dialogue responses and a model with label correlation enhanced CRF to measure the correlation between malevolence and negative emotions. |
| Outcome: | The proposed model outperforms the best performing baseline method on precision, recall, F1, and Jaccard score by 16.1%, 11.9%, 12.0%, and 6.1% on malevolence. |
MeLT: Message-Level Transformer with Masked Document Representations as Pre-Training for Stance Detection (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Much of natural language processing is focused on leveraging large capacity language models, typically trained over single messages with a task of predicting one or more tokens. |
| Approach: | They propose a hierarchical message-encoder pre-trained over Twitter for stance prediction task. |
| Outcome: | The proposed model achieves 67% performance on stance prediction task using a pre-trained message-encoder over Twitter. |
TAT-QA: A Question Answering Benchmark on a Hybrid of Tabular and Textual Content in Finance (2021.acl-long)
Copied to clipboard
Fengbin Zhu, Wenqiang Lei, Youcheng Huang, Chao Wang, Shuo Zhang, Jiancheng Lv, Fuli Feng, Tat-Seng Chua
| Challenge: | Existing QA systems focus on unstructured text, structured knowledge base, or semi-structured tables. |
| Approach: | They propose a large-scale question answering model based on financial reports . numerical reasoning is usually required to infer the answer . |
| Outcome: | The proposed model achieves 58.0% inF1, an 11.1% increase over the baseline model, but still lags behind the best human model. |
Modelling Context Emotions using Multi-task Learning for Emotion Controlled Dialog Generation (2021.eacl-main)
Copied to clipboard
| Challenge: | Recent research has tackled this task using neural generative methods by augmenting emotion classes with the input sequences. |
| Approach: | They propose to use a self-attention based encoder and a decoder with dot product attention mechanism to generate a viable response with a specified emotion. |
| Outcome: | The proposed model outperforms baselines on automatic evaluation measures such as F1 and BLEU scores, thus resulting in more fluent and adequate responses. |
LLM-VA: Resolving the Jailbreak-Overrefusal Trade-off via Vector Alignment (2026.acl-long)
Copied to clipboard
| Challenge: | Existing vector steering methods adjust the magnitude of answer vectors, but this creates a fundamental trade-off—reducing jailbreak increases over-refusal. |
| Approach: | They propose a method which aligns va with vb through closed-form weight updates, making the model’s willingness to respond causally dependent on its safety assessment. |
| Outcome: | Experiments on 12 LLMs show that the proposed method achieves 11.45% higher F1 than the best baseline while preserving 95.92% utility. |
Supervised Neural Clustering via Latent Structured Output Learning: Application to Question Intents (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work on structured prediction has produced very effective supervised clustering algorithms using linear classifiers. |
| Approach: | They propose to use latent structured prediction loss and Transformer models to approach supervised clustering. |
| Outcome: | The proposed approach outperforms the state-of-the-art in recreating intents from public question corpora. |
CREAD: Combined Resolution of Ellipses and Anaphora in Dialogues (2021.naacl-main)
Copied to clipboard
Bo-Hsiang Tseng, Shruti Bhargava, Jiarui Lu, Joel Ruben Antony Moniz, Dhivya Piraviperumal, Lin Li, Hong Yu
| Challenge: | Traditionally, anaphora resolution and ellipses resolution are limited in dialogues . despite rapid progress in dialogue systems, several difficulties remain . |
| Approach: | They propose a joint learning framework for modeling coreference resolution and query rewriting for complex, multi-turn dialogues. |
| Outcome: | The proposed model outperforms the state-of-the-art model on a rewritten dialogue dataset. |
Cross-Lingual UMLS Named Entity Linking using UMLS Dictionary Fine-Tuning (2022.findings-acl)
Copied to clipboard
| Challenge: | a new method for named entity linking is being developed in the field of public health . it uses an offline unsupervised construction of a translated dictionary and a pre-trained transformer language model to filter candidates according to context. |
| Approach: | They propose a method for mapping mentions in a source language to UMLS concepts . they extend an offline unsupervised translation of a translated UMLS dictionary . |
| Outcome: | The proposed approach achieves state-of-the-art on the Hebrew Camoni corpus and English datasets. |
An Instance Level Approach for Shallow Semantic Parsing in Scientific Procedural Text (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing approaches to parse scientific text using grammatically similar labeled sentences are limited and expensive to create. |
| Approach: | They propose a method where semantic labels from structurally similar sentences are copied to test sentences. |
| Outcome: | The proposed approach outperforms baseline and prior methods by 0.75 to 3 F1 absolute in the wet lab protocol corpus and 1 F1 absolut in the materials science procedural text corpus. |
Document-level Event Extraction via Heterogeneous Graph-based Interaction Model with a Tracker (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods for document-level event extraction are not effective due to two challenges . existing methods fail to extract events whose arguments spread in multiple sentences . |
| Approach: | They propose a document-level event extraction model with a tracker to capture interdependency among the extracted events. |
| Outcome: | The proposed model outperforms existing models on a large-scale dataset by 2.8 F1 . it extracts multiple correlated events and event arguments that scatter across the document . |
Rad-SpatialNet: A Frame-based Resource for Fine-Grained Spatial Relations in Radiology Reports (2020.lrec-1)
Copied to clipboard
Surabhi Datta, Morgan Ulinski, Jordan Godfrey-Stovall, Shekhar Khanpara, Roy F. Riascos-Castaneda, Kirk Roberts
| Challenge: | Existing framework for encoding spatial language in radiology is based on frame semantics . |
| Approach: | They propose a framework for encoding spatial language in radiology based on frame semantics and a corpus of 400 radiology reports annotated with spatial trigger expressions and contextual information. |
| Outcome: | The proposed framework is based on the existing SpatialNet representation in the general domain and is able to generate more accurate representations of spatial language in radiology. |
Standardizing Distress Analysis: Emotion-Driven Distress Identification and Cause Extraction (DICE) in Multimodal Online Posts (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for identifying hate speech have been limited to analyzing textual content. |
| Approach: | They propose a method for distress identification and cause extraction from social media posts using emotional information. |
| Outcome: | The proposed method improves F1 and ROS scores by 1.95% and 3% relative to the best-performing baseline. |
Correcting on Graph: Faithful Semantic Parsing over Knowledge Graphs with Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Complex multi-hop questions require comprehensive retrieval and reasoning. |
| Approach: | They propose a semantic parsing framework to establish faithful logical queries that connect LLMs and knowledge graphs. |
| Outcome: | The proposed framework outperforms state-of-the-art KGQA methods on knowledge-intensive questions. |
DARER: Dual-task Temporal Relational Recurrent Reasoning Network for Joint Dialog Sentiment Classification and Act Recognition (2022.findings-acl)
Copied to clipboard
| Challenge: | Dialog sentiment classification (DSC) and dialog act recognition (DAR) aims to predict the sentiment label and act label for each utterance in a dialog. |
| Approach: | They propose a framework which integrates prediction-level interactions other than semantics-level ones into dialog understanding and dual-task reasoning by integrating temporal relations into the model. |
| Outcome: | The proposed model outperforms existing models by large margins while costing less training time and requiring less computation resource. |
Modeling Content Importance for Summarization with Pre-trained Language Models (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on content importance do not consider semantics and context when evaluating importance. |
| Approach: | They apply information theory to pre-trained language models to define the concept of importance from the perspective of information amount. |
| Outcome: | Experiments on CNN/Daily Mail and New York Times show that the proposed model can model the importance of content better than previous methods based on F1 and ROUGE scores. |
A Sweet Rabbit Hole by DARCY: Using Honeypots to Detect Universal Trigger’s Adversarial Attacks (2021.acl-long)
Copied to clipboard
| Challenge: | Existing adversarial examples can fool ML models by generating a fixed phrase that can drop the prediction accuracy of a textual neural network (NN) model to near zero on a target class. |
| Approach: | They propose a honeypot-based defense framework that greedily searches and injects multiple trapdoors into an NN model to “bait and catch” potential attacks. |
| Outcome: | The proposed algorithm detects attacks with 99% TPR and less than 2% FPR while maintaining prediction accuracy within 1% margin. |
BRIEF: Bridging Retrieval and Inference for Multi-hop Reasoning via Compression (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing approaches to augment language models with external knowledge but they are limited by static nature of pre-training data. |
| Approach: | They propose a lightweight approach that compresses retrieved documents into highly dense textual summaries to integrate into in-context RAG. |
| Outcome: | The proposed approach reduces latency and costs while achieving high performance in open-domain questions. |
Margin-based Parallel Corpus Mining with Multilingual Sentence Embeddings (P19-1)
Copied to clipboard
| Challenge: | Traditional parallel corpus mining methods focus on the textual content instead of the size and quality of training data. |
| Approach: | They propose a method for machine translation based on multilingual sentence embeddings. |
| Outcome: | The proposed method outperforms the best published methods on the BUCC mining task and the UN reconstruction task by more than 10 F1 and 30 precision points. |
Wizard of Tasks: A Novel Conversational Dataset for Solving Real-World Tasks in Conversational Settings (2022.coling-1)
Copied to clipboard
Jason Ingyu Choi, Saar Kuzi, Nikhita Vedula, Jie Zhao, Giuseppe Castellucci, Marcus Collins, Shervin Malmasi, Oleg Rokhlenko, Eugene Agichtein
| Challenge: | Existing Conversational Task Assistants fail to provide a comprehensive natural conversation that includes search, context-aware QA, step-by-step instructions. |
| Approach: | They present a corpus of conversations in two domains: cooking and home improvement . they crowd-sourced 549 conversations with an asynchronous Wizard-of-Oz setup . |
| Outcome: | The proposed model performs well in both Intent Classification and Abstractive Question Answering tasks, but the performance is poor on AQA tasks. |
RelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing relationships between entities can be reliable indicators for classifying sensitive information, such as commercially sensitive information. |
| Approach: | They propose to represent entities and relations within a single embedding to better capture the relationship between the entities. |
| Outcome: | The proposed method significantly improves the effectiveness of sensitivity classification compared to existing methods. |
AutoMedEval: Harnessing Language Models for Automatic Medical Capability Evaluation (2025.acl-long)
Copied to clipboard
Xiechi Zhang, Zetian Ouyang, Linlin Wang, Gerard De Melo, Zhu Cao, Xiaoling Wang, Ya Zhang, Yanfeng Wang, Liang He
| Challenge: | Existing evaluation methods based on large language models (LLMs) are expensive and lack expertise due to limitations in human expertise. |
| Approach: | They propose an open-source automatic evaluation model with 13B parameters specifically engineered to measure the question-answering proficiency of medical LLMs. |
| Outcome: | The proposed model surpasses baselines in terms of correlation with human judgments. |
Emotionally Charged, Logically Blurred: AI-driven Emotional Framing Impairs Human Fallacy Detection (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing computational approaches focus on logical structures of fallacies and argumentation schemes, ignoring the emotional dimension of argumentation. |
| Approach: | They propose to use large language models to systematically change emotional appeals in fallacious arguments by using a computational approach. |
| Outcome: | The proposed method reduces fallacy detection by 14.5% on average on human arguments with enjoyment over fear or sadness. |
Towards More Fine-grained and Reliable NLP Performance Prediction (2021.eacl-main)
Copied to clipboard
| Challenge: | Performance prediction is a task of estimating a system’s performance without performing experiments. |
| Approach: | They propose to understand reliability of performance prediction models from two angles: confidence intervals and calibration. |
| Outcome: | The proposed methods demonstrate the feasibility of fine-grained performance prediction and the necessity to perform reliability analysis for performance prediction methods in the future. |
Thinking about how to extract: Energizing LLMs’ emergence capabilities for document-level event argument extraction (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing models for document-level event argument extraction (D-EAE) lack key feature forgetting and cross-event argument confusion. |
| Approach: | They propose a document-level event argument extraction method based on guided summarization and reasoning that leverages the emergence capabilities of large language models to highlight key event information. |
| Outcome: | The proposed method outperforms baseline models by 1.3% F1 and 1.6% F1 on WIKIEVENTS and RAMS. |
Multilingual Constituency Parsing with Self-Attention and Pre-Training (P19-1)
Copied to clipboard
| Challenge: | a range of pre-training conditions can be used for constituency parsing, but large model sizes make it expensive to train separate models for each language. |
| Approach: | They compare the benefits of no pre-training, fastText, ELMo, and BERT for English . they also find that pre- training is beneficial across all 11 languages tested . |
| Outcome: | The proposed model outperforms fastText, ELMo, and BERT for English . but large model sizes make it expensive to train separate models for each language . |
Improving Long Document Topic Segmentation Models With Enhanced Coherence Modeling (2023.emnlp-main)
Copied to clipboard
| Challenge: | Recent supervised neural models have greatly promoted the development of topic segmentation, but the deeper relationship between coherence and topic segmenting is underexplored. |
| Approach: | They propose to use topic-aware Sentence Structure Prediction and Contrastive Semantic Similarity Learning to capture coherence from logical structure and semantic similarity perspectives to further improve topic segmentation performance. |
| Outcome: | The proposed approach outperforms state-of-the-art methods on WIKI-727K and achieves an average relative reduction of 4.3% on Pk on WikiSection. |
arXiv2Table: Toward Realistic Benchmarking and Evaluation for LLM-Based Literature-Review Table Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Literature review tables are essential for summarizing and comparing collections of scientific papers. |
| Approach: | They propose to generate a database of literature review tables from a pool of papers and to model retrieval noise via semantically related but out-of-scope distractor papers verified by human annotators. |
| Outcome: | The proposed method improves over strong baselines while the absolute scores remain modest, underscoring the task’s difficulty. |
Effects of Naturalistic Variation in Goal-Oriented Dialog (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing benchmarks for end-to-end neural dialog systems lack a key component: natural variation. |
| Approach: | They propose new and more effective testbeds by introducing naturalistic variation by the user. |
| Outcome: | The proposed testbeds incorporate natural variation by the user. |
If You Want to Go Far Go Together: Unsupervised Joint Candidate Evidence Retrieval for Multi-hop Question Answering (2021.naacl-main)
Copied to clipboard
| Challenge: | et al. : evidence retrieval is highly dependent on partial, incorrect or no supporting knowledge. |
| Approach: | They propose a method that retrieves and reranks evidence facts jointly . they propose to account for links between sentences and coverage with the given query . |
| Outcome: | The proposed approach achieves state-of-the-art evidence retrieval performance on two multi-hop question answering datasets. |
Adapting Word Embeddings to New Languages with Morphological and Phonological Subword Representations (D18-1)
Copied to clipboard
| Challenge: | Existing approaches to generalization to resource-rich languages are difficult . a recent study shows that word representations can be useful in low resource languages . |
| Approach: | They propose two approaches for improving generalization to low-resource languages by adapting continuous word representations using linguistically motivated subword units. |
| Outcome: | The proposed method improves generalization to low resource languages . it requires neither parallel corpora nor bilingual dictionaries and requires no parallel training . |
Improving Multilingual Models with Language-Clustered Vocabularies (2020.emnlp-main)
Copied to clipboard
| Challenge: | State-of-the-art multilingual models depend on vocabularies that cover all languages . but the methods for generating those vocalaries are not ideal for massively multilingual applications. |
| Approach: | They propose a procedure for multilingual vocabulary generation that combines separately trained vocabularies of several automatically derived language clusters. |
| Outcome: | The proposed procedure shows improvements across languages on multilingual benchmark tasks . the proposed procedure reduces out-of-vocabulary rate by a factor of 8 . |
A Two-Stream AMR-enhanced Model for Document-level Event Argument Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing studies aim at extracting event arguments from a single sentence . document-level event extraction still remains under-explored . |
| Approach: | They propose a two-stream abstract meaning representation enhanced extraction model to extract event arguments from an entire document. |
| Outcome: | The proposed model outperforms state-of-the-art in extracting event arguments from documents by 2.54 F1 and 5.13 F1 on public RAMS and WikiEvents datasets. |
Causal Explanation Analysis on Social Media (D18-1)
Copied to clipboard
| Challenge: | Understanding causal explanations is an important psychological factor linked to physical and mental health. |
| Approach: | They propose to automate causal explanation analysis by building on discourse parsing and using a hierarchy of Bidirectional LSTMs to identify the specific phrase that is the explanation. |
| Outcome: | The proposed subtasks achieve strong accuracies but differ in their approaches . the proposed sub task is compared with the previous task and is able to identify the specific phrase that is the explanation. |
BioNLI: Generating a Biomedical NLI Dataset Using Lexico-semantic Constraints for Adversarial Examples (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Biomedical research has progressed at a tremendous pace, with PubMed2 indexing well over 1M publications per year in the past eight years. |
| Approach: | They propose a semi-supervised procedure that bootstraps biomedical NLI datasets from positive entailment examples present in biomedically published texts. |
| Outcome: | The proposed procedure bootstraps biomedical NLI datasets from positive entailment examples from biomedically challenging texts. |
MMUTF: Multimodal Multimedia Event Argument Extraction with Unified Template Filling (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent MEE methods focus on weak alignment strategies and data augmentation with simple classification models. |
| Approach: | They propose a unified template filling model that connects textual and visual modalities via textual prompts. |
| Outcome: | The proposed model surpasses the current SOTA on textual EAE by +7% F1 and performs generally better than the second-best systems for multimedia EAE. |
FinGEAR: Financial Mapping-Guided Enhanced Answer Retrieval (2025.findings-emnlp)
Copied to clipboard
| Challenge: | FinGEAR provides a retrieval framework tailored to financial documents . standard retrieval-augmented generation models underuse financial disclosures . |
| Approach: | FinGEAR combines a finance lexicon for Item-level guidance and hierarchical indices for within-Item search. |
| Outcome: | FinGEAR improves accuracy and accuracy on 10-Ks with a FinQA dataset. |
Wikontic: Constructing Wikidata-Aligned, Ontology-Aware Knowledge Graphs with Large Language Models (2026.eacl-long)
Copied to clipboard
| Challenge: | Knowledge graphs provide structured, verifiable grounding for large language models . current LLMs use KGs as auxiliary structures for text retrieval . |
| Approach: | They propose a pipeline that constructs KGs from open-domain texts using triplets and qualifiers. |
| Outcome: | The proposed pipeline outperforms existing methods in retrieval-augmented generation. |
PTCSpell: Pre-trained Corrector Based on Character Shape and Pinyin for Chinese Spelling Correction (2023.findings-acl)
Copied to clipboard
| Challenge: | Chinese spelling correction (CSC) is a task which detects incorrect characters in Chinese text and corrects them. |
| Approach: | They propose to pre-train a Chinese spelling correction corrector under the detector-corrector architecture and propose to capture pronunciation and shape information in Chinese characters. |
| Outcome: | The proposed corrector achieves an average of 5.8% F1 improvements over state-of-the-art methods, verifying its effectiveness. |
Programming in Natural Language with fuSE: Synthesizing Methods from Spoken Utterances Using Deep Natural Language Understanding (2020.acl-main)
Copied to clipboard
| Challenge: | a new approach to teach new functions from natural language is needed to make intelligent systems programmable in everyday language. |
| Approach: | They propose to use natural language to teach intelligent systems new functions . fuSE synthesizes method signatures and API calls from spoken utterances . |
| Outcome: | The proposed system synthesizes 84.6% of method signatures and 79.2% of API calls correctly on unseen dataset. |
Modeling Task Interactions in Document-Level Joint Entity and Relation Extraction (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing work on document-level relation extraction has focused on end-to-end setting that extracts global entities and relations jointly. |
| Approach: | They propose to introduce a two-way interaction between COREF and RE that is specifically designed to leverage task characteristics, bridging decisions of two tasks for direct task interference. |
| Outcome: | The proposed model achieves the best performance by up to 2.3/5.1 F1 over the baseline. |
Just Say No: Analyzing the Stance of Neural Dialogue Generation in Offensive Contexts (2021.emnlp-main)
Copied to clipboard
| Challenge: | despite progress toward data-driven conversational agents, dialogue models still suffer from issues surrounding safety and offensive language. |
| Approach: | They analyze reddit threads and reddits to determine the stance of offensive dialogue models . they find 42% of human responses agree with toxic comments, compared to 13% with safe comments . |
| Outcome: | The proposed model produces 29% fewer offensive replies than the baseline model. |
XAutoLM: Efficient Fine-Tuning of Language Models via Meta-Learning and AutoML (2025.emnlp-main)
Copied to clipboard
Ernesto Luis Estevanell Valladares, Suilan Estevez-Velarde, Yoan Gutierrez, Andrés Montoyo, Ruslan Mitkov
| Challenge: | XAutoLM is a meta-learning-augmented framework that can be used to optimize discriminative and generative LM fine-tuning pipelines. |
| Approach: | They propose a meta-learning-augmented AutoML framework that reuses past experiences to optimize discriminative and generative LM fine-tuning pipelines efficiently. |
| Outcome: | XAutoLM surpasses zero-shot optimizer’s peak F1 on five of six tasks, reduces mean evaluation time of pipelines by up to 4.5x, and uncovers 50% more pipelines above zero- shot Pareto front. |
Few-shot clinical entity recognition in English, French and Spanish: masked language models outperform generative model prompting (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) is a critical task in information extraction that is not covered in recent benchmarks. |
| Approach: | They compare 13 auto-regressive models using prompting and 16 masked models using fine-tuning on 14 NER datasets covering English, French and Spanish. |
| Outcome: | The proposed models outperform auto-regressive models in English, French and Spanish on 14 NER datasets. |
Cross-topic Argument Mining from Heterogeneous Sources (D18-1)
Copied to clipboard
| Challenge: | Argument mining is a core technology for automating argument search in document collections. |
| Approach: | They propose a new sentential annotation scheme that is reliably applicable by crowd workers to arbitrary Web texts. |
| Outcome: | The proposed scheme outperforms vanilla BiLSTMs in two- and three-label cross-topic settings and can be further improved by leveraging additional data for topic relevance using multi-task learning. |
Decorate the Examples: A Simple Method of Prompt Design for Biomedical Relation Extraction (2022.lrec-1)
Copied to clipboard
| Challenge: | Recent research shows that prompt-based learning improves performance on relation extraction tasks. |
| Approach: | They propose a prompt-based learning method that generates comprehensive prompts for biomedical relation extraction using a ChemProt dataset. |
| Outcome: | The proposed method improves fine-tuning on a biomedical relation extraction task with a cloze-test task and fewer training examples to make reasonable predictions. |
Rethinking Complex Neural Network Architectures for Document Classification (N19-1)
Copied to clipboard
| Challenge: | Neural network models for many NLP tasks have grown increasingly complex in recent years . authors of recent papers question the necessity of such architectures and find them quite effective . |
| Approach: | They propose to use regularization techniques borrowed from language modeling to improve model accuracy . they find that a simple biLSTM architecture with appropriate regularization yields competitive results . |
| Outcome: | a simple biLSTM model outperforms the state-of-the-art on four benchmark datasets . authors say that improvements are not real, but are attributed to mundane reasons . |
GlotLID: Language Identification for Low-Resource Languages (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing web-mined datasets for low-resource languages have been useful for low resource NLP. |
| Approach: | They propose a model that identifies 1665 low-resource languages and a new model that is rigorously evaluated and reliable. |
| Outcome: | The proposed model outperforms baselines when balancing F1 and false positive rate (FPR). |
A Unified Linear-Time Framework for Sentence-Level Discourse Parsing (P19-1)
Copied to clipboard
| Challenge: | a new neural framework for sentence-level discourse analysis is proposed . a discourse segmenter and a parser are based on pointer networks and operate in linear time . |
| Approach: | They propose a neural framework for sentence-level discourse analysis in accordance with Rhetorical Structure Theory . they use a discourse segmenter and a parser to construct a discursive tree in a top-down fashion . |
| Outcome: | The proposed framework surpasses previous approaches on both tasks and human agreement on both. |
Compositional Questions Do Not Necessitate Multi-hop Reasoning (P19-1)
Copied to clipboard
| Challenge: | a single-hop reasoning model can solve much more of the dataset than previously thought. |
| Approach: | They propose a single-hop BERT-based RC model that achieves 67 F1 . they propose an evaluation setting where humans are not shown all paragraphs . |
| Outcome: | The proposed model achieves 67 F1—comparable to state-of-the-art multi-hop models. |
COMI-LINGUA: Expert Annotated Large-Scale Dataset for Multitask NLP in Hindi-English Code-Mixing (2025.findings-emnlp)
Copied to clipboard
| Challenge: | COMI-LINGUA is the largest manually annotated Hindi-English code-mixed dataset . 125K+ high-quality instances across five core NLP tasks are annotating by three bilingual annotators . |
| Approach: | COMI-LINGUA is the largest manually annotated Hindi-English code-mixed dataset . 125K+ high-quality instances are annotating by three bilingual annotators . |
| Outcome: | The dataset covers five core NLP tasks, including Token-level Language Identification, Matrix Language Identification and Named Entity Recognition. |
Taxonomy Expansion for Named Entity Recognition (2023.emnlp-main)
Copied to clipboard
Karthikeyan K, Yogarshi Vyas, Jie Ma, Giovanni Paolini, Neha John, Shuai Wang, Yassine Benajiba, Vittorio Castelli, Dan Roth, Miguel Ballesteros
| Challenge: | Training a Named Entity Recognition model involves fixing a taxonomy of entity types . however, requirements evolve and a model may need to recognize additional entity types. |
| Approach: | They propose a method that uses only partially annotated datasets to train a model to recognize additional entity types. |
| Outcome: | The proposed approach performs better with partially annotated datasets than other approaches . the gap between the proposed approach and other approaches is large in additional datasets . |
Biomedical Event Extraction as Sequence Labeling (2020.emnlp-main)
Copied to clipboard
| Challenge: | Empirical results show that BeeSL’s speed and accuracy makes it a viable approach for large-scale real-world scenarios. |
| Approach: | They propose a joint end-to-end neural information extraction model that recasts the task as sequence labeling and jointly models intermediate tasks via multi-task learning. |
| Outcome: | Empirical results show that BeeSL outperforms the current best system on the Genia 2011 benchmark by 1.57% absolute F1 score reaching 60.22% F1 . |
Semi-supervised Training Data Generation for Multilingual Question Answering (L18-1)
Copied to clipboard
| Challenge: | Existing datasets for question answering (QA) tasks mostly support only English . however, existing resources for these tasks are labor intensive . |
| Approach: | They propose to combine Korean QA datasets with machine-translated English resources to build seed resources. |
| Outcome: | The proposed approach leads to 71.50 F1 on Korean QA (comparable to 77.3 F1) |
Validity Assessment of Legal Will Statements as Natural Language Inference (2022.findings-emnlp)
Copied to clipboard
| Challenge: | This study introduces a dataset that focuses on the validity of statements in legal wills. |
| Approach: | They propose a dataset that focuses on the validity of statements in legal wills. |
| Outcome: | The proposed model achieves 80% macro F1 and accuracy, but group accuracy is in mid 80s at best, suggesting that the models’ understanding of the task remains superficial. |
Distinguishing Between Foreground and Background Events in News (2020.coling-main)
Copied to clipboard
| Challenge: | a new task is needed to distinguish between foreground and background events in news articles . |
| Approach: | They propose a task of distinguishing between foreground and background events in news articles . they also identify the general temporal position of background events relative to the foregoing period . |
| Outcome: | The proposed model achieves good performance on a dataset of news articles . |
GECOR: An End-to-End Generative Ellipsis and Co-reference Resolution Model for Task-Oriented Dialogue (D19-1)
Copied to clipboard
| Challenge: | Ellipsis and co-reference are common and ubiquitous especially in multi-turn dialogues. |
| Approach: | They propose a unified end-to-end Generative Ellipsis and CO-reference Resolution model . the model can generate a new pragmatically complete user utterance by alternating the generation and copy mode for each user . |
| Outcome: | The proposed model can generate a new pragmatically complete user utterance by alternating the generation and copy mode for each user . intrinsic evaluations on the resolution of ellipsis and co-reference show that the model outperforms the baseline model in terms of EM, BLEU and F1 . |
Detecting Subevents using Discourse and Narrative Features (P19-1)
Copied to clipboard
| Challenge: | Existing models for detecting events as subevents have been developed for analyzing textual understanding. |
| Approach: | They propose a supervised model that automatically identifies when one event is a subevent of another. |
| Outcome: | The proposed model outperforms previous systems on two annotated corpora with event hierarchies, achieving 0.74 BLANC F1 on the Intelligence Community corpus and 0.70 F1 for the HiEve corpus, respectively a 15 and 5 percentage point improvement over previous models. |
Why Swear? Analyzing and Inferring the Intentions of Vulgar Expressions (D18-1)
Copied to clipboard
| Challenge: | Vulgar words are employed in language use for several different functions, including expressing aggression, signaling group identity or the informality of the communication. |
| Approach: | They present a dataset of 7,800 tweets with six categories of vulgarity in which all instances of vulgar words are annotated with one of the six categories. |
| Outcome: | The proposed model can predict the category of a vulgar word based on the immediate context it appears in with 67.4 macro F1 across six classes. |
When Morphology Hides in Plain Sight: Breaking the Isolation in Vietnamese and Beyond (2026.acl-long)
Copied to clipboard
| Challenge: | Adaptive Boundary-Token Fusion and a Morpheme-Aware Attention Bias are used to encode monosyllabic morphemes. |
| Approach: | They propose a morpheme-aware Transformer that augments a pretrained Vietnamese encoder with two lightweight inductive biases. |
| Outcome: | The proposed morpheme-aware Transformer outperforms strong baselines on Vietnamese POS, NER, and sentence-level classification benchmarks. |
Learn to Resolve Conversational Dependency: A Consistency Training Framework for Conversational Question Answering (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches do not explicitly train QA models on how to resolve conversational dependency, and thus these models are limited in understanding human dialogues. |
| Approach: | They propose a framework that generates self-contained questions that can be understood without the conversation history and then trains a QA model with the pairs of original and self-constructed questions using a consistency-based regularizer. |
| Outcome: | The proposed framework improves the models’ performance by up to 1.2 F1 on QuAC, and 5.2 F1 for CANARD, while addressing the limitations of the existing approaches. |
Exploring Data Augmentation Strategies for Hate Speech Detection in Roman Urdu (2022.lrec-1)
Copied to clipboard
| Challenge: | a number of social media platforms are generating hateful content, a new study finds . augmentation techniques are needed to improve the performance of the models . |
| Approach: | They evaluate different data augmentation techniques for the improvement of hate speech detection in Roman Urdu. |
| Outcome: | The proposed techniques improve hate speech detection in Roman Urdu on two datasets. |
Unsupervised Question Answering by Cloze Translation (P19-1)
Copied to clipboard
| Challenge: | Existing QA datasets only available for limited domains and languages. |
| Approach: | They propose to generate context, question and answer triples in an unsupervised manner and synthesize extractive QA training data automatically. |
| Outcome: | The proposed approach outperforms existing QA models on a common EQA benchmark dataset. |
FewshotQA: A simple framework for few-shot learning of question answering tasks using pre-trained text-to-text models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing pre-trained models need fine-tuning on tens of thousands of examples to achieve good results. |
| Approach: | They propose a framework that leverages pre-trained text-to-text models and aligns them with their pre-training framework. |
| Outcome: | The proposed framework outperforms the XLM-Roberta-large on multiple QA benchmarks and is applicable to multilingual situations. |
Mitigating False-Negative Contexts in Multi-document Question Answering with Retrieval Marginalization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Question Answering models typically use retrieval and reasoning components to identify relevant information for reasoning. |
| Approach: | They propose a retrieval parameterization method that marginalizes unanswerable queries . they show that marginalization allows a model to mitigate false negatives in annotations . |
| Outcome: | The proposed model improves on two multi-document question answering datasets and shows that marginalization improves performance. |
Question Answering for Privacy Policies: Combining Computational and Legal Perspectives (D19-1)
Copied to clipboard
| Challenge: | Privacy policies are long and complex documents that are difficult for users to read and understand. |
| Approach: | They present a corpus of 1750 questions about privacy policies of mobile applications and over 3500 expert annotations of relevant answers. |
| Outcome: | The proposed corpus of 1750 questions on privacy policies shows that a strong neural baseline underperforms human performance by almost 0.3 F1 on PrivacyQA. |
NexusSum: Hierarchical LLM Agents for Long-Form Narrative Summarization (2025.acl-long)
Copied to clipboard
| Challenge: | Summarizing long-form narratives requires capturing intricate plotlines, character interactions, and thematic coherence over tens of thousands of tokens. |
| Approach: | They propose a multi-agent LLM framework for narrative summarization that processes long-form text through a structured pipeline without fine-tuning. |
| Outcome: | The proposed framework achieves 30.0% improvement in BERTScore across books, movies, and TV scripts. |
Random Splitting Negatively Impacts NER Evaluation: Quantifying and Eliminating the Overestimation of NER Performance (2025.findings-acl)
Copied to clipboard
| Challenge: | Named entity recognition models are evaluated on their ability to identify entity mentions in text. |
| Approach: | They propose a method to reduce the amount of entity contamination in NER datasets by a minimum cut algorithm. |
| Outcome: | The proposed method minimizes train-test entity leakage while ensuring near zero entity contamination. |
Effects of Human Adversarial and Affable Samples on BERT Generalization (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Limiting quantities of training data is considered a key impediment to achieving generalizability in machine learning. |
| Approach: | They examine the impact of training data quality, not quantity, on a model’s generalizability by comparing human-adversarial and human-affable training samples. |
| Outcome: | The proposed model performance improves with 10-30% h-adversarial instances in text classification and relation extraction tasks. |
A Dataset for Tracking Entities in Open Domain Procedural Text (2020.emnlp-main)
Copied to clipboard
Niket Tandon, Keisuke Sakaguchi, Bhavana Dalvi, Dheeraj Rajagopal, Peter Clark, Michal Guerquin, Kyle Richardson, Eduard Hovy
| Challenge: | Existing tasks require only a small set of attributes to track state changes in procedural text. |
| Approach: | They propose a task where given a procedural text as input, the task is to generate a set of state change tuples for each step. |
| Outcome: | The proposed task generates state change tuples from a set of pre-defined attributes for each step and predicts them from an open vocabulary. |
Efficient One-Pass End-to-End Entity Linking for Questions (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for entity linking are limited to entity disambiguation and require mention boundaries to be given in the input. |
| Approach: | They propose a fast end-to-end entity linking model that uses a biencoder to jointly detect mentions and link in one pass. |
| Outcome: | The proposed model outperforms the current state of the art on WebQSP and GraphQuestions with extended annotations that cover multiple entities per question. |
Improving Low-Resource Named Entity Recognition using Joint Sentence and Token Labeling (2020.acl-main)
Copied to clipboard
| Challenge: | Existing models for named entity recognition (NER) use sentence-level labels, which are expensive to obtain, to improve NER. |
| Approach: | They propose a sentence-level named entity recognition model that uses sentence-based labels that are easy to obtain. |
| Outcome: | The proposed model produces 3.78%, 4.20%, 2.08% improvements in F1 over the baseline on e-commerce product titles in Vietnamese, Thai, and Indonesian, respectively. |
A Hmong Corpus with Elaborate Expression Annotations (2022.lrec-1)
Copied to clipboard
| Challenge: | SCH is the first substantial corpus to be annotated for elaborate expressions . a plurality of speakers are located in China, but many Hmong speakers left Laos as refugees . |
| Approach: | They describe the first publicly available corpus of Hmong, a minority language of China, Vietnam, Laos, Thailand, and various countries in Europe and the Americas. |
| Outcome: | The first publicly available corpus of Hmong is scraped from a long-running Usenet newsgroup . it is the first substantial corpus to be annotated for elaborate expressions . |
Topic-Aware Response Generation in Task-Oriented Dialogue with Unstructured Knowledge Access (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Experimental results indicate that TARG achieves state-of-the-art performance in knowledge selection and response generation, outperforming previous state- of-the art by 3.2, 3.6, and 4.2 points in EM, F1 and BLEU-4 respectively on Doc2Dial. |
| Approach: | They propose to integrate topical information into knowledge-grounded task-oriented dialogue systems by using multiple topic-aware attention mechanisms to derive the importance weighting scheme over dialogue utterances and external knowledge sources. |
| Outcome: | The proposed model outperforms existing models in knowledge selection and response generation. |
A Straightforward Approach to Narratologically Grounded Character Identification (2020.coling-main)
Copied to clipboard
| Challenge: | Existing definitions of character are based on simplified or implicit definitions that do not capture essential distinctions between characters and other referents in narratives. |
| Approach: | They propose a narratologically grounded definition of character that is based on clear narrological principles and annotated 170 narrative texts. |
| Outcome: | The proposed definition of character is based on clear narratological principles and can be reliably annotated (0.78 Cohen’s ). |
Constructing a Lexicon of Relational Nouns (L18-1)
Copied to clipboard
| Challenge: | Existing systems for extracting relations expressed using nouns do not exist for relational noun. |
| Approach: | They contribute a lexicon of 6,224 labeled nouns which includes 1,446 relational noun. |
| Outcome: | The proposed classifier achieves 70.4% F1 on held out nouns among the most common 2,500 word types in Gigaword. |
Boosting Cross-Lingual Transfer via Self-Learning with Uncertainty Estimation (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent pre-trained language models have achieved remarkable zero-shot performance . we propose a self-learning framework that utilizes unlabeled data of target languages . |
| Approach: | They propose a self-learning framework that utilizes unlabeled data of target languages to select silver labels for cross-lingual transfer tasks. |
| Outcome: | The proposed framework outperforms baseline models on two cross-lingual tasks by 10 F1 on average and 2.5 accuracy on natural language inference (NLI). |
Towards Semi-Supervised Learning for Deep Semantic Role Labeling (D18-1)
Copied to clipboard
| Challenge: | Existing methods for semantic role labeling require an immense amount of semantic-role corpora and are therefore not suitable for low-resource languages or domains. |
| Approach: | They propose a semi-supervised method that outperforms the state-of-the-art on SRL . method explicitly enforcs syntactic constraints by augmenting the training objective with a syntastic-inconsistency loss component. |
| Outcome: | The proposed method outperforms the state-of-the-art on limited SRL training corpora on CoNLL-2012 English section. |
Enhancing Noise Robustness of Retrieval-Augmented Language Models with Adaptive Adversarial Training (2024.acl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) exhibit substantial capabilities yet face challenges such as hallucination, outdated knowledge, and untraceable reasoning processes. |
| Approach: | They propose a retrieval-augmented generation approach that leverages adaptive adversarial training to dynamically adjust the model’s training process in response to retrieval noises. |
| Outcome: | The proposed approach improves the performance of the LLaMA-2 7B model under diverse noise conditions. |
Chain-of-Questions Training with Latent Answers for Robust Multistep Question Answering (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for multistep question answering have shown promise in generating multistep solutions, but they lack robustness. |
| Approach: | They propose a framework that trains a model to robustly answer multistep questions by generating and answering sub-questions. |
| Outcome: | The proposed framework outperforms neuro-symbolic methods on a DROP contrast set and GPT-3.5 on QA adversarial sets. |
KnowledgeBerg: Evaluating Systematic Knowledge Coverage and Compositional Reasoning in Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing LLMs lack systematic coverage of a bounded knowledge universe and compositional set-based reasoning over that universe. |
| Approach: | They propose a benchmark for multiple-choice questions based on 1,183 enumeration seeds . they use knowledge width, cardinality of required universe, reasoning depth to formalize the challenge . |
| Outcome: | The proposed benchmarks achieve only 5.26–36.88 F1 on universe enumeration and 16.00–44.19 accuracy on knowledge-grounded reasoning. |
Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference (2020.acl-main)
Copied to clipboard
| Challenge: | Using custom architectures, constituency parsers are limited and require specialized hardware. |
| Approach: | They propose an algorithm that assigns labels to each word in a sentence in parallel and then performs a reconciliation phase to extract a tree in (empirically) linear time. |
| Outcome: | The proposed model achieves 95.4 F1 on the WSJ test set while also achieving substantial speedups compared to current state-of-the-art parsers with comparable accuracies. |
ScienceExamCER: A High-Density Fine-Grained Science-Domain Corpus for Common Entity Recognition (2020.lrec-1)
Copied to clipboard
| Challenge: | Named entity recognition identifies common classes of noun phrases in text, but these entity labels are sparse, limiting utility to downstream tasks. |
| Approach: | They propose a name-based named entity recognition model that annotates all content words with a fine-grained semantic class label. |
| Outcome: | The proposed model achieves 0.85 F1 on the science exam domain domain . the proposed model is a powerful tool for question answering and inference . |
Guiding LLM to Fool Itself: Automatically Manipulating Machine Reading Comprehension Shortcut Triggers (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Recent applications of LLMs in Machine Reading Comprehension systems have shown impressive results, but the use of shortcuts has emerged as a potential threat to their reliability. |
| Approach: | They propose a framework that guides an editor to add potential shortcuts-triggers to samples. |
| Outcome: | The proposed framework can edit trigger shortcuts in samples that fool LLMs . it also shows that GPT4 can be deceived by its own edits (15% drop in F1). |
Compositional and Lexical Semantics in RoBERTa, BERT and DistilBERT: A Case Study on CoQA (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing knowledge transfer models do not exploit compositionality of language, often relying on superficial features. |
| Approach: | They propose to use a knowledge distillation technique to fine tune RoBERTa, BERT and DistilBERT models to improve their performance. |
| Outcome: | The proposed models improve on the CoQA task with linguistic knowledge and are able to represent compositional and lexical information. |
F1 is Not Enough! Models and Evaluation Towards User-Centered Explainable Question Answering (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models and evaluation settings have shortcomings regarding the coupling of answer and explanation which might cause serious issues in user experience. |
| Approach: | They propose a hierarchical model and a new regularization term to strengthen the coupling of answer and explanation and two evaluation scores to quantify the couple. |
| Outcome: | The proposed model strengthens the answer-explanation coupling and provides evaluation scores that align with user experience. |
Learning Co-Speech Gesture for Multimodal Aphasia Type Detection (2023.emnlp-main)
Copied to clipboard
| Challenge: | Aphasia is a language disorder caused by brain damage affecting speech functions . a detailed diagnosis of aphasia type is imperative for effective treatment . but, little attention has been paid to developing methods to detect different types of sphasis . |
| Approach: | They propose a multimodal graph neural network for aphasia type detection using co-speech gestures and corresponding speech and gesture patterns. |
| Outcome: | The proposed model outperforms existing methods in F1 and 84.2% of cases. |
A Contrastive Cross-Channel Data Augmentation Framework for Aspect-Based Sentiment Analysis (2022.coling-1)
Copied to clipboard
| Challenge: | Aspect-based sentiment analysis is sensitive to multi-aspect challenges, resulting in multiple aspects in a sentence. |
| Approach: | They propose a framework that leverages an in-domain generator to construct more multi-aspect samples . they then boost the robustness of ABSA models via contrastive learning on these generated samples ." |
| Outcome: | The proposed framework outperforms baselines without any augmentations on accuracy and Macro- F1 . the proposed framework can generate more multi-aspect samples and boost the robustness of ABSA models . |
Merge and Label: A Novel Neural Network Architecture for Nested NER (P19-1)
Copied to clipboard
| Challenge: | Named entity recognition (NER) is one of the best studied tasks in natural language processing. |
| Approach: | They propose a neural network architecture that merges tokens and/or entities into nested entities and labels them independently. |
| Outcome: | The proposed approach achieves state-of-the-art F1 of 74.6 and improves with contextual embeddings to 82.4. |
Explicit over Implict: Explicit Diversity Conditions for Effective Question Answer Generation (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent pretrained and large language model-based QAG methods suffer from redundant generation of QA pairs, affecting downstream QA systems. |
| Approach: | They propose to use explicit diversity conditions to generate diverse question-answer synthetic data by focusing on spatial aspects, question types, and entities. |
| Outcome: | The proposed diversity conditions significantly increase diversity in QA generation over existing diversity techniques. |
RikiNet: Reading Wikipedia Pages for Natural Question Answering (2020.acl-main)
Copied to clipboard
| Challenge: | Using Wikipedia pages to answer open-domain questions remains challenging in natural language understanding. |
| Approach: | They propose a model which reads Wikipedia pages for natural question answering . it uses a dynamic paragraph dual-attention reader and a cascaded answer predictor . |
| Outcome: | The proposed model outperforms the human model on the Natural Questions dataset . it achieves 74.3 F1 and 57.9 F1 on long-answer and short-answer tasks . |
Quoref: A Reading Comprehension Dataset with Questions Requiring Coreferential Reasoning (D19-1)
Copied to clipboard
| Challenge: | Existing reading comprehension benchmarks do not contain complex coreferential phenomena . obtaining questions focused on such phenomena is difficult because of lexical cues . |
| Approach: | They propose to use a crowdsourced dataset to examine the ability of models to resolve coreference among entities in Wikipedia paragraphs. |
| Outcome: | The proposed model performs significantly worse than humans on the reading comprehension benchmark . paragraphs and other longer texts typically make multiple references to the same entities . |
COMMA-DEER: COmmon-sense Aware Multimodal Multitask Approach for Detection of Emotion and Emotional Reasoning in Conversations (2022.coling-1)
Copied to clipboard
| Challenge: | Mental health is a critical component of the United Nations’ Sustainable Development Goals (SDGs), particularly Goal 3 which aims to provide “good health and well-being”. |
| Approach: | They propose a task of detecting emotional reasoning and accompanying emotions in conversations that is manually annotated at the utterance level. |
| Outcome: | The proposed model achieves 6% accuracy and 4.62% accuracy on the emotion detection task and 3.56% accuracy, and 3.31% F1 on the ER detection task, compared to the existing state-of-the-art model. |
Extracting Social Determinants of Health from Pediatric Patient Notes Using Large Language Models: Novel Corpus and Methods (2024.lrec-main)
Copied to clipboard
Yujuan Fu, Giridhar Kaushik Ramachandran, Nicholas J. Dobbins, Namu Park, Michael Leu, Abby R. Rosenberg, Kevin Lybarger, Fei Xia, Özlem Uzuner, Meliha Yetisgen
| Challenge: | Social determinants of health (SDoH) are often studied in the electronic health record (EHR) however, there are difficulties in documenting SDoH in a tabular format due to the lack of a comprehensive SDoh tool. |
| Approach: | They propose to annotate social history sections from 1,260 clinical notes from pediatric patients within the University of Washington (UW) hospital system. |
| Outcome: | The proposed corpus captures ten distinct health determinants including living and economic stability, prior trauma, education access, substance use history, and mental health with an overall annotator agreement of 81.9 F1. |
Synthetic QA Corpora Generation with Roundtrip Consistency (P19-1)
Copied to clipboard
| Challenge: | Existing methods for generating synthetic question answering corpora are not suitable for QA, but can be constructed from widely available natural text. |
| Approach: | They propose a method for generating synthetic question answering corpora by combining question generation and answer extraction models and filtering the results to ensure roundtrip consistency. |
| Outcome: | The proposed model achieves exact match and F1 at less than 0.1% and 0.4% from human performance on SQuAD2 and NQ. |
FaiMA: Feature-aware In-context Learning for Multi-domain Aspect-based Sentiment Analysis (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for aspect-based sentiment analysis are limited and integrating with existing techniques is difficult. |
| Approach: | They propose a framework that utilizes in-context learning as a feature-aware mechanism that facilitates adaptive learning in multi-domain ABSA tasks. |
| Outcome: | The proposed framework achieves significant performance improvements in multiple domains compared to baselines, increasing F1 by 2.07% on average. |
How to Make LLMs Forget: On Reversing In-Context Knowledge Edits (2025.naacl-long)
Copied to clipboard
| Challenge: | In-context knowledge editing (IKE) is an efficient and efficient knowledge editing method (Zheng et al., 2022b; Gangadhar and Stratos, 2024) it can be misused to manipulate responses opaquely, e.g., insert misinformation or offensive content. |
| Approach: | They propose to detect and reverse IKE-edits using only the top-10 output probabilities of the next token, even in a black-box setting. |
| Outcome: | The proposed method can be detected with high accuracy even in a black-box setting, achieving over 80% accuracy in recovering original, unedited outputs across multiple LLMs. |
Improving Large-scale Paraphrase Acquisition and Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing Twitter-based paraphrase datasets lack quality definitions for identification and generation tasks. |
| Approach: | They propose to use two separate definitions of paraphrase for identification and generation tasks in existing Twitter-based paraphrase datasets. |
| Outcome: | The proposed model achieves state-of-the-art performance of 84.2 F1 for automatic paraphrase identification compared to other models fine-tuned on other corpora such as Quora, MSCOCO, and ParaNMT. |
arXivEdits: Understanding the Human Revision Process in Scientific Writing (2022.emnlp-main)
Copied to clipboard
| Challenge: | a new computational framework is developed to study text revision in scientific writing . authors propose a method to extract revision at document-, sentence-, and word-levels . |
| Approach: | They propose a computational framework for studying text revision in scientific writing . arXivEdits is an annotated corpus of 751 full papers from arX . authors propose to use sentence alignment, fine-grained edits and intents to extract revision . |
| Outcome: | The proposed framework can be used to study revision in scientific writing. |
GDA: Generative Data Augmentation Techniques for Relation Extraction Tasks (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing work adopts data augmentation techniques to generate pseudo-annotated sentences . existing methods neither preserve semantic consistency of original sentences nor preserve syntax structure of sentences when expressing relations using seq2seq models, resulting in less diverse augmentations. |
| Approach: | They propose a dedicated augmentation technique for relational texts, named GDA, which uses two complementary modules to preserve both semantic consistency and syntax structures. |
| Outcome: | The proposed technique can bring 2.0% F1 improvements in three datasets under low-resource setting. |
GAProtoNet: A Multi-head Graph Attention-based Prototypical Network for Interpretable Text Classification (2025.coling-main)
Copied to clipboard
| Challenge: | Existing models with black-box nature obscure decision-making process and lack interpretability. |
| Approach: | They propose a multi-head graph attention-based prototypical network that uses a vector and prototypes to learn an interpretable prototypical representation. |
| Outcome: | The proposed model achieves superior results without sacrificing the accuracy of the original black-box LMs. |
Graph Algorithms for Multiparallel Word Alignment (2021.emnlp-main)
Copied to clipboard
Ayyoob ImaniGooghari, Masoud Jalili Sabet, Lutfi Kerem Senel, Philipp Dufter, François Yvon, Hinrich Schütze
| Challenge: | Word alignments are useful for typological research and can be used in machine translation systems. |
| Approach: | They propose to exploit the multiparallelity of parallel corpora by representing bilingual alignments as a graph and then predicting additional edges. |
| Outcome: | The proposed algorithm improves the accuracy of bilingual alignments by 28% over baseline algorithms. |
An Iteratively Parallel Generation Method with the Pre-Filling Strategy for Document-level Event Extraction (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to generate event roles require a given generation order . parallel methods suffer from inadequate training and manifest zero accuracies on some event roles. |
| Approach: | They propose an iteratively parallel generation method with the Pre-Filling strategy to generate event roles in parallel to avoid order selection. |
| Outcome: | The proposed method outperforms other entity-enhanced models and achieves state-of-the-art performance on two public datasets. |
Automatic Spanish Translation of SQuAD Dataset for Multi-lingual Question Answering (2020.lrec-1)
Copied to clipboard
| Challenge: | Existing methods to train multilingual QA systems are limited for other languages . cross-lingual learning is a technique that transfers knowledge from source to target language with fewer training data. |
| Approach: | They propose a translation method to translate the Stanford Question Answering Dataset to Spanish and a multilingual-BERT model to train Spanish QA systems. |
| Outcome: | The proposed method outperforms the previous benchmarks for cross-lingual extractive QA. |
Innovative Image Fraud Detection with Cross-Sample Anomaly Analysis: The Power of LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for document image fraud detection lack visual clues on tampered regions. |
| Approach: | They propose a framework for detecting logical inconsistencies in document images by leveraging LLMs. |
| Outcome: | The proposed framework outperforms state-of-the-art fraud detection methods by 79.6% on CrossCred and industrial solutions by 21.7% on business data. |
LLM-TOPLA: Efficient LLM Ensemble by Maximising Diversity (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Extensive evaluation of modern large language models shows performance gain over component LLMs. |
| Approach: | They propose a diversityoptimized LLM ensemble method with three unique properties . they introduce the focal diversity metric to capture diversityperformance correlation . |
| Outcome: | The proposed method outperforms the best-performing ensemble on four benchmarks. |
Hints on the data for language modeling of synthetic languages with transformers (2023.acl-long)
Copied to clipboard
| Challenge: | Language Models (LMs) are becoming more useful for providing representations for NLP applications. |
| Approach: | They evaluated whether the critical amount of data varies for different morphological typologies . they found that the size of the vocabulary due to morphology is directly correlated with LM perplexity . |
| Outcome: | The proposed method reduces perplexity by more than a half for a polysynthetic language like Quechua . |
Neural CRF Model for Sentence Alignment in Text Simplification (2020.acl-main)
Copied to clipboard
| Challenge: | Text simplification systems are based on the quality and quantity of complex-simple sentence pairs extracted by aligning sentences between parallel articles. |
| Approach: | They propose a neural CRF alignment model which leverages the sequential nature of sentences in parallel documents and utilizes a sentence pair model to capture semantic similarity. |
| Outcome: | The proposed model outperforms previous work on monolingual sentence alignment task by more than 5 points in F1. |
Is Multihop QA in DiRe Condition? Measuring and Reducing Disconnected Reasoning (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing models exploit dataset artifacts to produce correct answers without connecting information across multiple facts. |
| Approach: | They formalize disconnected reasoning across subsets of supporting facts to reduce disconnected reasoning . they propose an automatic transformation of existing datasets that reduces disconnected reasoning. |
| Outcome: | The proposed model-agnostic probe reduces disconnected reasoning in a reading comprehension setting. |
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context. |
| Approach: | They propose to use a knowledge graph to extract query-relevant information from unstructured text. |
| Outcome: | The proposed method achieves performance improvements on two popular datasets. |
SUMIE: A Synthetic Benchmark for Incremental Entity Summarization (2025.coling-main)
Copied to clipboard
| Challenge: | Existing datasets that test incrementally update entity summaries are lacking. |
| Approach: | They propose a fully synthetic dataset that exposes real-world IES challenges by generating diverse attributes, summaries, and unstructured paragraphs with 99% alignment accuracy. |
| Outcome: | The proposed dataset shows that state-of-the-art LLMs struggle to update summaries with an F1 higher than 80.4%. |
ZeroShotCeres: Zero-Shot Relation Extraction from Semi-Structured Webpages (2020.acl-main)
Copied to clipboard
| Challenge: | Existing work on information extraction from semi-structured websites has relied on manual data annotation and learning a model specific to a given template. |
| Approach: | They propose a solution for “zero-shot” open-domain relation extraction from webpages with previously unseen templates using a graph neural network-based approach. |
| Outcome: | The proposed model provides a 31% gain over baseline for zero-shot extraction in a new subject vertical. |
How to Do Politics with Words: Investigating Speech Acts in Parliamentary Debates (2024.lrec-main)
Copied to clipboard
| Challenge: | a new perspective on framing through the lens of speech acts investigates how politicians make use of different pragmatic speech act functions in political debates. |
| Approach: | They propose a new framework for framing through the lens of speech acts and an annotation scheme for political debates. |
| Outcome: | The proposed framework can predict speech acts with an avg. F1 of around 82.0% . the proposed framework is based on a dataset of German parliamentary debates . |
TXtract: Taxonomy-Aware Knowledge Extraction for Thousands of Product Categories (2020.acl-main)
Copied to clipboard
| Challenge: | State-of-the-art methods for knowledge extraction are designed for a single category of product, but do not apply to real-life e-Commerce scenarios. |
| Approach: | They propose a taxonomy-aware knowledge extraction model that applies to thousands of categories organized in a hierarchical taxonomies. |
| Outcome: | The proposed model outperforms state-of-the-art methods on 4,000 categories in F1 and 15% across all categories. |
Topic-Guided Sampling For Data-Efficient Multi-Domain Stance Detection (2023.acl-long)
Copied to clipboard
| Challenge: | Stance Detection is a task that aims to identify the attitudes of an author towards a target of interest. |
| Approach: | They propose a topic-guided diversity sampling technique and a contrastive objective to improve stance detection using the produced set. |
| Outcome: | The proposed method outperforms the state-of-the-art on 16 datasets with in-domain and out-of domain evaluations and is more generalizable with an averaged 10.2 F1 on out-domain evaluation. |
Impact of Task Adapting on Transformer Models for Targeted Sentiment Analysis in Croatian Headlines (2024.lrec-main)
Copied to clipboard
| Challenge: | BERT models are often taken off-the-shelf and fine-tuned on a downstream task. |
| Approach: | They propose an extra stage of self-supervised task-adaptive pre-training to perform a task on a number of Croatian-supporting Transformer models. |
| Outcome: | The proposed approach improves performance across multilingual models but not in Croatian-dominant models. |
QueryLink: Leveraging Query-Memory Alignment for Long-Term Reasoning in LLM Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to integrating external memory prioritize memory organization while overlooking a critical semantic gap between implicit, intent-driven queries and explicit, narrative-based memories. |
| Approach: | They propose a framework that leverages Query-Memory Alignment to project both queries and memories into a shared semantic space. |
| Outcome: | The proposed framework significantly outperforms SOTA methods on the LoCoMo and LongMemEval benchmarks and can be integrated as a plug-and-play component to boost existing vector-based systems like A-MEM. |
Do “English” Named Entity Recognizers Work Well on Global Englishes? (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Most of English named entity recognition datasets contain American or British English data . multiple problems may occur in low-resource English contexts, such as confusion of named entities with regionspecific meanings . |
| Approach: | They build a newswire dataset to analyze NER model performance on low-resource English variants . they find that models trained on the CoNLL or OntoNotes datasets experienced significant performance drops . |
| Outcome: | The results show that models trained on the CoNLL or OntoNotes datasets experienced significant performance drops. |
Fixing Model Bugs with Natural Language Patches (2022.emnlp-main)
Copied to clipboard
| Challenge: | a growing body of research focused on using language to give instructions, supervision and even inductive biases to models instead of relying exclusively on labeled examples. |
| Approach: | They explore natural language patches that provide corrective feedback at the right level of abstraction. |
| Outcome: | The proposed model improves accuracy on real data by 1–4 accuracy points on different slices of a sentiment analysis dataset and F1 by 7 points on a relation extraction dataset. |
Investigating the Helpfulness of Word-Level Quality Estimation for Post-Editing Machine Translation Output (2021.emnlp-main)
Copied to clipboard
| Challenge: | Post-editing (PE) machine translation (MT) output can save time and reduce errors. |
| Approach: | They propose to use automatic word-level quality estimation to predict correctness of MT output to flag problematic output. |
| Outcome: | The proposed model is not good enough to support human translations, but is based on a visualization reflecting uncertainty of the model. |
Enhancing Document-level Event Argument Extraction with Contextual Clues and Role Relevance (2023.findings-acl)
Copied to clipboard
| Challenge: | Document-level event argument extraction is a challenging task for cross-sentence inference . previous work focused on document-level EAE, but recent work focused more on documentlevel . |
| Approach: | They propose a document-level event argument extraction model that captures contextual clues and latent role information. |
| Outcome: | The proposed model outperforms existing methods on two public datasets with 1.13 F1 and 2.64 F1 improvements on RAMS and WikiEvents respectively. |
Block Pruning For Faster Transformers (2021.emnlp-main)
Copied to clipboard
| Challenge: | Pruning methods have proven to be effective at reducing model size, while distillation methods are proven for speeding up inference. |
| Approach: | They propose a block pruning approach that integrates structured pruning methods with the movement pruning paradigm for fine-tuning. |
| Outcome: | The proposed model is 2.4x faster, 74% smaller and faster than distilled models on classification and generation tasks. |
Context Minimization for Resource-Constrained Text Classification: Optimizing Performance-Efficiency Trade-offs through Linguistic Features (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Pretrained language models have transformed text classification, but their computational demands often render them impractical for resource-constrained settings. |
| Approach: | They propose a linguistically-grounded framework for context minimization that leverages theme-rheme structure to preserve critical classification signals while reducing input complexity. |
| Outcome: | The proposed framework preserves critical classification signals while reducing input complexity. |
MeetingQA: Extractive Question-Answering on Meeting Transcripts (2023.acl-long)
Copied to clipboard
| Challenge: | Meeting transcripts are a promising domain for natural language tasks . lack of annotated data impedes research on other important tasks in this domain . |
| Approach: | They propose an extractive QA dataset comprising questions asked by meeting participants and corresponding responses. |
| Outcome: | The proposed dataset extracts questions asked by meeting participants and corresponding responses from transcripts. |
The Enemy from Within: A Study of Political Delegitimization Discourse in Israeli Political Speech (2025.emnlp-main)
Copied to clipboard
| Challenge: | a new computational model for political delegitimization discourse is proposed for analysis of democratic discourse . we identify the importance of PDD as a powerful tool in political competition . |
| Approach: | They propose a computational classification pipeline for political delegitimization discourse . they annotate a Hebrew-language corpus of 10,410 sentences from parliamentary speeches, facebook posts and leading news outlets . |
| Outcome: | The proposed model achieves an F1 of 0.74 for binary detection and a macro-F1 of 0.6 for classification of delegitimization characteristics. |
KazQAD: Kazakh Open-Domain Question Answering Dataset (2024.lrec-main)
Copied to clipboard
| Challenge: | KazQAD contains just under 6,000 unique questions with extracted short answers and nearly 12,000 passage-level relevance judgements. |
| Approach: | They introduce a Kazakh open-domain question answering dataset that can be used in reading comprehension and full ODQA settings. |
| Outcome: | The proposed dataset can be used in reading comprehension and full ODQA settings, as well as for information retrieval experiments. |
Are Layout-Infused Language Models Robust to Layout Distribution Shifts? A Case Study with Scientific Documents (2023.findings-acl)
Copied to clipboard
| Challenge: | Recent work has shown that infusing layout features into language models improves processing of visually-rich documents such as scientific papers. |
| Approach: | They propose a method to evaluate layout-infused language models that incorporate layout features into their models to emulate layout distribution shifts. |
| Outcome: | The proposed model performs better under layout distribution shifts than in-distribution conditions. |
MFTCXplain: A Multilingual Benchmark Dataset for Evaluating the Moral Reasoning of LLMs through Multi-hop Hate Speech Explanation (2025.findings-emnlp)
Copied to clipboard
Jackson Trager, Francielle Vargas, Diego Alves, Matteo Guida, Mikel K. Ngueajio, Ameeta Agrawal, Yalda Daryani, Farzan Karimi Malekabadi, Flor Miriam Plaza-del-Arco
| Challenge: | Existing evaluation benchmarks for large language models lack annotations that justify moral classifications and focus on English constrain moral reasoning across diverse cultural settings. |
| Approach: | They propose a multilingual benchmark dataset for evaluating moral reasoning of large language models . it includes 3,000 tweets annotated with binary hate speech labels, moral categories and rationales . |
| Outcome: | The proposed dataset shows a misalignment between LLM outputs and human annotations in moral reasoning tasks. |
Knowledge-enhanced Prompt Tuning for Dialogue-based Relation Extraction with Trigger and Label Semantic (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods to determine semantic relation between two arguments in dialogues are limited due to the low information density of text. |
| Approach: | They propose a Knowledge-Enhanced Prompt-Tuning method to enhance DRE model by exploiting trigger and label semantics. |
| Outcome: | The proposed method achieves state-of-the-art in F1 and F1c scores on a DialogRE dataset. |
Uncertainty Guided Label Denoising for Document-level Distant Relation Extraction (2023.acl-long)
Copied to clipboard
| Challenge: | Document-level relation extraction (DocRE) aims to extract semantic relations between entities in a document. |
| Approach: | They propose a Document-level distant relation extraction framework with unreliable pseudo labels to denoise DS data. |
| Outcome: | The proposed framework outperforms strong baselines on two public datasets. |
BioDEX: Large-Scale Biomedical Adverse Drug Event Extraction for Real-World Pharmacovigilance (2023.findings-emnlp)
Copied to clipboard
Karel D’Oosterlinck, François Remy, Johannes Deleu, Thomas Demeester, Chris Develder, Klim Zaporojets, Aneiss Ghodsi, Simon Ellershaw, Jack Collins, Christopher Potts
| Challenge: | pharmacovigilance (PV) is a tool for analyzing adverse drug events from biomedical literature . pharmacologists use natural language processing to extract core information from papers . |
| Approach: | They propose a resource for biomedical adverse drug event eXtraction using natural language processing. |
| Outcome: | The proposed model achieves 59.1% F1 (validation) and estimates human performance to be 72.0% F1 . the proposed model could be used to improve drug safety monitoring, also called pharmacovigilance, in the future. |
Decouple knowledge from paramters for plug-and-play language modeling (2023.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) have made impressive results in a wide range of NLP tasks. |
| Approach: | They propose a pre-training model with editable and scalable key-value memory and leverage knowledge in an explainable manner by knowledge retrieval in the pasted macro ‘MEMORY’. |
| Outcome: | The proposed model decouples the knowledge storage from model parameters with an editable and scalable key-value memory and leverages knowledge in an explainable manner by knowledge retrieval in the pasted macro ‘MEMORY’. |
KiRAG: Knowledge-Driven Iterative Retriever for Enhancing Retrieval-Augmented Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Iterative retrieval-augmented generation models are difficult to use for multihop question answering (QA) . their retrieval processes can be disrupted by irrelevant documents or factually inaccurate chain-of-thoughts . |
| Approach: | They propose a knowledge-driven iterative retriever model that decomposes documents into knowledge triples and performs iterativ retrieval with these triples to enable a factually reliable retrieval process. |
| Outcome: | The proposed model outperforms existing iRAG models with an average improvement of 9.40% in R@3 and 5.14% in F1 on multi-hop QA datasets. |
SPINACH: SPARQL-Based Information Navigation for Challenging Real-World Questions (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have led to significant improvements in the Knowledge Base Question Answering task. |
| Approach: | They introduce an expert-annotated KBQA dataset from Wikidata’s “Request a Query” forum with 320 decontextualized question-SPARQL pairs. |
| Outcome: | The SPINACH dataset outperforms baselines on the QALD-7, QADL-9 Plus and QAL-10 datasets by 31.0%, 27.0% and 10.0% in F1 respectively. |
Narrative-of-Thought: Improving Temporal Reasoning of Large Language Models via Recounted Narratives (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated impressive performance in many reasoning tasks, but temporal reasoning remains challenging due to its intrinsic complexity. |
| Approach: | They propose a new prompting technique tailored for temporal reasoning, Narrative-of-Thought (NoT), that first converts the events set to a Python class, then prompts a small model to generate a temporal narrative. |
| Outcome: | The proposed technique achieves the highest F1 on Schema-11 evaluation set, while securing an overall F1 of par with GPT-3.5/4. |
Metaphors in Online Religious Communication: A Detailed Dataset and Cross-Genre Metaphor Detection (2024.lrec-main)
Copied to clipboard
| Challenge: | figurative language plays a particularly important role in religious communication . linguistic metaphors relate entities from different semantic domains by drawing on an implicit similarity between them. |
| Approach: | They present a dataset of fine-grained metaphor annotations for online religious communication . they show that cross-genre transfer metaphor detection leads to a drop in performance . |
| Outcome: | The proposed dataset shows that adding in-genre data improves performance . the authors show that the proposed system can detect metaphors in religious forums . |
Dialogue Act-Aided Backchannel Prediction Using Multi-Task Learning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Backchanneling is a form of feedback that is produced by listeners in a conversation . since the advent of ChatGPT, modern dialogue systems exhibit answer quality levels on par with humans in various professions. |
| Approach: | They propose a multi-task learning approach that learns textual representations for the task of backchannel prediction in tandem with dialogue act classification. |
| Outcome: | The proposed approach improves the prediction of specific backchannels by up to 2.0% in F1 . the audio encoder is pre-trained in a self-supervised fashion using voice activity projection . |
Multilingual Coreference Resolution in Low-resource South Asian Languages (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing coreference resolution models for South Asian languages are limited . a a sanity check for the prediction of translations is required to ensure accuracy of the model, authors say . |
| Approach: | They evaluate an end-to-end coreference resolution model on a Hindi golden set . they use translation and word-alignment tools to translate a translated dataset into 31 languages . |
| Outcome: | The proposed model scored 64 and 68 on a Hindi golden set. |
Learning Semantic Role Labeling from Compatible Label Sequences (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Prior work has shown that cross-task interaction helps, but only explored multitask learning so far. |
| Approach: | They propose a framework that jointly models VerbNet and PropBank labels as one sequence and enforcing Semlink constraints during decoding improves the overall F1 . |
| Outcome: | The proposed model outperforms the prior best in-domain model by 3.5 (VerbNet) and 0.8 (PropBank). |
Language Models Lack Temporal Generalization and Bigger is Not Better (2025.findings-acl)
Copied to clipboard
| Challenge: | 450 encoder models are fine-tuned on 15 data splits on a task to detect events in Early Modern Dutch archival texts. |
| Approach: | They propose to fine tune six encoder models that have been pretrained with very different data on a task in Early Modern Dutch archival texts. |
| Outcome: | The proposed model is fine tuned with 5 seeds on 15 different data splits and reaches highest F1 performance. |
Understanding Structured Financial Data with LLMs: A Case Study on Fraud Detection (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are expensive to develop and maintain and require extensive feature engineering to perform. |
| Approach: | They propose a two-stage approach that serializes a compact subset of numeric/categorical attributes into natural language and performs retrieval-augmented in-context learning over label-aware, instance-level exemplars. |
| Outcome: | The proposed approach significantly improves F1/MCC over direct prompting and is competitive with strong tabular baselines in several settings. |
CaT-Bench: Benchmarking Language Model Understanding of Causal and Temporal Dependencies in Plans (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on reasoning in plans focus on classical problems, simulated environments, or restricted language such as PDDL, but real-world plans cannot be tested to test for correctness and reliability. |
| Approach: | They propose a benchmark question that tests whether a step must necessarily occur before or after another in cooking recipe plans. |
| Outcome: | The proposed question-driven evaluation shows that SOTA LLMs are underwhelming and biased towards predicting dependence more often, but the best F1 result is 0.73. |
Pointing Out the Shortcomings of Relation Extraction Models with Semantically Motivated Adversarials (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent large language models have achieved state-of-the-art performance on many NLP tasks, but they rely on shortcut features and are unreliable when put under pressure. |
| Approach: | They propose to use semantically-motivated strategies to generate adversarial examples by replacing entity mentions to generate relation extraction models. |
| Outcome: | The proposed models show a lack of robustness when put under pressure. |
Rule-Guided Extraction: A Hierarchical Rule Optimization Framework for Document-Level Event Argument Extraction (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Document-level event argument extraction (EAE) is a critical task in natural language processing. |
| Approach: | They propose an LLM-driven HiErarchical Rule Optimization framework that iteratively generates and selects optimal hierarchical rules. |
| Outcome: | The proposed framework outperforms few-shot supervised methods and outperformed state-of-the-art prompting baselines. |
Just KIDDIN’ : Knowledge Infusion and Distillation for Detection of INdecent Memes (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to detect toxicity in online multimodal environments require common-sense reasoning and contextual awareness. |
| Approach: | They propose a hybrid neurosymbolic framework that unifies distillation of implicit contextual knowledge from Large Vision-Language Models and infusion of explicit relational semantics through sub-graphs from Knowledge Graphs. |
| Outcome: | The proposed framework outperforms state-of-the-art models on two datasets with improvements of 0.5%, and 10.6% in HatefulMemes Benchmark. |
500xCompressor: Generalized Prompt Compression for Large Language Models (2025.acl-long)
Copied to clipboard
| Challenge: | Prompt compression is important for large language models to increase inference speed, reduce computation cost, and improve user experience. |
| Approach: | They propose a method that compresses natural language contexts into a special token . they propose to reduce computations and memory costs by reducing the complexity . |
| Outcome: | The proposed method reduces computations and memory costs by 27-90% . it retains 70-74% and 77-84% of the LLM capabilities at high compression ratios . |
RoBERTa Low Resource Fine Tuning for Sentiment Analysis in Albanian (2024.lrec-main)
Copied to clipboard
| Challenge: | Recent advances in the education domain have provided new opportunities for solving interesting, but difficult problems. |
| Approach: | They propose to use EduSenti to fine-tune language models for assigning sentiment to reviews of educators' performance annotated for sentiment, emotion and educational topic. |
| Outcome: | The proposed model is compared with an Albanian masked language trained model from the last XLM-RoBERTa checkpoint and shows that it is a good fit for the proposed model. |
Sarcasm Detection in a Disaster Context (2024.lrec-main)
Copied to clipboard
| Challenge: | During natural disasters, people often use social media platforms to express contempt or sarcasm . despite being widely researched as an NLP task, sarkasmatic detection has not been explored in a specific context . |
| Approach: | They propose a dataset of 15,000 tweets annotated for intended sarcasm . they propose sarkasmatic detection using pre-trained language models . |
| Outcome: | The proposed model can obtain as much as 0.70 F1 on the dataset. |
ToMMeR - Efficient Entity Mention Detection from Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods to detect text spans that refer to entities are often conflated with entity typing in a single joint task. |
| Approach: | They propose a lightweight model that probes mention detection capabilities from early LLM layers. |
| Outcome: | The proposed model achieves 93% recall zero-shot with 90% precision under human-calibrated LLM-judge protocol . |
Reference-Free Evaluation of Taxonomies (2026.findings-acl)
Copied to clipboard
| Challenge: | Taxonomies are used to classify items, ideas or organisms based on shared characteristics. |
| Approach: | They introduce two reference-free metrics for quality evaluation of taxonomies in the absence of labels. |
| Outcome: | The proposed metrics correlate well with F1 against ground truth taxonomies on five taxonomies and improve hierarchical classification when used with label hierarchies. |
Cultivating Forensic Reasoning for Generalizable Multimodal Manipulation Detection (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for manipulation detection and grounding focus on manipulator type classification under result-oriented supervision. |
| Approach: | They propose a reasoning-driven framework that shifts learning from outcome fitting to process modeling. |
| Outcome: | The proposed framework achieves state-of-the-art with superior generalization on large-scale datasets. |
SPLICE: A Singleton-Enhanced PipeLIne for Coreference REsolution (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing attempts to integrate singleton mention detection into end-to-end coreference resolution for English have been hampered by the lack of singletont mention spans in the OntoNotes benchmark. |
| Approach: | They propose a two-step neural mention and coreference resolution system that integrates singleton mentions with OntoNotes syntax trees to achieve a near approximation of the Ontonotes dataset with all singletont mentions. |
| Outcome: | The proposed system achieves 94% recall on a sample of gold singletons. |
Detecting Legal Citations in United Kingdom Court Judgments (2025.emnlp-main)
Copied to clipboard
| Challenge: | citation detection in court judgments is challenging because of the complexity of legal language . citation analysis is critical for many legal applications, but the complexity is not always easy to solve. |
| Approach: | They compare three different models for citation detection in court judgments using the Cambridge Law Corpus . they compare rulebased regular expressions, transformer-based encoders and large language models . |
| Outcome: | The proposed model outperforms the existing models in the citation analysis and analysis of 190 court judgments. |
UkraiNER: A New Corpus and Annotation Scheme towards Comprehensive Entity Recognition (2024.lrec-main)
Copied to clipboard
| Challenge: | Named entity recognition excludes nested, discontinuous, non-named entities in practice . despite attempts to broaden their coverage, the most restrictive variant of NER remains the default . |
| Approach: | They propose a new annotation scheme that offers higher comprehensiveness while preserving simplicity. |
| Outcome: | The proposed scheme offers higher comprehensiveness while preserving simplicity . it also includes an annotation tool to implement the scheme on the corpus UkraiNER . |
Analyze Like a Venture Capitalist: Information-Gain and Knowledge Enhanced Graph Reasoning for Startup Success Prediction (2026.findings-acl)
Copied to clipboard
| Challenge: | Most venture capital investments fail, while a few deliver outsized returns. |
| Approach: | They propose a framework that synthesizes relational evidence across sources . they propose combining information-gain-driven retriever and knowledge base to ground reasoning . |
| Outcome: | The proposed framework achieves +5.9% F1 and +22.1% Precision@5 over state-of-the-art baselines. |
RAG-on-a-Diet: A Reinforcement Learning-Based Dynamic Resource Optimization Framework for RAG (2026.acl-long)
Copied to clipboard
| Challenge: | Existing frameworks for knowledge-intensive multi-hop question answering do not adapt to how a trajectory unfolds. |
| Approach: | They propose a lightweight reinforcement-learning agent that treats each reasoning hop as an independent decision and selects the smallest model sufficient for it. |
| Outcome: | The proposed agent cuts Monetary Inference Cost by 60.07% against IRCoT with only a 3.7% F1 drop and matches Adaptive-RAG’s F1 at 37.30% lower cost. |
Beyond Outcome Verification: Verifiable Process Reward Models for Structured Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent work on reinforcement learning with verifiable rewards (RLVR) has shown that large language models can be substantially improved using outcome-level verification signals. |
| Approach: | They propose a framework where intermediate reasoning steps are checked by deterministic, rule-based verifiers. |
| Outcome: | The proposed framework achieves 20% higher F1 than state-of-the-art models and 6.5% higher than verifiable outcome rewards, with substantial gains in evidence grounding and logical coherence. |
HiGMem: A Hierarchical and LLM-Guided Memory System for Long-Term Conversational Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing memory systems rely on vector similarity for retrieval, resulting in bloated evidence sets . existing systems produce little additional recall, but this approach lowers retrieval precision . |
| Approach: | They propose a two-level event-turn memory system that uses event summaries as semantic anchors to predict which related turns are worth reading. |
| Outcome: | The proposed system achieves the best F1 on four of five question categories and improves adversarial F1 from 0.54 to 0.78 over A-Mem while retrieving an order of magnitude fewer turns. |
Biomed-Enriched: Data-Efficient Biomedical Pretraining via Paragraph-Level Annotation (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models have demonstrated remarkable capabilities across a wide range of general tasks, from question answering to code generation. |
| Approach: | They use a paragraph-level pipeline to annotate PubMed Central paragraphs . they use XLM-RoBERTa to fine-tune the pipeline and propagate annotations to the full corpus . |
| Outcome: | The proposed approach improves performance on 11 tasks while using 2.5x fewer tokens and only public data. |
CSRP: Chain-of-Thought Reasoning for Chinese Text Correction via Reinforcement Learning with Efficiency-Aware Rewards (2026.acl-long)
Copied to clipboard
| Challenge: | Large Language Models lack specialized priors for subtle grammatical distinctions, and Supervised Fine-Tuning fails to optimize for precision-focused metrics. |
| Approach: | They propose a framework that builds correction capability through Continual Pre-training on 5.9M balanced samples to internalize domain knowledge. |
| Outcome: | The proposed framework outperforms existing models on the NACGEC benchmark with 50.99 F0.5 and 57.17 precision while mitigating over-correction bias. |
WojoodRelations: Arabic Relation Extraction Corpus and Modeling (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing work on Arabic RE remains limited due to the language’s rich morphology and syntactic complexity, and the lack of large, high-quality datasets. |
| Approach: | They propose to use WojoodRelations to extract relation relationships from Arabic textual data using relation-aware templates and GPT-Joint to perform relation-based retrieval. |
| Outcome: | The proposed method achieves a Cohen’s of 0.92, indicating high reliability, and supervised models achieve 92.89% F1 for RE, while LLMs obtain 72.73% F1 . |
ReDepress: A Cognitive Framework for Detecting Depression Relapse from Social Media (2025.emnlp-main)
Copied to clipboard
Aakash Kumar Agarwal, Saprativa Bhattacharjee, Mauli Rastogi, Jemima S. Jacob, Biplab Banerjee, Rashmi Gupta, Pushpak Bhattacharyya
| Challenge: | Almost 50% of depression patients face the risk of going into relapse. |
| Approach: | They propose to validate a social media dataset on depression relapse using cognitive theories of depression. |
| Outcome: | The first clinically validated social media dataset focused on depression relapse comprises 204 Reddit users annotated by mental health professionals. |
Decomposed Prompting Does Not Fix Knowledge Gaps, But Helps Models Say “I Don’t Know” (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models struggle to recognize their knowledge limits in closed-book question answering . disagreements between prompting regimes are indicative of potential errors, study finds . |
| Approach: | They evaluate three task-equivalent prompting regimes: Direct, Assistive, Incremental . disagreements between prompting régimes provide a precise signal of internal uncertainty . |
| Outcome: | The proposed decomposed prompting outperforms standard uncertainty baselines as an error detector. |
DimABSA: Building Multilingual and Multidomain Datasets for Dimensional Aspect-Based Sentiment Analysis (2026.acl-long)
Copied to clipboard
Lung-Hao Lee, Liang-Chih Yu, Natalia V Loukachevitch, Ilseyar Alimova, Alexander Panchenko, Tzu-Mi Lin, Zhe-Yu Xu, Jian-Yu Zhou, Guangmin Zheng, Jin Wang, Sharanya Awasthi, Jonas Becker, Jan Philip Wahle, Terry Ruas, Shamsuddeen Hassan Muhammad, Saif M. Mohammad
| Challenge: | Existing ABSA research relies on coarse-grained categorical labels, which limits its ability to capture nuanced affective states. |
| Approach: | They propose a dimensional approach that represents sentiment with continuous valence–arousal (VA) scores, enabling fine-grained analysis at both the aspect and sentiment levels. |
| Outcome: | The proposed approach represents sentiment with continuous valence–arousal (VA) scores, enabling fine-grained analysis at both the aspect and sentiment levels. |
When in Doubt, Consult: Expert Debate for Sexism Detection via Confidence-Based Routing (2026.acl-long)
Copied to clipboard
| Challenge: | sexist content on social media is increasingly pervasive, often appearing in subtle, context-dependent forms that evade traditional classification methods. |
| Approach: | They propose a framework that unifies targeted training procedures to regularize supervision to scarce and noisy data with selective reasoning-based inference to handle ambiguous or borderline cases. |
| Outcome: | The proposed framework outperforms existing approaches across several public benchmarks . it bridges the gap between efficiency and reasoning with a dynamic routing mechanism . |
Speech-Hands: A Self-Reflection Voice Agentic Approach to Speech Recognition and Audio Reasoning with Omni Perception (2026.acl-long)
Copied to clipboard
Zhen Wan, Chao-Han Huck Yang, Jinchuan Tian, Hanrong Ye, Ankita Pasad, Szu-Wei Fu, Arushi Goel, Ryo Hachiuma, Shizhe Diao, Kunal Dhawan, Sreyan Ghosh, Yusuke Hirota, Zhehuai Chen, Rafael Valle, Chenhui Chu, Shinji Watanabe, Boris Ginsburg, Yu-Chiang Frank Wang
| Challenge: | naively fine-tuning an omni-model on speech recognition and external sound understanding tasks often degrades performance . Xie and Wu's framework, Speech-Hands, recasts the problem as an explicit self-reflection decision. |
| Approach: | They propose a voice-agentic framework that learns one critical omni-understanding skill: trusting itself versus external audio perception. |
| Outcome: | The proposed framework outperforms baseline models on the OpenASR leaderboard by 12.1% WER and high F1 on audio QA decisions. |