Finally, to assess two regions’ autosuggestions for a established of names, we sum over their Damerau-Levenshtein distances with regard to their autosuggestion strings for every of these names. To review two strings of autosuggestions, we compute their Damerau-Levenshtein distance, a popular length metric used on strings, wherever we consider two individual autosuggestions equivalent only if they are equivalent.