Skip to main content icon/video/no-internet

Intercoder Reliability Techniques: Scott’s Pi

Scott’s pi is a measure of intercoder reliability for nominal level data with two coders. Scott’s pi was developed by William A. Scott in 1955. The formula for Scott’s pi is:

π=Pr(a)Pr(e)1Pr(e).

Pr(a) represents the amount of agreement that was observed between the two coders. Pr(e) represents the amount of agreement that is expected between the two coders. Scott’s pi works by comparing the amount of agreement observed between the two coders with how much agreement is expected if both coders chose randomly. If both coders are consistent, the amount of observed agreement will be higher than the amount of agreement that is expected due to chance. In essence, Scott’s pi compares coding results to what would happen if two people coded the data at random. This inclusion of a comparison against agreement that might occur due to chance makes Scott’s pi superior to the percent agreement method.

Scott’s pi shares the same formula as another measure of intercoder reliability, Cohen’s kappa, but they are not the same. Scott’s pi and Cohen’s kappa differ in how they calculate the amount of expected agreement between coders. Cohen’s kappa was developed as an extension of Scott’s pi. This entry examines when to use Scott’s pi, discusses its strengths and weaknesses and how to interpret it, and provides a working example.

When to Use Scott’s Pi

Scott’s pi is only used with nominal level data and can only be applied to situations where there are two coders. If there are more than two coders, Scott’s pi cannot be used, but rather an extension of it known as Fleiss’ kappa can be used. Situations in which there is only one coder do not require a measure of intercoder reliability.

The most common use of Scott’s pi is in textual or content analysis. Scott’s pi allows two coders to go through a text and code for different nominal variables and then to compare their results to determine the extent to which they coded things the same. Having consistency between both coders is essential to content analysis, and Scott’s pi allows a researcher to measure this consistency to detect problems.

The creation of software programs for the coding of text is one area where intercoder reliability can be quite helpful. When designing a program that will analyze and code text according to a set codebook, a researcher wants the computer to be consistent with how it is coding and to ensure that the program is applying the codebook correctly. One way to determine how well a computer program is functioning is to test how the computer and a trained coder both code a data set and then to compare the results. This will allow the researcher to determine whether the program is behaving properly and coding in the same way that a human would.

Strengths and Weaknesses

When attempting to determine how often to expect coders to agree based solely on chance, Scott’s pi takes several factors into account. Scott’s pi takes into account how many different possible categories researchers have, as well as how often each of these categories is used by each coder. This is important because when researchers are developing a codebook, they may have an idea of what they expect to see in the text. Once they actually get into the data and start coding, they may realize that some of the categories they were expecting are simply not there or that there are a few categories that are used significantly more than others. Scott’s pi is able to compensate for this and looks at how often each coder used each category when coming up with an estimate of expected agreement. This makes Scott’s pi a fairly conservative measure of intercoder reliability.

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading