Selection Shapes the Boundary: A Preregistered Replication of Monotonicity and Label Agreement in Unselected NLI Populations
Paper · 2026 · Haram Choi
Summary
An earlier study by the same author reported that NLI hypotheses with non-upward monotonicity operators (downward-entailing or non-monotone triggers) drew lower annotator agreement in ChaosNLI, with Cliff's δ = −0.284. ChaosNLI, however, contains only items whose majority label originally got exactly three of five votes. This paper asks whether the pattern also appears in the unfiltered source populations. The author ran a preregistered test on the SNLI and MNLI development sets. The same rule-based tagger was used, frozen with no rule changes, and agreement was coded as a four-level ordinal derived from the five original labels. The registered prediction failed. All seven contrasts came out positive, so non-upward items agreed slightly more, and none came near the preregistered smallest effect of interest. Simulated tagger errors and a manual audit both support the measurement. The broader lesson is that structure found in a disagreement-filtered resource may be an artifact of how it was selected. Claims about human label variation (HLV) should therefore say explicitly which selection they depend on.
Key points
- Data: SNLI dev (9,986 items), MNLI matched dev (10,000), and MNLI mismatched dev (9,946, secondary). MED (5,382 pairs) was used only to estimate tagger error rates.
- Effect sizes:
- Every δ was positive, from +0.030 to +0.059, all below the SESOI of |δ| = 0.10.
- The SNLI primary contrast was non-significant (+0.032).
- MNLI matched was significant but in the opposite direction to the registration (+0.045, Holm p = 7.1×10⁻⁵).
- Separating high- from low-agreement items gave an AUC near chance (0.492 SNLI, 0.484 matched).
- The planned bridge to ChaosNLI entropy could not be computed. On the overlap, every item has a 3/5 majority, so the ordinal has zero variance.
- Tagger-noise simulation:
- Flip rates came from MED, e.g. a symmetric error of 0.101.
- It covered 36 grid cells with 1,000 replications each.
- Noise only pulled δ toward zero, and the 97.5th percentile never went above 0.064.
- Manual audit (200 fresh items, written codebook):
- Four-class agreement with the tagger was 0.875 (κ 0.607).
- An earlier round without a codebook reached only 0.135.
Interesting ideas
- I1. A pattern found on a filtered subset should be re-tested on the full population it came from, because the filter can create or flip the effect.
- I2. To check that instrument error cannot fake a result, take misclassification rates measured on an anchor set, inject them as random flips, and confirm the effect shrinks rather than appears.
- I3. Freeze the tool before validating it, and do not patch it in response to the audit sample, since that makes the validation circular.
- I4. Rater agreement jumped from 0.135 to 0.875 once a codebook fixed what was being judged. Low agreement can mean the raters were measuring different constructs, not that they were noisy.
- I5. Tool-versus-human disagreements were split into three layers: lexicon gaps, polysemy or construction failures, and operators whose semantics is genuinely contested (e.g. "only", "many"). Only the first two can be fixed by engineering.
For Mova
How these ideas could serve Mova, our small open language model — its files, stages and tests:
- I1 (learn): Silver data kept only where several witness parsers agree is exactly such a filtered subset. Error patterns or repair rules mined from it should be re-checked on all sentences, including the ones that were dropped.
- I2 (learn): Measured tagger or parser error rates could be injected into evaluation runs as a negative control. This would show whether a reported gain survives realistic upstream noise.
- I3 (learn): Self-induced repair rules should be learned on one sample and scored on a separate held-out sample that never feeds back into the rules.
- I4 (learn): Prompts for LLM teacher tiers should state the exact judgment target, such as trigger presence versus entailment direction, before their labels are trusted or compared.
- I5 (world): Monotonicity entries in the compiled knowledge layer could carry a "contested" flag for operators like "only" and "many". The world builder would then keep both readings explicitly rather than committing to one.
Institutions
Fields, topics and concepts
📚 Shelves 8The field of science this work belongs to (OpenAlex fields).Computer Science · 16,667 worksArtificial Intelligence · 16,194 worksArts and Humanities · 16,039 worksLanguage and Linguistics · 15,891 worksSocial Sciences · 1,772 worksPsychology · 1,552 worksExperimental and Cognitive Psychology · 870 worksGeneral Social Sciences · 227 works
🧭 Topics 1Research subjects and languages the work is about.Reasoning · 1,426 works
Cite
Cite as Haram Choi. 2026. Selection Shapes the Boundary: A Preregistered Replication of Monotonicity and Label Agreement in Unselected NLI Populations. arXiv:2607.19231.
@misc{choi2026selection,
title = {{Selection Shapes the Boundary: A Preregistered Replication of Monotonicity and Label Agreement in Unselected NLI Populations}},
author = {Haram Choi},
year = {2026},
doi = {10.48550/arxiv.2607.19231},
eprint = {2607.19231},
archivePrefix = {arXiv},
url = {https://doi.org/10.48550/arxiv.2607.19231}
}References
- Samuel R. Bowman, Gabor Angeli, Christopher Potts, and Christopher D. Manning. 2015. A large annotated corpus for learning natural language inference. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 632–642, Lisbon, Portugal. Association for Computational Linguistics. ↗
- Rollin Brant. 1990. Assessing proportionality in the proportional odds model for ordinal logistic regression. Biometrics, 46(4):1171–1178. ↗
- Haram Choi. 2026. How much human label variation does formal semantic structure explain?: Group-level effects and item-level ceilings in NLI. Preprint, arXiv:2607.15870. ArXiv preprint, v1, submitted 2026-07-17. ↗
- Pritam Kadasi and Mayank Singh. 2023. Unveiling the multi-annotation process: Examining the influence of annotation quantity and instance difficulty on model performance. In Findings of the Association for Computational Linguistics: EMNLP 2023, pages 1371–1388, Singapore. Association for Computational Linguistics. find
- Bill MacCartney. 2009. Natural Language Inference. Ph.D. thesis, Stanford University. find
- Yixin Nie, Xiang Zhou, and Mohit Bansal. 2020. What can we learn from collective human opinions on natural language inference data? In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 9131–9143, Online. Association for Computational Linguistics.
- Barbara H. Partee. 1989. Many quantifiers. In Proceedings of the 5th Eastern States Conference on Linguistics, pages 383–402, Columbus, OH. Ohio State University. Reprinted in Compositionality in Formal Semantics: Selected Papers by Barbara H. Partee, pages 241–258, Blackwell, Oxford, 2004. find
- Ellie Pavlick and Tom Kwiatkowski. 2019. Inherent disagreements in human textual inferences. Transactions of the Association for Computational Linguistics, 7:677–694. ↗
- Barbara Plank. 2022. The “problem” of human label variation: On ground truth in data, modeling and evaluation. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, pages 10671–10682, Abu Dhabi, United Arab Emirates. Association for Computational Linguistics. ↗
- Jessica Rett. 2018. The semantics of many, much, few, and little. Language and Linguistics Compass, 12(1):e12269. ↗
- Kai von Fintel. 1999. NPI licensing, Strawson entailment, and context dependency. Journal of Semantics, 16(2):97–148. ↗
- Adina Williams, Nikita Nangia, and Samuel R. Bowman. 2018. A broad-coverage challenge corpus for sentence understanding through inference. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 1112–1122, New Orleans, Louisiana. Association for Computational Linguistics.
- Hitomi Yanaka, Koji Mineshima, Daisuke Bekki, Kentaro Inui, Satoshi Sekine, Lasha Abzianidze, and Johan Bos. 2019. Can neural networks understand monotonicity reasoning? In Proceedings of the 2019 ACL Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP, pages 31–40, Florence, Italy. Association for Computational Linguistics. ↗
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/papers/choi-2026-selection-shapes-boundary-preregistered-replication/