8. A computer-implemented method, comprising: receiving a first character set search string comprising one or more characters in a first character set; converting the one or more characters in the first character set to one or more characters in a second character set; executing a search using the one or more characters in the second character set to obtain one or more second character set ranked search results; determining that the one or more ranked search results includes a character in the first character set; and re-ranking the one or more second character set ranked search results based on a match strength, the match strength being determined based on the number of appearances of characters from the first character set in each result in the search results in the second character set.
8. A computer-implemented method, comprising: receiving a first character set search string comprising one or more characters in a first character set; converting the one or more characters in the first character set to one or more characters in a second character set; executing a search using the one or more characters in the second character set to obtain one or more second character set ranked search results; determining that the one or more ranked search results includes a character in the first character set; and re-ranking the one or more second character set ranked search results based on a match strength, the match strength being determined based on the number of appearances of characters from the first character set in each result in the search results in the second character set. 9. The computer-implemented method of claim 8 , the first character set and the second character set comprising any one of a Roman character set, a Chinese character set, a Japanese character set, a Russian character set, a Korean character set, a European character set, and an Arabic character set.