Finally, to evaluate two regions’ autosuggestions for a established of names, we sum more than their Damerau-Levenshtein distances with respect to their autosuggestion strings for each of these names. To examine two strings of autosuggestions, we compute their Damerau-Levenshtein distance, a typical length metric used on strings, in which we look at two unique autosuggestions equal only if they are similar.