ACM Home Page
Please provide us with feedback. Feedback
Measuring errors in text entry tasks: an application of the Levenshtein string distance statistic
Full text PdfPdf (183 KB)
Source Conference on Human Factors in Computing Systems archive
CHI '01 extended abstracts on Human factors in computing systems table of contents
Seattle, Washington
SESSION: Short talks: interaction techniques table of contents
Pages: 319 - 320  
Year of Publication: 2001
ISBN:1-58113-340-5
Authors
R. William Soukoreff  York University, Toronto, Ontario
I. Scott MacKenzie  York University, Toronto, Ontario
Sponsor
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 57,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/634067.634256
What is a DOI?

ABSTRACT

We propose a new technique based on the Levenshtein minimum string distance statistic for measuring error rates in text entry research. The technique obviates the need to artificially constrain subjects to maintain synchronization with the presented text, thus affording a more natural interaction style in the evaluation. Methodological implications are discussed, including the additional need to use keystrokes per characters (KSPC) as a dependent measure to capture the overhead in correcting errors.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Kruskal, J. B. An overview of sequence comparison, Time warps, string edits, and macromolecules: The theory and practice of sequence comparison, ed. D. Sankoff, and J. B. Kruskal. (Reading, MA: Addison-Wesley, 1983) 382.
 
2
Levenshtein, V. I. Binary codes capable of correcting deletions, insertions and reversals, Soviet Physics-Doklady 10 (1966), 707-710.
3

CITED BY  21

Collaborative Colleagues:
R. William Soukoreff: colleagues
I. Scott MacKenzie: colleagues