Abstract: Techniques for generating internet domain name suggestions using machine learning are presented. Some techniques include obtaining sets of domain names, each set of domain names including domain names that concern a selected topic, training machine learning algorithms, such that trained language models are produced, each trained language model concerning a different selected topic, obtaining a seed domain name, identifying a primary topic that the seed domain name concerns, applying to the seed domain name a trained language model of the trained language models that concerns the primary topic, such that a primary proposed domain name is produced, where the primary proposed domain name concerns the primary topic and includes the seed domain name and at least one of a prefix or a suffix, and offering to register the primary proposed domain name.

Abstract: Techniques for generating internet domain name suggestions using machine learning are presented. Some techniques include obtaining sets of domain names, each set of domain names including domain names that concern a selected topic, training machine learning algorithms, such that trained language models are produced, each trained language model concerning a different selected topic, obtaining a seed domain name, identifying a primary topic that the seed domain name concerns, applying to the seed domain name a trained language model of the trained language models that concerns the primary topic, such that a primary proposed domain name is produced, where the primary proposed domain name concerns the primary topic and includes the seed domain name and at least one of a prefix or a suffix, and offering to register the primary proposed domain name.

Abstract: Provided are methods, devices, and computer-readable media for generating a string of characters based on a set of rules; parsing the string of characters into string of graphemes; determining one or more phonetic representations for one or more graphemes in the string of graphemes based on a first data structure; determining at least one grapheme representation for one or more of the one or more phonetic representations based on a second data structure; and constructing the phonetic representation of the string of characters based on the grapheme representation that was determined.

Abstract: Provided is a method, device, and computer-readable medium for converting a string of characters in a first language into a phonetic representation of a second language using a first data structure that maps graphemes in the first language to one or more universal phonetic representations based on an international phonetic alphabet, wherein the first data structure comprises a plurality of first nodes with each first node of the plurality of first nodes having a respective weight assigned that corresponds to a likely pronunciation of a grapheme, and a second data structure that maps the one or more universal phonetic representations to one or more graphemes in the second language, wherein the second data structure comprises a plurality of second nodes with each second node of the plurality of second nodes having a respective weight assigned that corresponds to a likely representation of a grapheme in the second language.

Abstract: A method can include receiving, from a user, a string of characters. The method can also include determining components of the string of characters. The components of the string of characters may include one or more graphemes that are related in the string of characters. The method can include determining universal phonetic representations for the components of the string of characters. The method can also include determining pronunciations for the universal phonetic representations. Additionally, the method can include constructing a pronunciation of the string of characters based at least partially on the pronunciations of the universal phonetic representations. Further, the method can include sending, to the user, a sound file representing the pronunciation of the string of characters.

Abstract: Provided are methods, devices, and computer-readable media for accessing a string of characters; parsing the string of characters into string of graphemes; determining one or more phonetic representations for one or more graphemes in the string of graphemes based on a first data structure; determining at least one grapheme representation for one or more of the one or more phonetic representations based on a second data structure; and constructing the phonetic representation of the string of characters based on the grapheme representation that was determined.

Abstract: A method can include receiving, from a user, a string of characters. The method can also include determining components of the string of characters. The components of the string of characters may include one or more graphemes that are related in the string of characters. The method can include determining universal phonetic representations for the components of the string of characters. The method can also include determining pronunciations for the universal phonetic representations. Additionally, the method can include constructing a pronunciation of the string of characters based at least partially on the pronunciations of the universal phonetic representations. Further, the method can include sending, to the user, a sound file representing the pronunciation of the string of characters.

Abstract: Provided is a method, device, and computer-readable medium for converting a string of characters in a first language into a phonetic representation of a second language using a first data structure that maps graphemes in the first language to one or more universal phonetic representations based on an international phonetic alphabet, wherein the first data structure comprises a plurality of first nodes with each first node of the plurality of first nodes having a respective weight assigned that corresponds to a likely pronunciation of a grapheme, and a second data structure that maps the one or more universal phonetic representations to one or more graphemes in the second language, wherein the second data structure comprises a plurality of second nodes with each second node of the plurality of second nodes having a respective weight assigned that corresponds to a likely representation of a grapheme in the second language.

Abstract: Provided are methods, devices, and computer-readable media for generating a string of characters based on a set of rules; parsing the string of characters into string of graphemes; determining one or more phonetic representations for one or more graphemes in the string of graphemes based on a first data structure; determining at least one grapheme representation for one or more of the one or more phonetic representations based on a second data structure; and constructing the phonetic representation of the string of characters based on the grapheme representation that was determined.

Abstract: Provided are methods, devices, and computer-readable media for accessing a string of characters; parsing the string of characters into string of graphemes; determining one or more phonetic representations for one or more graphemes in the string of graphemes based on a first data structure; determining at least one grapheme representation for one or more of the one or more phonetic representations based on a second data structure; and constructing the phonetic representation of the string of characters based on the grapheme representation that was determined.