Literary and Linguistic Computing Advance Access originally published online on July 29, 2005
Literary and Linguistic Computing 2006 21(3):353-362; doi:10.1093/llc/fqi030
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Optimal Strategies for Accurate Transcription
University of Cambridge, UK
Correspondence: Matthew Spencer, Department of Mathematics and Statistics, Dalhousie University, Canada. E-mail: matts{at}mathstat.dal.ca
Accurate transcription is difficult and time-consuming. It is therefore worth choosing the transcription strategy that will yield the smallest number of errors for a given total effort. We use a mathematical model of the transcription process to compare two basic strategies: a single transcription with repeated checking, and a pair of transcriptions with a smaller amount of checking. Our model for checking is an adequate description of the rate of error detection in a real transcription. We show how to optimize the proportion of effort allocated to checking locations where the two transcriptions disagree, and discuss the factors that favour either of the strategies. We suggest how one might design an optimal transcription strategy in practice.