16. The non-transitory computer-readable medium of claim 15 , the method further comprising: ranking each grapheme representation to produce a ranked list, wherein the ranking is based on a likelihood that a grapheme representation sounds similar to a pronunciation sound of the string of characters; and filtering the ranked list to produce a subset of grapheme representations.
16. The non-transitory computer-readable medium of claim 15 , the method further comprising: ranking each grapheme representation to produce a ranked list, wherein the ranking is based on a likelihood that a grapheme representation sounds similar to a pronunciation sound of the string of characters; and filtering the ranked list to produce a subset of grapheme representations. 17. The computer-readable medium of claim 16 , wherein the set of rules includes at least one of a length of the string of characters, at least one character in the string of characters, and a position of at least one character in the string of characters.