I am trying to calculate edit distances of a string against a collection to find the closest match. My current problem is that the collection is very large (about 25000 item
If your criteria for 'similar' define a total ordering, you should be able to define a Comparator and use a TreeSet to find the closest matches (eg using the ceiling and floor methods).