@inproceedings{lee-etal-2026-diversity,
title = "Diversity is Not Ambiguity: Toward Accurate and Efficient Ambiguity Detection for Open-Domain {QA}",
author = "Lee, Jiwon and
Park, Yong-chan and
Hong, Jungin and
Kang, U",
editor = "Lee, Hung-Yi and
Dev, Sunipa and
Li, Jessy and
Elliott, Desmond",
booktitle = "Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing",
month = oct,
year = "2026",
address = "Budapest, Hungary",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2026.emnlp-main.2567/",
pages = "58310--58333",
ISBN = "979-8-89176-459-0",
abstract = "How can question answering (QA) systems determine whether a query is ambiguous? Ambiguity detection is essential in open-domain QA, as misclassification leads to either answering under the wrong interpretation or triggering unnecessary clarification. However, existing methods conflate answer diversity with ambiguity, leading to inaccurate predictions. They also process all queries uniformly, resulting in wasteful computation. We propose ARCHIVE, an accurate and efficient framework that detects ambiguity via *logical conflict*: a query is ambiguous if its valid answers cannot all be true under a single interpretation. ARCHIVE combines a lightweight early-exit encoder for surface-detectable cases with a conflict modeling module that captures logical relations among answers, reinforced by an invariance objective for robustness to noisy answer sets. We also present QuireQA, a 4,703-query benchmark spanning factoid, non-factoid, and ill-formed queries. Experiments show that ARCHIVE outperforms competitors, improving F1-amb and F1-unamb by up to 10.4 and 21.6 points, respectively, while operating 16$\times$ faster than the best competitor."
}<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="lee-etal-2026-diversity">
<titleInfo>
<title>Diversity is Not Ambiguity: Toward Accurate and Efficient Ambiguity Detection for Open-Domain QA</title>
</titleInfo>
<name type="personal">
<namePart type="given">Jiwon</namePart>
<namePart type="family">Lee</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Yong-chan</namePart>
<namePart type="family">Park</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Jungin</namePart>
<namePart type="family">Hong</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">U</namePart>
<namePart type="family">Kang</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2026-10</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing</title>
</titleInfo>
<name type="personal">
<namePart type="given">Hung-Yi</namePart>
<namePart type="family">Lee</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Sunipa</namePart>
<namePart type="family">Dev</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Jessy</namePart>
<namePart type="family">Li</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Desmond</namePart>
<namePart type="family">Elliott</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Budapest, Hungary</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
<identifier type="isbn">979-8-89176-459-0</identifier>
</relatedItem>
<abstract>How can question answering (QA) systems determine whether a query is ambiguous? Ambiguity detection is essential in open-domain QA, as misclassification leads to either answering under the wrong interpretation or triggering unnecessary clarification. However, existing methods conflate answer diversity with ambiguity, leading to inaccurate predictions. They also process all queries uniformly, resulting in wasteful computation. We propose ARCHIVE, an accurate and efficient framework that detects ambiguity via *logical conflict*: a query is ambiguous if its valid answers cannot all be true under a single interpretation. ARCHIVE combines a lightweight early-exit encoder for surface-detectable cases with a conflict modeling module that captures logical relations among answers, reinforced by an invariance objective for robustness to noisy answer sets. We also present QuireQA, a 4,703-query benchmark spanning factoid, non-factoid, and ill-formed queries. Experiments show that ARCHIVE outperforms competitors, improving F1-amb and F1-unamb by up to 10.4 and 21.6 points, respectively, while operating 16\times faster than the best competitor.</abstract>
<identifier type="citekey">lee-etal-2026-diversity</identifier>
<location>
<url>https://aclanthology.org/2026.emnlp-main.2567/</url>
</location>
<part>
<date>2026-10</date>
<extent unit="page">
<start>58310</start>
<end>58333</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Diversity is Not Ambiguity: Toward Accurate and Efficient Ambiguity Detection for Open-Domain QA
%A Lee, Jiwon
%A Park, Yong-chan
%A Hong, Jungin
%A Kang, U.
%Y Lee, Hung-Yi
%Y Dev, Sunipa
%Y Li, Jessy
%Y Elliott, Desmond
%S Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-459-0
%F lee-etal-2026-diversity
%X How can question answering (QA) systems determine whether a query is ambiguous? Ambiguity detection is essential in open-domain QA, as misclassification leads to either answering under the wrong interpretation or triggering unnecessary clarification. However, existing methods conflate answer diversity with ambiguity, leading to inaccurate predictions. They also process all queries uniformly, resulting in wasteful computation. We propose ARCHIVE, an accurate and efficient framework that detects ambiguity via *logical conflict*: a query is ambiguous if its valid answers cannot all be true under a single interpretation. ARCHIVE combines a lightweight early-exit encoder for surface-detectable cases with a conflict modeling module that captures logical relations among answers, reinforced by an invariance objective for robustness to noisy answer sets. We also present QuireQA, a 4,703-query benchmark spanning factoid, non-factoid, and ill-formed queries. Experiments show that ARCHIVE outperforms competitors, improving F1-amb and F1-unamb by up to 10.4 and 21.6 points, respectively, while operating 16\times faster than the best competitor.
%U https://aclanthology.org/2026.emnlp-main.2567/
%P 58310-58333
Markdown (Informal)
[Diversity is Not Ambiguity: Toward Accurate and Efficient Ambiguity Detection for Open-Domain QA](https://aclanthology.org/2026.emnlp-main.2567/) (Lee et al., EMNLP 2026)
ACL