Method for writing a foreign language in a pseudo language phonetically resembling native language of the speaker
First Claim
1. A method of converting a string of characters in a first language into a phonetic representation of a second language, the method comprising:
- receiving the string of characters in the first language;
parsing the string of characters in the first language into a first string of graphemes in the first language;
adding one or more characters to the first string of graphemes to represent missing characters in the string of characters to create a second string of graphemes;
grouping the second string of graphemes into a plurality of pseudo-graphemes based on a probability determined by a trained discrete estimator, wherein two or more graphemes in the string of graphemes that are phonetized together are grouped to a single pseudo-grapheme;
accessing a first data structure that maps each pseudo-grapheme in the string of pseudo-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;
determining one or more phonetic representations for each pseudo-grapheme in the string of pseudo-graphemes in the first language based on the first data structure;
accessing 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;
determining at least one grapheme representation in the second language for one or more of the one or more phonetic representation based on the second data structure; and
constructing the phonetic representation of the string of characters in the second language based on the grapheme representation in the second language that was determined.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
18 Claims
-
1. A method of converting a string of characters in a first language into a phonetic representation of a second language, the method comprising:
-
receiving the string of characters in the first language; parsing the string of characters in the first language into a first string of graphemes in the first language; adding one or more characters to the first string of graphemes to represent missing characters in the string of characters to create a second string of graphemes; grouping the second string of graphemes into a plurality of pseudo-graphemes based on a probability determined by a trained discrete estimator, wherein two or more graphemes in the string of graphemes that are phonetized together are grouped to a single pseudo-grapheme; accessing a first data structure that maps each pseudo-grapheme in the string of pseudo-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; determining one or more phonetic representations for each pseudo-grapheme in the string of pseudo-graphemes in the first language based on the first data structure; accessing 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; determining at least one grapheme representation in the second language for one or more of the one or more phonetic representation based on the second data structure; and constructing the phonetic representation of the string of characters in the second language based on the grapheme representation in the second language that was determined. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A device for converting a string of characters in a first language into a phonetic representation of a second language, the device comprising:
-
a memory containing instructions; and at least one processor, operably connected to the memory, the executes the instructions to perform operations comprising; receiving the string of characters in the first language; parsing the string of characters in the first language into a first string of graphemes in the first language; adding one or more characters to the first string of graphemes to represent missing characters in the string of characters to create a second string of graphemes; grouping the second string of graphemes into a plurality of pseudo-graphemes based on a probability determined by a trained discrete estimator, wherein two or more graphemes in the string of graphemes that are phonetized together are grouped to a single pseudo-grapheme; accessing a first data structure that maps each pseudo-grapheme in the string of pseudo-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; determining one or more phonetic representations for each pseudo-grapheme in the string of pseudo-graphemes in the first language based on the first data structure; accessing 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; determining at least one grapheme representation in the second language for one or more of the one or more phonetic representation based on the second data structure; and constructing the phonetic representation of the string of characters in the second language based on the grapheme representation in the second language that was determined. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A non-transitory computer-readable medium comprising computer-interpretable instructions which, when executed by at least one electronic processor, cause the at least one electronic processor to perform a method of converting a string of characters in a first language into a phonetic representation of a second language, the method comprising:
-
receiving the string of characters in the first language; parsing the string of characters in the first language into a first string of graphemes in the first language; adding one or more characters to the first string of graphemes to represent missing characters in the string of characters to create a second string of graphemes; grouping the second string of graphemes into a plurality of pseudo-graphemes based on a probability determined by a trained discrete estimator, wherein two or more graphemes in the string of graphemes that are phonetized together are grouped to a single pseudo-grapheme; accessing a first data structure that maps each pseudo-grapheme in the string of pseudo-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; determining one or more phonetic representations for each pseudo-grapheme in the string of pseudo-graphemes in the first language based on the first data structure; accessing 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; determining at least one grapheme representation in the second language for one or more of the one or more phonetic representation based on the second data structure; and constructing the phonetic representation of the string of characters in the second language based on the grapheme representation in the second language that was determined. - View Dependent Claims (14, 15, 16, 17, 18)
-
Specification