Hello 
,
I am working on a deduplication project in O(n) time by using precomputed clusterIDs.
It is working pretty well already but I found out that by collapsing id with a levenshtein distance between IDs, it is WAY better (like almost perfect). For the moment i am using collapse_query and i don't want to injure the query time too much. I was wondering if there is a way to do that, and if not, how can i ask for this feature to be implemented ?
Thank you
This topic was automatically closed 28 days after the last reply. New replies are no longer allowed.