A Decomposition-Based Approach for Evaluating and Analyzing Inter-Annotator Disagreement
Authors: Effi Levi, Ari Rappoport, Shaul R. Shenhav
Organizations: Department of Computer Science, The Hebrew University of Jerusalem · Department of Political Science, The Hebrew University of Jerusalem
We propose a novel method to conceptually decompose an existing annotation into separate levels, allowing the analysis of inter-annotators disagreement in each level separately. We suggest two distinct strategies in order to actualize this approach: a theoretically-driven one, in which the researcher defines a decomposition based on prior knowledge of the annotation task, and an exploration-based one, in which many possible decompositions are inductively computed and presented to the researcher for interpretation and evaluation. Utilizing a recently constructed dataset for narrative analysis as our use-case, we apply each of the two strategies to demonstrate the potential of our approach in testing hypotheses regarding the sources of annotation disagreements, as well as revealing latent structures and relations within the annotation task. We conclude by suggesting how to extend and generalize our approach, as well as use it for other purposes.
Figures & tables
# Sentences
Comp.
Res.
Suc.
A1
2,209
1,083
448
312
A2
1,135
504
262
137
A3
1,074
569
296
168
Table 1: Annotation statistics: the number of annotated sentences (out of a total of 2,209) and the number of sentences annotated with each of the three narrative elements ( Complication , Resolution and Success ), for each of the three annotators.
PPA
Comp.
Res.
Suc.
Average
A1A2
88.7%
88.2%
92.9%
89.9%
A1A3
90.5%
86.8%
92.7%
90.0%
Average
89.6%
87.5%
92.8%
90.0%
κ
Comp.
Res.
Suc.
Average
A1A2
0.77
0.65
0.68
0.70
A1A3
0.81
0.64
0.72
0.72
Table 2: Overall inter-annotator agreement
Plot
Comp.
Res.
Suc.
Average
A1A2
0.71
0.91
0.77
0.80
0.83
A1A3
0.69
0.91
0.73
0.84
0.83
Average
0.70
0.91
0.75
0.82
0.83
Table 3: Inter-annotator agreement, factored into the two decomposed annotation levels: whether the sentence contains a narrative plot (“ Plot ”), and which narrative elements the sentence contains, given an agreement on Plot (“ Comp. ”, “ Res. ” and “ Suc. ”)
Encoding
Comp.
Res.
Suc.
000
001
010
011
100
101
Table 4: 3-bit Encoding for all the possible label combinations in NEAT
2 nd Level
S1
S2
1 st Level
Complication
Resolution
Success
Average
101
000,001,010,011,100,110,111
0.35
0.80
0.66
0.72
0.72
010,101
000,001,011,100,110,111
0.42
0.83
0.74
0.76
0.78
010
000,001,011,100,101,110,111
0.45
0.83
0.73
0.74
0.77
010,111
000,001,011,100,101,110
0.48
0.84
0.74
0.76
0.78
010,101,111
000,001,011,100,110
0.48
0.84
0.73
0.80
0.79
Table 5: Top ten decompositions with the lowest first-level inter-annotator agreement scores. S1 and S2 : the decomposition; 1 st Level : inter-annotator agreement ( κ ) on CS1 ; Complication , Resolution and Success : inter-annotator agreement ( κ ) on each element given an agreement on CS1 ; Average : second-level inter-annotator agreement, averaged over the three narrative elements. All the statistics were averaged over the two annotator pairs.
2 nd Level
S1
S2
1 st Level
Complication
Resolution
Success
Average
000,011,101,110
001,010,100,111
0.55
0.94
0.88
0.90
0.91
001,010,100
000,011,101,110,111
0.57
0.94
0.89
0.87
0.90
000,101,110
001,010,011,100,111
0.57
0.94
0.85
0.89
0.89
000,010,101,110
001,011,100,111
0.64
0.93
0.79
0.97
0.89
000,011,110,111
001,010,100,101
0.57
0.94
0.90
0.85
0.89
Table 6: Top ten decompositions with highest second-level inter-annotator agreement scores. S1 and S2 : the decomposition; 1 st Level : inter-annotator agreement ( κ ) on CS1 ; Complication , Resolution and Success : inter-annotator agreement ( κ ) on each element given an agreement on CS1 ; Average : second-level inter-annotator agreement, averaged over the three narrative elements. All the statistics were averaged over the two annotator pairs.
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
2 nd Level
S1
S2
1 st Level
Complication
Resolution
Success
Avergae
000
001,010,011,100,101,110,111
0.70
0.91
0.75
0.82
0.83
001
000,010,011,100,101,110,111
0.60
0.80
0.68
0.81
0.76
010
000,001,011,100,101,110,111
0.45
0.83
0.73
0.74
0.77
011
000,001,010,100,101,110,111
0.57
0.80
0.67
0.75
0.74
100
000,001,010,011,101,110,111
0.74
0.92
0.78
0.73
0.81
Appendix
Table 7: A full summary of the results of the procedure described in Section 4.1 . S1 and S2 : the decomposition; 1 st Level : inter-annotator agreement ( κ ) on CS1 ; Complication , Resolution and Success : inter-annotator agreement ( κ ) on each element given an agreement on CS1 ; Average : second-level inter-annotator agreement, averaged over the three narrative elements. All the statistics were averaged over the two annotator pairs.
Annotator disagreement is widespread in NLP, particularly for subjective and ambiguous tasks such as toxicity detection and stance analysis. While early approaches treated disagreement as noise to be removed, recent work increasingly models it as a meaningful signal reflecting variation in interpretation and perspective. This survey provides a unified view of disagreement-aware NLP methods. We first present a domain-agnostic taxonomy of the sources of disagreement spanning data, task, and annotator factors. We then synthesize modeling approaches using a common framework defined by prediction targets and pooling structure, highlighting a shift from consensus learning toward explicitly modeling disagreement, and toward capturing structured relationships among annotators. We review evaluation metrics for both predictive performance and annotator behavior, and noting that most fairness evaluations remain descriptive rather than normative. We conclude by identifying open challenges and future directions, including integrating multiple sources of variation, developing disagreement-aware interpretability frameworks, and grappling with the practical tradeoffs of perspectivist modeling.
Annotation pipelines in Natural Language Processing (NLP) commonly assume a single latent ground truth per instance and resolve disagreement through label aggregation. Perspectivist approaches challenge this view by treating disagreement as potentially informative rather than erroneous. We present a large-scale analysis of graded health-literacy annotations from 6,323 open-ended COVID-19 responses collected in Ecuador and Peru. Each response was independently labeled by multiple annotators using proportional correctness scores, reflecting the degree to which responses align with normative public-health guidelines, allowing us to analyze the full distribution of judgments rather than aggregated labels. Variance decomposition shows that question-level conceptual difficulty accounts for substantially more variance than annotator identity, indicating that disagreement is structured by the task itself rather than driven by individual raters. Agreement-stratified analyses further reveal that key social-scientific effects, including country, education, and urban-rural differences, vary in magnitude and in some cases reverse direction across levels of inter-annotator agreement. These findings suggest that graded health-literacy evaluation contains both epistemically stable and unstable components, and that aggregating across them can obscure important inferential differences. We therefore argue that strong perspectivist modeling is not only conceptually justified but statistically necessary for valid inference in graded interpretive tasks.
High-quality annotations of structured representations are expensive to collect over large corpora. Manual annotation of structure is laborious, and model-based annotation, although cheaper to generate, requires expensive validation and potentially significant supervision to ensure that the annotation quality is strong enough to be useful downstream. In traditional annotation workflows, annotation of each complete example is performed end-to-end by a single annotator. However, structured annotation is complex, and each aspect of the task represents a unique challenge with an associated inferential load for a given annotator. Modern annotation projects can incorporate heterogeneous groups of annotators, including both models and human annotators with varying domain and linguistic expertise. It remains unclear, however, how to redesign annotation tasks in this setting, where efforts are discriminately allocated across heterogeneous annotators with respect to distinct annotation challenges. We propose to decompose annotation tasks into sub-tasks in order to reduce the aggregate inferential load of annotation projects. Inspired by the notion of centers from centering theory, we introduce a formal model of inferential load based on the degrees of freedom in the space of valid annotations. Using this model, we show that identifying these centers (i.e. salient anchor entities realized by annotation sub-tasks) constrains the output space complexity, and decompositions which isolate and advance center identification reduce the aggregate inferential load. We provide guidelines for decomposing complex structured annotation tasks, supported by examples demonstrating improved cost-efficiency from our prior work. Finally, we present a procedure for allocating sub-tasks across annotators to maximize quality under a fixed budget.