Krippendorff's alpha explained

Krippendorff's alpha coefficient,^[1] named after academic Klaus Krippendorff, is a statistical measure of the agreement achieved when coding a set of units of analysis. Since the 1970s, alpha has been used in content analysis where textual units are categorized by trained readers, in counseling and survey research where experts code open-ended interview data into analyzable terms, in psychological testing where alternative tests of the same phenomena need to be compared, or in observational studies where unstructured happenings are recorded for subsequent analysis.

Krippendorff's alpha generalizes several known statistics, often called measures of inter-coder agreement, inter-rater reliability, reliability of coding given sets of units (as distinct from unitizing) but it also distinguishes itself from statistics that are called reliability coefficients but are unsuitable to the particulars of coding data generated for subsequent analysis.

Krippendorff's alpha is applicable to any number of coders, each assigning one value to one unit of analysis, to incomplete (missing) data, to any number of values available for coding a variable, to binary, nominal, ordinal, interval, ratio, polar, and circular metrics (note that this is not a metric in the mathematical sense, but often the square of a mathematical metric, see levels of measurement), and it adjusts itself to small sample sizes of the reliability data. The virtue of a single coefficient with these variations is that computed reliabilities are comparable across any numbers of coders, values, different metrics, and unequal sample sizes.

Software for calculating Krippendorff's alpha is available.^{[2] [3] [4] [5] [6] [7] [8] [9] [10]}

Reliability data

Reliability data are generated in a situation in which m ≥ 2 jointly instructed (e.g., by a code book) but independently working coders assign any one of a set of values 1,...,V to a common set of N units of analysis. In their canonical form, reliability data are tabulated in an m-by-N matrix containing N values v_ij that coder c_i has assigned to unit u_j. Define m_j as the number of values assigned to unit j across all coders c. When data are incomplete, m_j may be less than m. Reliability data require that values be pairable, i.e., m_j ≥ 2. The total number of pairable values is

\sum ^{N} _{j =1} m _{j} = n ≤ mN.

To help clarify, here is what the canonical form looks like, in the abstract:

	u1	u2	u3	...	uN
c1	v11	v12	v13	⋯	v1N
c2	v21	v22	v23	⋯	v2N
c3	v31	v32	v33	⋯	v3N
⋮	⋮	⋮	⋮	⋱	⋮
cm	vm1	vm2	vm3	⋯	vmN

General form of alpha

We denote by

R the set of all possible responses an observer can give. The responses of all observers for an example is called a unit (it forms a multiset). We denote a multiset with these units as the items, U .

Alpha is given by:

\alpha =1- (D _{o})/(D _{e}) where D _{o} is the disagreement observed and D _{e} is the disagreement expected by chance.D _{o} = (1)/(n) \sum _{c} \sum _{k} \delta(c, k) \sum _{u} m _{u} (n _{cku})/(P(m _{u,} 2 )) where \delta is a metric function (note that this is not a metric in the mathematical sense, but often the square of a mathematical metric, see below), n is the total number of pairable elements, m _{u} is the number of items in a unit, n _{cku} number of (c,k) pairs in unit u , and P is the permutation function. Rearranging terms, the sum can be interpreted in a conceptual way as the weighted average of the disagreements of the individual units---weighted by the number of coders assigned to unit j:D _{o} = (1)/(n) \sum ^{N} _{j =1} m _{j} E (\delta _{j)}

where

E (\delta _{j)} is the mean of the m _{j} \choose 2 numbers \delta(v _{ij} , v _{i'j} ) (here i > i' and define pairable elements). Note that in the case m _{j} = m for all j , D _{o} is just the average all the numbers \delta(v _{ij} , v _{i'j} ) with i > i' . There is also an interpretation of D _{o} as the (weighted) average observed distance from the diagonal.D _{e} = (1)/(P(n, 2 )) \sum _{c} \sum _{k} \delta(c, k) P _{ck} where P _{ck} is the number of ways the pair (c, k) can be made. This can be seen to be the average distance from the diagonal of all possible pairs of responses that could be derived from the multiset of all observations.P _{ck} = \begin{cases} c \ne k & n _{c} n _{k} \\ c = k & n _{c} (n _{c} - 1 ) \end{cases}

The above is equivalent to the usual form of

\alpha once it has been simplified algebraically.^[11]

One interpretation of Krippendorff's alpha is:

\alpha = 1 - (D _{withinunits})/(D _{withinandbetweenunits})

\alpha = 1 indicates perfect reliability

\alpha = 0 indicates the complete absence of reliability. Units and the values assigned to them are statistically unrelated.

\alpha < 0 when disagreements are systematic and exceed what can be expected by chance.

In this general form, disagreements D_o and D_e may be conceptually transparent but are computationally inefficient. They can be simplified algebraically, especially when expressed in terms of the visually more instructive coincidence matrix representation of the reliability data.

Coincidence matrices

A coincidence matrix cross tabulates the n pairable values from the canonical form of the reliability data into a v-by-v square matrix, where v is the number of values available in a variable. Unlike contingency matrices, familiar in association and correlation statistics, which tabulate pairs of values (cross tabulation), a coincidence matrix tabulates all pairable values. A coincidence matrix omits references to coders and is symmetrical around its diagonal, which contains all perfect matches, v_iu = v_i'u for two coders i and i' , across all units u. The matrix of observed coincidences contains frequencies:

\begin{align} o _{vv'} & = \sum ^{N} _{u =1} (\sum ^{m} _{i \ne i'} I(v _{iu} = v) ⋅ I(v _{i'u} = v'))/(m _{u} -1) = o _{v'v} , \\[ 5 pt] n _{v} & = \sum ^{V} _{\ell =1} o _{v\ell} = \sum ^{m,N} _{v _{ij}} I(v _{ij} = v) and n = \sum ^{V} _{\ell =1 ,p =1} o _{\ell} , \end{align}

omitting unpaired values, where I(∘) = 1 if ∘ is true, and 0 otherwise.

Because a coincidence matrix tabulates all pairable values and its contents sum to the total n, when four or more coders are involved, o_ck may be fractions.

The matrix of expected coincidences contains frequencies:

e _{vv'} = (\sum ^{m} _{i \ne i'} I(v _{iu} = v) ⋅ I(v _{i'u} = v'))/(n -1) = (1)/(n -1) ⋅ \left.\begin{cases} n _{v(n} _{v-1)} & if v = v' \\ n _{vn} _{v'} & if v \ne v' \end{cases} \right\} = e _{kc} , which sum to the same n_c, n_k, and n as does o_ck. In terms of these coincidences, Krippendorff's alpha becomes:

\alpha = 1- (D _{o})/(D _{e}) = 1 - (\sum ^{V} _{v =1 ,v' =1} o _{vv'} \delta(v,v'))/(\sum ^{V} _{v =1 ,v' =1} e _{vv'} \delta(v,v')) .

Difference functions

Difference functions

\delta(v,v') ^[12] between values v and v' reflect the metric properties (levels of measurement) of their variable.

In general:

\begin{align} \delta (v,v') & \ge 0 \\[ 4 pt] \delta(v,v) & = 0 \\[ 4 pt] \delta(v,v') & = \delta(v',v) \end{align}

In particular:

For nominal data

\delta _{nominal(v,v')} = \begin{cases} 0 & if v = v' \\ 1 & if v \ne v' \end{cases} , where v and v' serve as names.

For ordinal data

\delta _{ordinal(v,v')} = \left ( \sum ^{g = v'} _{g = v} n _{g} - (n _{v} + n _{v'})/(2) \right ) ^{2} , where v and v′ are ranks.

For interval data

\delta _{interval(v,v')} = (v - v') ^{2} , where v and v′ are interval scale values.

For ratio data

\delta _{ratio(v,v')} = \left ( (v - v')/(v + v') \right ) ^{2} , where v and v′ are absolute values.

For polar data

\delta _{polar(v,v')} = ((v - v') ^{2})/((v + v' -2 v _{min} )( 2 v _{max} - v - v')) , where v_min and v_max define the end points of the polar scale.

For circular data

\delta _{circular(v,v')} = \left ( \sin \left [ 180 (v - v')/(U) \right ] \right ) ^{2} , where the sine function is expressed in degrees and U is the circumference or the range of values in a circle or loop before they repeat. For equal interval circular metrics, the smallest and largest integer values of this metric are adjacent to each other and U = v_largest – v_smallest + 1.

Significance

Inasmuch as mathematical statements of the statistical distribution of alpha are always only approximations, it is preferable to obtain alpha’s distribution by bootstrapping.^{[13] [14]} Alpha's distribution gives rise to two indices:

• The confidence intervals of a computed alpha at various levels of statistical significance
• The probability that alpha fails to achieve a chosen minimum, required for data to be considered sufficiently reliable (one-tailed test). This index acknowledges that the null-hypothesis (of chance agreement) is so far removed from the range of relevant alpha coefficients that its rejection would mean little regarding how reliable given data are. To be judged reliable, data must not significantly deviate from perfect agreement.

The minimum acceptable alpha coefficient should be chosen according to the importance of the conclusions to be drawn from imperfect data. When the costs of mistaken conclusions are high, the minimum alpha needs to be set high as well. In the absence of knowledge of the risks of drawing false conclusions from unreliable data, social scientists commonly rely on data with reliabilities α ≥ 0.800, consider data with 0.800 > α ≥ 0.667 only to draw tentative conclusions, and discard data whose agreement measures α < 0.667.^[15]

A computational example

Let the canonical form of reliability data be a 3-coder-by-15 unit matrix with 45 cells:

	Units u:	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Coder A						3	4	1	2	1	1	3	3		3
Coder B	1		2	1	3	3	4	3
Coder C			2	1	3	4	4		2	1	1	3	3		4

Suppose “*” indicates a default category like “cannot code,” “no answer,” or “lacking an observation.” Then, * provides no information about the reliability of data in the four values that matter. Note that unit 2 and 14 contains no information and unit 1 contains only one value, which is not pairable within that unit. Thus, these reliability data consist not of mN = 45 but of n = 26 pairable values, not in N = 15 but in 12 multiply coded units.

The coincidence matrix for these data would be constructed as follows:

o₁₁ = : $\backslash frac\; +$ : $\backslash frac\; +$ : $\backslash frac\; =6$

o₁₃ = : $\backslash frac\; =1=$ o₃₁

o₂₂ = : $\backslash frac\; +$ : $\backslash frac\; =4$

o₃₃ = : $\backslash frac\; +$ : $\backslash frac\; +$ : $\backslash frac\; +$ : $\backslash frac\; =7$

o₃₄ = : $\backslash frac\; +$ : $\backslash frac\; =2=$ o₄₃

o₄₄ = : $\backslash frac\; =3$

Values v or v′:	1	2	3	4	nv
Value 1	6		1		7
Value 2		4			4
Value 3	1		7	2	10
Value 4			2	3	5
Frequency nv'	7	4	10	5	26

In terms of the entries in this coincidence matrix, Krippendorff's alpha may be calculated from:

\alpha _{metric} = 1 - (D _{o})/(D _{e}) = 1 - (\sum ^{V} _{v =1 ,v' =1} o _{vv'} \delta _{metric(v,v')})/((1)/(\sum ^{V} _{v =1 ,v' =1} n _{v} n _{v'} ~ \delta _{metric(v,v')} n -1)) .

For convenience, because products with

\delta(v,v) = 0 and \delta(v,v') = \delta(v',v) , only the entries in one of the off-diagonal triangles of the coincidence matrix are listed in the following:\alpha _{metric} = 1 - (1 \delta _{metric(1,3)} +2 \delta _{metric(3,4)})/((1)/(( 4 ⋅ 7 \delta _{metric} ( 1 , 2 ) + 10 ⋅ 7 \delta _{metric(1,3)} + 5 ⋅ 7 \delta _{metric(1,4)} + 10 ⋅ 4 \delta _{metric(2,3)} +5 ⋅ 4 \delta _{metric(2,4)} + 5 ⋅ 10 \delta _{metric(3,4))} 26-1))

Considering that all

\delta _{nominal(v,v')} = 1 when v {\ne}v' for nominal data the above expression yields:\alpha _{nominal} = 1 - (1+2)/((1)/(( 4 ⋅ 7 + 10 ⋅ 7 + 5 ⋅ 7 + 10 ⋅ 4 + 5 ⋅ 4 + 5 ⋅ 10 ) 26-1)) =0 . 691

With

\delta _{interval(1,2)=} \delta _{interval(2,3)=} \delta _{interval(3,4)} = 1 ^{2,} \delta _{interval(1,3)} = \delta ^{2 ,} _{interval ( 2 , 4 ) =2} and \delta ^{2 ,} _{interval ( 1 , 4 ) =3} for interval data the above expression yields:\alpha _{interval} = 1 - (1 ⋅ 2 ^{2+2 ⋅ 1} ^{2})/((1)/(( 4 ⋅ 7 ⋅ 1 ^{2+10 ⋅ 7 ⋅ 2} ^{2+5 ⋅ 7 ⋅ 3} ^{2+10 ⋅ 4 ⋅ 1} ^{2+5 ⋅ 4 ⋅ 2} ^{2+5 ⋅ 10 ⋅ 1} ^{2)} 26-1)) = 0 . 811

Here,

\alpha _{interval} > \alpha _{nominal} because disagreements happens to occur largely among neighboring values, visualized by occurring closer to the diagonal of the coincidence matrix, a condition that \alpha _{interval} takes into account but \alpha _{nominal} does not. When the observed frequencies o_{v ≠ v′} are on the average proportional to the expected frequencies e_{v ≠ v'}, \alpha _{interval} = \alpha _{nominal} .

Comparing alpha coefficients across different metrics can provide clues to how coders conceptualize the metric of a variable.

Alpha's embrace of other statistics

Krippendorff's alpha brings several known statistics under a common umbrella, each of them has its own limitations but no additional virtues.

• Scott's pi^[16] is an agreement coefficient for nominal data and two coders. $$\backslash pi\; =\; \backslash frac$$

\textP_o = \sum_c \frac,\textP_e = \sum_c \frac. When data are nominal, alpha reduces to a form resembling Scott's pi: $$\_\backslash text\backslash alpha\; =\; 1\; -\; \backslash frac=\; \backslash frac=\; \backslash frac$$ Scott's observed proportion of agreement

P _{o} appears in alpha’s numerator, exactly. Scott's expected proportion of agreement, $P\_e\; =\; \backslash sum\_c\; \backslash frac$ is asymptotically approximated by $\backslash sum\_c\; \backslash frac$ when the sample size n is large, equal when infinite. It follows that Scott's pi is that special case of alpha in which two coders generate a very large sample of nominal data. For finite sample sizes: { _{nominal\alpha}} = 1 - \tfrac{n -1 }{n} ( 1- \pi) \ge \pi . Evidently, $\backslash lim\_\; =\; \backslash pi$.

• Fleiss’ kappa^[17] is an agreement coefficient for nominal data with very large sample sizes where a set of coders have assigned exactly m labels to all of N units without exception (but note, there may be more than m coders, and only some subset label each instance). Fleiss claimed to have extended Cohen's kappa^[18] to three or more raters or coders, but generalized Scott's pi instead. This confusion is reflected in Fleiss’ choice of its name, which has been recognized by renaming it K:^[19] $$K\; =\; \backslash frac$$

\text\bar P= \frac \sum_^N \sum_c \frac = \sum_c \frac,\text\bar P_e = \sum_c \frac When sample sizes are finite, K can be seen to perpetrate the inconsistency of obtaining the proportion of observed agreements $\backslash bar\; P$ by counting matches within the m(m − 1) possible pairs of values within u, properly excluding values paired with themselves, while the proportion

\bar P _{e} is obtained by counting matches within all (mN)² = n² possible pairs of values, effectively including values paired with themselves. It is the latter that introduces a bias into the coefficient. However, just as for pi, when sample sizes become very large this bias disappears and the proportion $\backslash sum\_c\; \backslash frac$ in _nominalα above asymptotically approximates \bar P _{e} in K. Nevertheless, Fleiss' kappa, or rather K, intersects with alpha in that special situation in which a fixed number of m coders code all of N units (no data are missing), using nominal categories, and the sample size n = mN is very large, theoretically infinite.

• Spearman's rank correlation coefficient rho^[20] measures the agreement between two coders’ ranking of the same set of N objects. In its original form: $$\backslash rho\; =\; 1\; -\; \backslash frac,$$ where $\backslash sum\; D^2\; =\; \backslash sum\_^N\_^2$ is the sum of N differences between one coder's rank c and the other coder's rank k of the same object u. Whereas alpha accounts for tied ranks in terms of their frequencies for all coders, rho averages them in each individual coder's instance. In the absence of ties,

\rho 's numerator $\backslash sum\; D^2=ND\_o$ and \rho 's denominator $\backslash frac=\; \backslash frac\; ND\_e$, where n = 2N, which becomes ND _{e} when sample sizes become large. So, Spearman's rho is that special case of alpha in which two coders rank a very large set of units. Again, { _{ordinal\alpha}} \ge \rho and $\backslash lim\_\; =\; \backslash rho$.

• Pearson's intraclass correlation coefficient r_ii is an agreement coefficient for interval data, two coders, and very large sample sizes. To obtain it, Pearson's original suggestion was to enter the observed pairs of values twice into a table, once as c − k and once as k − c, to which the traditional Pearson product-moment correlation coefficient is then applied.^[21] By entering pairs of values twice, the resulting table becomes a coincidence matrix without reference to the two coders, contains n = 2N values, and is symmetrical around the diagonal, i.e., the joint linear regression line is forced into a 45° line, and references to coders are eliminated. Hence, Pearson's intraclass correlation coefficient is that special case of interval alpha for two coders and large sample sizes,

{ _{interval\alpha}} \ge r _{ii} and $\backslash lim\_\; =\; r\_$.

• Finally, The disagreements in the interval alpha, D_u, D_o and D_e are proper sample variances.^[22] It follows that the reliability the interval alpha assesses is consistent with all variance-based analytical techniques, such as the analysis of variance. Moreover, by incorporating difference functions not just for interval data but also for nominal, ordinal, ratio, polar, and circular data, alpha extends the notion of variance to metrics that classical analytical techniques rarely address.

Krippendorff's alpha is more general than any of these special purpose coefficients. It adjusts to varying sample sizes and affords comparisons across a wide variety of reliability data, mostly ignored by the familiar measures.

Coefficients incompatible with alpha and the reliability of coding

Semantically, reliability is the ability to rely on something, here on coded data for subsequent analysis. When a sufficiently large number of coders agree perfectly on what they have read or observed, relying on their descriptions is a safe bet. Judgments of this kind hinge on the number of coders duplicating the process and how representative the coded units are of the population of interest. Problems of interpretation arise when agreement is less than perfect, especially when reliability is absent.

• Correlation and association coefficients. Pearson's product-moment correlation coefficient r_ij, for example, measures deviations from any linear regression line between the coordinates of i and j. Unless that regression line happens to be exactly 45° or centered, r_ij does not measure agreement. Similarly, while perfect agreement between coders also means perfect association, association statistics register any above chance pattern of relationships between variables. They do not distinguish agreement from other associations and are, hence, unsuitable as reliability measures.
• Coefficients measuring the degree to which coders are statistically dependent on each other. When the reliability of coded data is at issue, the individuality of coders can have no place in it. Coders need to be treated as interchangeable. Alpha, Scott's pi, and Pearson's original intraclass correlation accomplish this by being definable as a function of coincidences, not only of contingencies. Unlike the more familiar contingency matrices, which tabulate N pairs of values and maintain reference to the two coders, coincidence matrices tabulate the n pairable values used in coding, regardless of who contributed them, in effect treating coders as interchangeable. Cohen's kappa,^[23] by contrast, defines expected agreement in terms of contingencies, as the agreement that would be expected if coders were statistically independent of each other.^[24] Cohen's conception of chance fails to include disagreements between coders’ individual predilections for particular categories, punishes coders who agree on their use of categories, and rewards those who do not agree with higher kappa-values. This is the cause of other noted oddities of kappa.^[25] The statistical independence of coders is only marginally related to the statistical independence of the units coded and the values assigned to them. Cohen's kappa, by ignoring crucial disagreements, can become deceptively large when the reliability of coding data is to be assessed.
• Coefficients measuring the consistency of coder judgments. In the psychometric literature,^[26] reliability tends to be defined as the consistency with which several tests perform when applied to a common set of individual characteristics. Cronbach's alpha,^[27] for example, is designed to assess the degree to which multiple tests produce correlated results. Perfect agreement is the ideal, of course, but Cronbach's alpha is high also when test results vary systematically. Consistency of coders’ judgments does not provide the needed assurances of data reliability. Any deviation from identical judgments – systematic or random – needs to count as disagreement and reduce the measured reliability. Cronbach's alpha is not designed to respond to absolute differences.
• Coefficients with baselines (conditions under which they measure 0) that cannot be interpreted in terms of reliability, i.e. have no dedicated value to indicate when the units and the values assigned to them are statistically unrelated. Simple %-agreement ranges from 0 = extreme disagreement to 100 = perfect agreement with chance having no definite value. As already noted, Cohen's kappa falls into this category by defining the absence of reliability as the statistical independence between two individual coders. The baseline of Bennett, Alpert, and Goldstein's S^[28] is defined in terms of the number of values available for coding, which has little to do with how values are actually used. Goodman and Kruskal's lambda_r^[29] is defined to vary between –1 and +1, leaving 0 without a particular reliability interpretation. Lin's reproducibility or concordance coefficient r_c^[30] takes Pearson's product moment correlation r_ij as a measure of precision and adds to it a measure C_b of accuracy, ostensively to correct for r_ijs above mentioned inadequacy. It varies between –1 and +1 and the reliability interpretation of 0 is uncertain. There are more so-called reliability measures whose reliability interpretations become questionable as soon as they deviate from perfect agreement.

Naming a statistic as one of agreement, reproducibility, or reliability does not make it a valid index of whether one can rely on coded data in subsequent decisions. Its mathematical structure must fit the process of coding units into a system of analyzable terms.

Notes

1. Krippendorff, K. (2013) pp. 221–250 describes the mathematics of alpha and its use in content analysis since 1969.
2. Hayes, A. F. & Krippendorff, K. (2007) describe and provide SPSS and SAS macros for computing alpha, its confidence limits and the probability of failing to reach a chosen minimum.
3. https://cran.r-project.org/web/packages/irr/irr.pdf#page.16 Reference manual of the irr package containing the kripp.alpha function
4. http://cswww.essex.ac.uk/Research/nle/arrau/alpha.html The Alpha resources page.
5. http://www.mathworks.com/matlabcentral/fileexchange/36016-krippendorffs-alpha Matlab code to compute Krippendorff's alpha.
6. https://github.com/grrrr/krippendorff-alpha Python code to compute Krippendorff's alpha.
7. https://github.com/pln-fing-udelar/fast-krippendorff Python code for Krippendorff's alpha fast computation.
8. https://ideas.repec.org/cgi-bin/htsearch?ul=%25%2Fc%2F%25&q=krippendorff+%2B+stata&cmd=Search%21&wf=4BFF&s=R&dt=range&db=&de=&m=all&fmt=long&sy=1&ps=10 Several user-written additions to the commercial software Stata are available.
9. https://www.lighttag.io/blog/krippendorffs-alpha/ Open Source Python implementation supporting Dataframes
10. Marzi . Giacomo . Balzano . Marco . Marchiori . Davide . 2024 . K-Alpha Calculator–Krippendorff's Alpha Calculator: A user-friendly tool for computing Krippendorff's Alpha inter-rater reliability coefficient . MethodsX . 12 . 102545 . 10.1016/j.mex.2023.102545 . 2215-0161. 10278/5046412 . free .
11. Web site: Honour. David. Understanding Krippendorff's Alpha.
12. Computing Krippendorff’s Alpha Reliability” http://repository.upenn.edu/asc_papers/43/
13. Krippendorff, K. (2004) pp. 237–238
14. Hayes, A. F. & Krippendorff, K. (2007) Answering the Call for a Standard Reliability Measure for Coding Data http://afhayes.com/public/cmm2007.pdf
15. Krippendorff, K. (2004) pp. 241–243
16. Scott, W. A. (1955)
17. Fleiss, J. L. (1971)
18. Cohen, J. (1960)
19. Siegel, S. & Castellan, N. J. (1988), pp. 284–291.
20. Spearman, C. E. (1904)
21. Pearson, K. (1901), Tildesley, M. L. (1921)
22. Krippendorff, K. (1970)
23. Cohen, J. (1960)
24. Krippendorff, K. (1978) raised this issue with Joseph Fleiss
25. Zwick, R. (1988), Brennan, R. L. & Prediger, D. J. (1981), Krippendorff (1978, 2004).
26. Nunnally, J. C. & Bernstein, I. H. (1994)
27. Cronbach, L. J. (1951)
28. Bennett, E. M., Alpert, R. & Goldstein, A. C. (1954)
29. Goodman, L. A. & Kruskal, W. H. (1954) p. 758
30. Lin, L. I. (1989)

• K. Krippendorff, 2013, Content Analysis: An Introduction to Its Methodology, 3rd ed. Thousand Oaks, CA, USA: Sage, PP. 221–250

References

• Bennett, Edward M., Alpert, R. & Goldstein, A. C. (1954). Communications through limited response questioning. Public Opinion Quarterly, 18, 303–308.
• Brennan, Robert L. & Prediger, Dale J. (1981). Coefficient kappa: Some uses, misuses, and alternatives. Educational and Psychological Measurement, 41, 687–699.
• Cohen, Jacob (1960). A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20 (1), 37–46.
• Cronbach, Lee, J. (1951). Coefficient alpha and the internal structure of tests. Psychometrika, 16 (3), 297–334.
• Fleiss, Joseph L. (1971). Measuring nominal scale agreement among many raters. Psychological Bulletin, 76, 378–382.
• Goodman, Leo A. & Kruskal, William H. (1954). Measures of association for cross classifications. Journal of the American Statistical Association, 49, 732–764.
• Hayes, Andrew F. & Krippendorff, Klaus (2007). Answering the call for a standard reliability measure for coding data. Communication Methods and Measures, 1, 77–89.
• Krippendorff, Klaus (2013). Content analysis: An introduction to its methodology, 3rd edition. Thousand Oaks, CA: Sage.
• Krippendorff, Klaus (1978). Reliability of binary attribute data. Biometrics, 34 (1), 142–144.
• Krippendorff, Klaus (1970). Estimating the reliability, systematic error, and random error of interval data. Educational and Psychological Measurement, 30 (1), 61–70.
• Lin, Lawrence I. (1989). A concordance correlation coefficient to evaluate reproducibility. Biometrics, 45, 255–268.
• Marzi, G., Balzano, M., & Marchiori, D. (2024). K-Alpha Calculator–Krippendorff's Alpha Calculator: A user-friendly tool for computing Krippendorff's Alpha inter-rater reliability coefficient. MethodsX, 12, 102545. https://doi.org/10.1016/j.mex.2023.102545
• Jum C. & Bernstein, Ira H. (1994). Psychometric Theory, 3rd ed. New York: McGraw-Hill.
• Pearson, Karl, et al. (1901). Mathematical contributions to the theory of evolution. IX: On the principle of homotyposis and its relation to heredity, to variability of the individual, and to that of race. Part I: Homotyposis in the vegetable kingdom. Philosophical Transactions of the Royal Society (London), Series A, 197, 285–379.
• Scott, William A. (1955). Reliability of content analysis: The case of nominal scale coding. Public Opinion Quarterly, 19, 321–325.
• Siegel, Sydney & Castella, N. John (1988). Nonparametric Statistics for the Behavioral Sciences, 2nd ed. Boston: McGraw-Hill.
• Tildesley, M. L. (1921). A first study of the Burmes skull. Biometrica, 13, 176–267.
• Spearman, Charles E. (1904). The proof and measurement of association between two things. American Journal of Psychology, 15, 72–101.
• Zwick, Rebecca (1988). Another look at interrater agreement. Psychological Bulletin, 103 (3), 347–387.

External links

• Krippendorff's Alpha online calculator with bootstrap and confidence intervals functions.
• Youtube video about Krippendorff’s alpha using SPSS and a macro.
• Reliability Calculator calculates Krippendorff's alpha.
• Krippendorff Alpha Javascript implementation and library
• Python implementation
• Krippendorff Alpha Ruby Gem implementation and library.
• Simpledorff Python implementation that works with Dataframes