Two applications of string algorithms in human-computer interaction are reviewed: one for comparing error rates of text entry techniques, another for abstracting collections of scan paths (paths of eye movements). For both applications, the classic string edit distance algorithm proves useful. For the latter application shortest common supersequences provide one option for further development. Applying them as such could be misleading, but a suitable approximation could provide a useful representation of a set of scan paths. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Räihä, K. J. (2010). Some applications of string algorithms in human-computer interaction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6060 LNCS, pp. 196–209). https://doi.org/10.1007/978-3-642-12476-1_14
Mendeley helps you to discover research relevant for your work.