METHOD FOR WRITING A FOREIGN LANGUAGE IN A PSEUDO LANGUAGE PHONETICALLY RESEMBLING NATIVE LANGUAGE OF THE SPEAKER

• US 20170177569A1
• Filed: 12/21/2015
• Published: 06/22/2017
• Est. Priority Date: 12/21/2015
• Status: Active Grant

• Current Assignee: VeriSign, Inc.
• Original Assignee: VeriSign, Inc.
• Inventors: Raemy, Vincent, Russo, Vincenzo, Hennebert, Jean, Wicht, Baptiste
• Granted Patent: US 10,102,203 B2
• Time in Patent Office: Days
• CPC Class Codes: G06F 40/205 Parsing
• CPC Class Codes: G06F 40/47 Machine-assisted translation, e.g. using translation memory
• CPC Class Codes: G06F 40/55 Rule-based translation

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.

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 string of graphemes in the first language;

accessing 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;

determining one or more phonetic representations for one or more graphemes in the string of 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.

2. The method of claim 1, further comprising:

ranking each grapheme representation in the second language to produce a rank list, wherein the ranking is based on a likelihood that a grapheme representation in the second language sounds similar to a pronunciation sound of the string of characters in the second language; and

filtering the ranked list to produce a subset of graphene representations in the second language.

3. The method of claim 1, further comprising creating the first data structure and the second data structure as information gain trees.

4. The method of claim 2, further comprising determining a first composite weight for the one or more phonetic representations based on the first data structure.

5. The method of claim 2, further comprising determining a second composite weight for the one or more grapheme representations based on the second data structure.

6. The method of claim 5, wherein the filtering is based on the second composite weight.

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 string of graphemes in the first language;

accessing 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;

determining one or more phonetic representations for one or more graphemes in the string of 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.

8. The device of claim 7, wherein the at least one processor is further operable to perform the method comprising:

ranking each grapheme representation in the second language to produce a rank list, wherein the ranking is based on a likelihood that a grapheme representation in the second language sounds similar to a pronunciation sound of the string of characters in the second language; and

filtering the ranked list to produce a subset of graphene representations in the second language.

9. The device of claim 7, wherein the at least one process is further operable to perform the method comprising creating the first data structure and the second data structure as information gain trees.

10. The device of claim 8, wherein the at least one processor is further operable to perform the method comprising determining a first composite weight for the one or more phonetic representations based on the first data structure.

11. The device of claim 8, wherein the at least one processor is further operable to perform the method comprising determining a second composite weight for the one or more grapheme representations based on the second data structure.

12. The device of claim 11, wherein the filtering is based on the second composite weight.

13. A 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 string of graphemes in the first language;

accessing 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;

determining one or more phonetic representations for one or more graphemes in the string of 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.

14. The computer-readable medium of claim 13, further comprising:

ranking each grapheme representation in the second language to produce a rank list, wherein the ranking is based on a likelihood that a grapheme representation in the second language sounds similar to a pronunciation sound of the string of characters in the second language; and

filtering the ranked list to produce a subset of graphene representations in the second language.

15. The computer-readable medium of claim 13, further comprising creating the first data structure and the second data structure as information gain trees.

16. The computer-readable medium of claim 14, further comprising determining a first composite weight for the one or more phonetic representations based on the first data structure.

17. The computer-readable medium of claim 14, further comprising determining a second composite weight for the one or more grapheme representations based on the second data structure.

18. The computer-readable medium of claim 17, wherein the filtering is based on the second composite weight.