- * 1. Coarse reduction of the required comparisons
- * 1a. Each group has a 'key', which is the string that triggered the creation
- * of the group
- * 1b. Input strings are only compared against group keys rather than all known
- * strings, reducing the complexity to the current number of groups rather
- * than all known strings. Note due the pathological case where the number
- * of groups is equal to the number of known strings the algorithm still
- * has O(n^2) computational complexity
+ * 1. Coarse reduction of the required comparisons. Each group has a 'key',
+ * which is the string that triggered the creation of the group. Input strings
+ * are only compared against group keys rather than all known strings, reducing
+ * the complexity to the current number of groups rather than all known
+ * strings. Note due the pathological case where the number of groups is equal
+ * to the number of known strings the algorithm still has O(n^2) computational
+ * complexity