A common test of memory span is to display or utter a sequence of numbers and then request that a candidate being assessed repeat that sequence of numbers in reverse order. Typically, the candidate's score is the length of the longest sequence that he or she repeated correctly.
Thus, to each sequence produced by the candidate it is assigned a score in $\{0,1\}$, where score $0$ denotes incorrect and score $1$ denotes correct. However, what if the candidate does produce a sequence that differs from the correct sequence merely due to, say, two numbers having been swapped? Does this sequence deserve a score of $0$? In my most humble opinion, permuting the reverse of the given sequence should not be a deadly sin, though it should be penalized.
Is there any work on scoring sequences in which the scores are in $[0,1]$ rather than in $\{0,1\}$?
I thought of using the Levenshtein and Damerau-Levenshtein distances and found several papers on Google Scholar. However, since we are working with sequences of numbers rather than sequences of characters, perhaps other metrics would be more appropriate. I am an utter neophyte, am not familiar with the jargon in the field of psychometrics and I am not convinced that number of citations is a great proxy for quality. Thus, I would rather ask the experts (or non-neophytes). I am happy to start a bounty to motivate those who have invested time and effort in learning psychometrics to post an answer. An answer listing good papers would be excellent.
Related