Inter-Annotator Agreement › Fleiss' Kappa

Michael BrenndoerferMarch 8, 20265 min read
Language AI HandbookAll chapters
Part 55 of 67Human and Model Evaluation
Chapter 424Inter-Annotator Agreement › Fleiss' Kappa
Reading section 4 of 11 · Fleiss' Kappa · 5 minSection 4 of 11 · 5 min

Book contents

Section 4 of 11 · 5 min read

Inter-Annotator Agreement › Fleiss' KappaOne section · Sections in this chapter4 / 11 ↓
Reading tools Definitions & inline links

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

Cohen's kappa does not generalize to more than two raters. When you have a crowdsourcing setup with ten workers or a research project where five domain experts each annotate the full corpus, you need a different approach. Fleiss' kappa (1971) extends the concept to any fixed number of raters n≥2n \geq 2, though it assumes the raters are interchangeable rather than distinct individuals.

This assumption of interchangeability is what distinguishes Fleiss' kappa from Cohen's. When you use Fleiss' kappa, you are implicitly treating your raters as random samples from a population of potential annotators, not specific individuals whose particular biases you care about. This makes it appropriate for crowdsourcing platforms like Amazon Mechanical Turk, where annotators are indeed sampled from a large pool.

Mathematical Structure

Consider NN items and kk categories. For each item ii, let nijn_{ij} be the number of raters who assigned it to category jj, where ∑j=1knij=n\sum_{j=1}^{k} n_{ij} = n (each item gets exactly nn ratings). The proportion of raters assigning item ii to category jj is:

pij=nijnp_{ij} = \frac{n_{ij}}{n}

where:

  • nijn_{ij}: the number of raters who assigned item ii to category jj
  • nn: the total number of raters per item
  • pijp_{ij}: the proportion of raters assigning item ii to category jj

The observed agreement for item ii measures the extent to which raters agree on that specific item. Think of it as counting all pairs of raters who agreed and expressing this as a fraction of all possible rater pairs:

Pi=1n(n−1)∑j=1knij(nij−1)=1n(n−1)[(∑j=1knij2)−n]\begin{aligned} P_i &= \frac{1}{n(n-1)} \sum_{j=1}^{k} n_{ij}(n_{ij} - 1) \\ &= \frac{1}{n(n-1)} \left[ \left(\sum_{j=1}^{k} n_{ij}^2\right) - n \right] \end{aligned}

where:

  • PiP_i: the extent of agreement among raters for item ii (ranging from 0 to 1)
  • nijn_{ij}: the count of raters assigning item ii to category jj
  • nn: the total number of raters
  • kk: the number of categories
  • The first form counts agreeing pairs directly; the second simplifies computation using the sum of squares

To understand this formula, consider what happens at the extremes. If all nn raters choose the same category jj, then nij=nn_{ij} = n and nij(nij−1)=n(n−1)n_{ij}(n_{ij} - 1) = n(n-1). The sum equals n(n−1)n(n-1) and Pi=1P_i = 1. If raters split perfectly (each choosing a different category), then nij=1n_{ij} = 1 for each jj and nij(nij−1)=0n_{ij}(n_{ij} - 1) = 0 for all jj, giving Pi=0P_i = 0.

The mean observed agreement across all NN items is:

Po=1N∑i=1NPiP_o = \frac{1}{N} \sum_{i=1}^{N} P_i

where:

  • PoP_o: the mean observed agreement across all items
  • NN: the total number of items being rated
  • PiP_i: the agreement score for item ii

The chance agreement PeP_e uses the proportion of all assignments falling into each category. This is a single pooled distribution across all raters, which reflects the interchangeability assumption:

Pj=1N⋅n∑i=1NnijP_j = \frac{1}{N \cdot n} \sum_{i=1}^{N} n_{ij} Pe=∑j=1kPj2P_e = \sum_{j=1}^{k} P_j^2

where:

  • PjP_j: the overall proportion of assignments to category jj across all items and raters
  • PeP_e: the expected chance agreement (the sum of squared category proportions)

The intuition for Pe=∑jPj2P_e = \sum_j P_j^2 is clean: if we sampled two raters at random and both assigned labels independently from the pooled distribution, the probability they would pick the same category jj is Pj⋅Pj=Pj2P_j \cdot P_j = P_j^2. Summing over all categories gives the total chance agreement.

Fleiss' kappa is then:

κF=Po−Pe1−Pe\kappa_F = \frac{P_o - P_e}{1 - P_e}

where:

  • κF\kappa_F: Fleiss' kappa coefficient
  • PoP_o: the mean observed agreement across items
  • PeP_e: the expected chance agreement based on category proportions

Key Differences from Cohen's Kappa

The most important practical difference between Fleiss' and Cohen's kappa is the choice of marginal distributions. Cohen's kappa uses separate marginals for each rater (pi+p_{i+} for rater 1 and p+ip_{+i} for rater 2). This reflects the fact that rater 1 might use "positive" 70% of the time while rater 2 uses it only 50% of the time. Fleiss' kappa uses a single pooled marginal (PjP_j), treating all raters as if they draw from the same distribution. This pooled approach is identical to what Scott's pi uses for two raters.

This has a subtle but important consequence. If you have exactly two raters with different biases and you apply Fleiss' kappa, you get Scott's pi rather than Cohen's kappa. The two coefficients can give substantially different values when rater biases differ substantially. When choosing between them, consider whether rater-specific tendencies are meaningful information (use Cohen's kappa) or noise to be averaged away (use Fleiss' kappa or Krippendorff's alpha).

When you have many raters or view raters as interchangeable samples from a larger population, Fleiss' kappa is the natural choice. In crowdsourcing research, it is particularly common because the identity of individual workers is less important than the overall reliability of the pool.