“…The second feature group contains different algorithms for quantifying the difference between pairs of scanpaths. They were used by 11 publications (Glady et al, 2013 ; Jiang et al, 2016 ; French et al, 2017 ; Shi et al, 2017 ; Castner et al, 2018 ; Król and Król, 2019 ; Li et al, 2019 ; Necka et al, 2019 ; Sáiz Manzanares et al, 2020 ; Liaqat et al, 2021 ; Appel et al, 2022 ). Across the publications, we found the following algorithms: Levenshtein Distance (Levenshtein, 1966 ), Mannan Distance (Mannan et al, 1997 ), Uniform Distance model, City Block Distance, Euclidian Distance, Hausdorff Distance, Frechett Distance, Vector-Based Comparison (Jarodzka et al, 2010 ), Dynamic Time Warping (DTW) (Müller, 2007 ), FastDTW (Salvador and Chan, 2007 ), Contrast mining (Dong and Bailey, 2012 ), Needleman-Wunsch Algorithm (Needleman and Wunsch, 1970 ), in addition to SubsMatch (Kübler et al, 2017 ) and ScanMatch (Cristino et al, 2010 ) which both use the Needleman-Wunsch Algorithm.…”