3. (Thinking assignment) Locality sensitive hash is a way to assign a number (called hash value) to an object so that when I try to find an object r fronm a set of objects that is "similar to a given object a, I only need to compute the hash value of a and compare with hash values of the objects in the set and find those objects with almost the same hash value as a's. Is there any locality sensitive hash scheme for strings