String parsing-based similarity detection

This paper compares the similarity-detection abilities of two string parsing algorithms from the Lempel-Ziv family and the T-decomposition algorithm proposed by Titchener against the Hamming and Levenshtein measures. Our results show that LZ and T-decomposition based measures work in a wider range of contexts. We also argue that T-decomposition based measures represent a good compromise between accuracy and time complexity.