Finally, to examine two regions’ autosuggestions for a set of names, we sum about their Damerau-Levenshtein distances with regard to their autosuggestion strings for each and every of these names. To look at two strings of autosuggestions, we compute their Damerau-Levenshtein distance, a frequent distance metric utilized on strings, exactly where we look at two specific autosuggestions equivalent only if they are equivalent.