Abstract
This paper presents new representations of token sequences, with and without associated quantities, in Euclidean space. The representations are free of assumptions about the nature of the sequences or the processes that generate them. Algorithms and applications from the domains of structured interviews and life histories are discussed.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Elzinga, C. Combinatorial Representations of Token Sequences. Journal of Classification 22, 87–118 (2005). https://doi.org/10.1007/s00357-005-0007-6
Issue Date:
DOI: https://doi.org/10.1007/s00357-005-0007-6