Defect in the string similarity measure algorithm
Defects in the algorithm for computing the word based similarity of strings: If a matching word is contained many times, each matching in counted. So the string similarity can become greater than 1.
The same error occurs in the trigram (n-gram) matching algorithms. Identical tripples in either the query or the case cause an increase of the similarity which can become greater than 1.