Compare and contrast different similarity measures used in text clustering.

Text clustering involves grouping a set of texts in such a way that texts in the same group (called a cluster) are more similar to each other than to those in other clusters. The similarity measures play a crucial role in text clustering. Here are some of the most commonly used similarity measures:

1. Cosine Similarity: This is a measure of similarity between two non-zero vectors of an inner product space that measures the cosine of the angle between them. In text clustering, it is used to understand how similar two documents (represented as vectors) are irrespective of their size. The value ranges between -1 and 1. If the value is close to 1, it means the documents are very similar, and if it's close to -1, they are dissimilar.

2. Jaccard Similarity: This measure calculates similarity between finite sample sets and is defined as the size of the intersection divided by the size of the union of the sample sets. It's used in cases where the presence of absence of a feature is more important than the occurrences of that feature. The value ranges from 0 to 1, where 0 means the documents share no words, and 1 means the documents are identical.

3. Euclidean Distance: This is the "ordinary" straight-line distance between two points in Euclidean space. In text clustering, it's used to measure the distance between two documents in the vector space. The lower the distance, the more similar the documents are.

4. Manhattan Distance: Also known as City Block Distance, it is the distance between two points in a grid based on a strictly horizontal and/or vertical path (like driving distances in a city). In text clustering, it's used to measure the distance between two documents in the vector space. Like Euclidean, the lower the distance, the more similar the documents are.

5. Hamming Distance: This measure calculates the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other. In text clustering, it's used to measure the similarity between two binary vectors (or strings). The lower the distance, the more similar the strings are.

Each of these similarity measures has its own strengths and weaknesses, and the choice of which to use depends on the specific requirements of the text clustering task at hand.