United States

SemEval-2026 Task 3 (DimABSA) includes Dimensional Aspect Sentiment Quadruplet Extraction (DimASQP), which requires extracting structured tuples—aspect term, aspect category, and opinion term—together with continuous valence–arousal (VA) values from reviews (Yu et al., 2026a). In this work, we participate in Track A, Subtask 3. We describe NYCU Speech Lab&#39;s submission for the Chinese Restaurant and Laptop domains. Our system is a post-processing ensemble over heterogeneous architectures: LoRA/QLoRA fine-tuned decoder-only LLMs, a fine-tuned encoder-only model, and (optionally) prompted API-based LLMs. To improve robustness under the continuous F1 (cF1) metric, we use validation-calibrated weighted voting for tuple selection and weighted VA fusion for numerical aggregation, with strict output validation to enforce task constraints. Experiments on a held-out validation split show consistent gains over single models and clarify the precision–recall trade-offs induced by the voting threshold. On the organizers&#39; released (tentative) test leaderboard snapshot, our submission ranks first in both domains.

ACL 2026

NYCU Speech Lab at SemEval-2026 Task 3: Heterogeneous Model Ensemble with Adaptive Weighted Voting for Dimensional Aspect Sentiment Quadruplet Extraction

valence-arousal

dimensional aspect sentiment quadruplet extraction

dimensional aspect-based sentiment analysis

model ensemble

large language models

It is my great pleasure and honor to welcome you to the 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026), held in San Diego, California, USA, July 2–7, 2026. ACL 2026 continues our fields tradition of excellence in scholarship, innovation, and inclusivity, and I am deeply grateful to the many volunteers who have worked tirelessly to bring this event to life.

It is exciting to see the many developments in the field reflected at our conference, such as the advancement of large language models (born out of our community) into many application directions. This is not without challenges, partly due to unsolved problems, and partly due to misuse of the technology. All this is reflected well at ACL 2026. The conference also reflects that the field is not only about advancing technology, but also the science of fundamentally understanding language and how it is use by many different speaker communities. <br>
[Full Message from General Chair Philipp Koehn](https://drive.google.com/file/d/1QiJFOmMjvDgsDo3i1XzlQnImxe3RU_Cy/view?usp=sharing) <br><br><br>
<html><button style="display: inline-flex; align-items: center; justify-content: center; white-space: nowrap; border-radius: 9999px; font-weight: bold; background: #7c3aed; color: white; font-family: 'Space Grotesk', sans-serif; height: 40px; font-size: 16px; padding: 0 20px; border: none; cursor: pointer" onclick="window.open('https://drive.google.com/file/d/1QiJFOmMjvDgsDo3i1XzlQnImxe3RU_Cy/view?usp=sharing')">Conference Handbook</button></html>
<br><br><br><br>

To access this event page, you need to log in with the **email address you registered with**. <br>Access credentials will be sent to your email from Underline -  subject line "Welcome to ACL 2026". Please be sure to check your spam email folder if you do not see an email confirmation right away.

To access this event page, you are required to register.
Please complete your registration to continue.

We recommend reading [**the registration information**](https://2026.aclweb.org/registration/) first.

Registration Required

The 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026) will take place in San Diego, California, from July 2 - 7, 2026.

SemEval-2026 Task 3 (DimABSA) includes Dimensional Aspect Sentiment Quadruplet Extraction (DimASQP), which requires extracting structured tuples—aspect term, aspect category, and opinion term—together with continuous valence–arousal (VA) values from reviews (Yu et al., 2026a). In this work, we participate in Track A, Subtask 3. We describe NYCU Speech Lab's submission for the Chinese Restaurant and Laptop domains. Our system is a post-processing ensemble over heterogeneous architectures: LoRA/QLoRA fine-tuned decoder-only LLMs, a fine-tuned encoder-only model, and (optionally) prompted API-based LLMs. To improve robustness under the continuous F1 (cF1) metric, we use validation-calibrated weighted voting for tuple selection and weighted VA fusion for numerical aggregation, with strict output validation to enforce task constraints. Experiments on a held-out validation split show consistent gains over single models and clarify the precision–recall trade-offs induced by the voting threshold. On the organizers' released (tentative) test leaderboard snapshot, our submission ranks first in both domains.

workshop paper

Detecting and interpreting polarized online content is increasingly crucial as online platforms become central to public information exchange. We present an efficient adaptation of large language models for multi-label polarization classification in SemEval-2026 Task 9: Detecting Multilingual, Multicultural and Multievent Online Polarization. Our single-forward-pass inference method outperforms baseline multi-step decoding approaches for multi-label classification by reducing error propagation while improving inference efficiency. Beyond performance and efficiency analysis, we investigate the cross-lingual transferability of the system, observing statistically significant generalization within language families, a result that offers a practical path for low-resource language adaptation. Our system ranked 1st in 8 languages for Subtask 1 and 6 languages for Subtask 2, and placed in the top 5 for 16 out of 22 languages across both subtasks.
Overall, we provide a simple, effective, and efficient solution for multilingual polarization classification.

UTokyo Tsuruoka Lab at SemEval-2026 Task 9: Efficient Single Forward Pass Inference for Multi-Label Polarization Classification

We describe our system for SemEval-2026 - Task 8 (MTRAGEval), participating in Task A (Retrieval) across four English-language domains. Our approach employs a three-stage pipeline: (1) query rewriting via a LoRA-finetuned Qwen 2.5 7B model that transforms context-dependent follow-up questions into standalone queries, (2) hybrid BM25 and dense retrieval combined through Reciprocal Rank Fusion, and (3) cross-encoder reranking with BGE-reranker-v2-m3. On the official test set, the system achieves nDCG@5 of 0.531, ranking 8th out of 38 participating systems and 10.7% above the organizer baseline. Development comparisons reveal that domain-specific temperature tuning for query generation, where technical domains benefit from deterministic decoding and general domains from controlled randomness, provides consistent gains, while more complex strategies such as domain-aware prompting and multi-query expansion degrade performance.

Caraman at SemEval-2026 Task 8: Three-Stage Multi-Turn Retrieval with Query Rewriting, Hybrid Search, and Cross-Encoder Reranking

This paper presents our system for SemEval-2026 Task~11 Subtask~1 on content-independent syllogistic reasoning. The task evaluates whether language models can determine the formal validity of logical arguments independently of their semantic plausibility. To reduce content-driven biases, we propose a data augmentation strategy that progressively abstracts lexical semantics by replacing content words with symbolic placeholders and pseudo-words while preserving logical structure. Experiments based on fine-tuning microsoft/deberta-large-mnli show that abstraction-based augmentation reduces Content Effect and improves accuracy, leading to competitive performance on the official leaderboard. However, we observe substantial sensitivity to random initialization, suggesting that evaluation outcomes are partly influenced by stochastic factors. To better understand these effects, we conduct a layer-wise probing analysis using a Minimum Description Length framework, showing that the proposed approach decreases the accessibility of plausibility information in later transformer layers, indicating a shift toward more structure-oriented reasoning.

Team ewelinaksiez at SemEval-2026 Task 11: Reducing Content Bias in Syllogistic Reasoning via Semantic Abstraction

This paper describes the system developed by the LATE-iimas team for Task 10 of SemEval-2026: Psycomark, specifically for Subtask 2, which involves conspiracy detection. Our approach was based on fine-tuning the popular pre-trained language model DeBERTa-v3-Large. To address the challenges inherent in the provided dataset, such as class imbalance and the linguistic ambiguity of the "Can't tell" label, we implemented a 5-Fold Stratified Cross-Validation technique combined with a Weighted Cross-Entropy Loss function. The final system, which operates using an ensemble of the resulting models, achieved a Weighted F1-Score of 0.75, placing it in the top 10 of the ranking.

LATE-iimas at SemEval-2026 Task 10: Conspiracy Detection via DeBERTa-v3 Ensemble and Weighted Loss Optimization

We describe our SemEval-2026 Task 8 Subtask A system, which focuses on evaluating and improving the retrieval aspect of multi-turn Retrieval-Augmented Generation (RAG) conversations. We implement a training-free fusion approach that combines three distinct query representations to retrieve documents independently. The results from these three views are pooled and reranked using a MonoT5 cross-encoder. Our findings demonstrate that this fusion approach consistently outperforms single-strategy baselines, revealing that optimal retrieval strategies vary significantly at the query level, and establishing multi-query fusion as a baseline for multi-turn RAG systems.

GUIR at SemEval-2026 Task 8: Training-Free Multi-Query Fusion for Robust Conversational Retrieval

The generation of source code via Artificial Intelligence has become a prevalent practice in both academia and industry, posing significant challenges to academic integrity and authorship attribution. In this work, we address SemEval-2026 Task 13: Detecting Machine-Generated Code by evaluating the effectiveness of four distinct methodologies: Graph Neural Networks (GNNs), Pre-trained Language Models (PLMs), Large Language Models (LLMs), and Stylometric Feature Engineering using XGBoost. Our approach focuses on three specific scenarios: Subtask A (Binary Detection), Subtask B (Multi-Class Authorship), and Subtask C (Hybrid Code Detection). While our models achieved high performance during the validation phase, the transition to the final test set revealed substantial challenges in generalization, likely due to the increased diversity of programming languages and generators in the unseen data. This work serves as a foundational first step, identifying critical gaps in model robustness and highlighting the need for more sophisticated methodologies to bridge the performance gap in complex, real-world environments.

LATE-IIMAS at Semeval-2026 Task 13: Evaluating GNNs, PLMs, LLMs, and Stylometry for Automatic Code Identification

This paper presents IIMAS-RAG, our system for SemEval-2026 Task 8 on evaluating multi-turn retrieval-augmented generation. Our approach combines LLM-based query rewriting, hybrid sparse-dense retrieval with SPLADE and Voyage-3-large fused via Reciprocal Rank Fusion, and answerability-conditioned generation with GPT-4.1. The system ranked 4th out of 38 teams in Subtask A (Retrieval) and 13th out of 29 teams in Subtask C (Full RAG). Our results show that query rewriting is the most impactful retrieval component, while generation remains challenging in low-context and partially answerable scenarios.

IIMAS-RAG at SemEval-2026 Task 8: Hybrid Sparse-Dense Retrieval and Answerability-Conditioned Generation for Multi-Turn RAG

We describe NLP-CEIA-UFG, our system for
SemEval-2026 Task 8, which evaluates multi-
turn retrieval-augmented generation (RAG)
over heterogeneous document corpora. Our
pipeline centers on a three-iteration dynamic
retrieval loop in which two gpt-oss-120b-
powered modules—an Iterative Query Genera-
tor and a Notes Builder—interact at each step
to diversify queries and accumulate structured
notes on information gaps. After the loop, an
Answerability Classifier routes the query to one
of three generation paths (Complete Answer,
Partial Answer, or Clarification Request). Hy-
brid BM25 and dense retrieval is fused via Re-
ciprocal Rank Fusion and refined by the Jina
listwise reranker. The retrieval pipeline is com-
piled under DSPy and optimized with GEPA.
We achieve nDCG@5 of 0.4502 (rank 17/38,
Subtask A) and HM = 0.3774 (rank 24/29, Sub-
task C). Post-hoc analysis identifies an over-
conservative Answerability Classifier as the
primary bottleneck: 75.5% of all responses
were flagged as IDK by the evaluator, includ-
ing 69.8% of ANSWERABLE questions, while
the retrieval and generation components per-
form well when the classifier routes correctly.
Our code is available at https://github.
com/GuiiCorreia/SemEval-2026.

NLP-CEIA-UFG at SemEval-2026 Task 8: Iterative Retrieval with Notes-Guided Query Refinement for Multi-Turn RAG

We describe the participation of team TFB in SemEval-2026 Task 4 on narrative similarity. We explore ColBERT-inspired sentence-level late interaction to capture event reordering, compare fine-tuning with synthetic data at multiple difficulty tiers, finding that distribution proximity to the target data matters more than volume and evaluate chain-of-thought prompting. We complement our approaches with a human annotation study (Krippendorff's alpha=0.32) confirming the task's inherent difficulty, an analysis of synthetic data distribution shift explaining why fine-tuning on out-of-distribution data hurts the model's performance. Despite our tests, we didn't surpass results of sentence-t5-xxl on Track B and Qwen2.5-7B on Track A. We finally decided to submit these two models for the task.

TFB at SemEval-2026 Task 4: Diagnosing Model Failures in Narrative Understanding

We investigate contextual embedding manipulation for Word Sense Disambiguation (WSD)
as part of SemEval-2026 Task 5. We propose four approaches built on BERT-like pretrained
models, experimenting with the informativeness of similarity calculations and classification
methods. We introduce scratch-trained cross-attention mechanisms inspired by GLiNER to compute similarity between definition or synonym representations and the full context. Our best performance achieved 57% accuracy with a Spearman correlation of 0.20. Our results suggest that finetuning strategy and trainng curriculum matter more than pretrained model choice for this novel task, and we identify several directions for future improvement. View our code base at: https://github.com/
heliosraz/SemEval52026

Downloads

Next from ACL 2026

UTokyo Tsuruoka Lab at SemEval-2026 Task 9: Efficient Single Forward Pass Inference for Multi-Label Polarization Classification

Similar lecture

AILS-NTUA at SemEval-2026 Task 3: Efficient Dimensional Aspect-Based Sentiment Analysis

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from ACL 2026

UTokyo Tsuruoka Lab at SemEval-2026 Task 9: Efficient Single Forward Pass Inference for Multi-Label Polarization Classification

Similar lecture

AILS-NTUA at SemEval-2026 Task 3: Efficient Dimensional Aspect-Based Sentiment Analysis

Downloads