# US 2024/0203396 A1 · Unambiguous phonics system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0203396 A1
- Document ID: US20240203396A1
- Status: Published application
- Kind: A1
- Application number: 18/536,818
- Filed: 2023-12-12
- Published: 2024-06-20
- Earliest claimed: 2019-12-11
- Assignees: Tinyivy, Inc.
- Applicants: Tinyivy, Inc.
- Inventors: Zachary SILVERZWEIG
- Web page: https://patentgrep.com/patent/US20240203396A1

## CPC

- G06F 40/55: Rule-based translation
- G10L 13/08: Text analysis or generation of parameters for speech synthesis out of text, e.g. grapheme to phoneme translation, prosody generation or stress or intonation determination
- G09B 19/04: Speaking (with audible presentation of the material to be studied G09B5/04)
- G09B 19/06: Foreign languages (with audible presentation of material to be studied G09B5/04)
- G10L 13/04: Details of speech synthesis systems, e.g. synthesiser structure or memory management
- G06F 40/126: Character encoding
- G06F 40/205: Parsing
- G06F 40/242: Dictionaries
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G09B: EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS (devices for psychotechnics or for testing reaction times A61B5/16; games, sports, amusements A63; projectors, projector screens G03B)

## Abstract

An unambiguous phonics system (UPS) is capable of presenting text in a format with unambiguous pronunciation. The system can translate input text written in a given language (e.g., English) into a UPS representation of the text written in a UPS alphabet. A unique UPS grapheme can be used to represent each unique grapheme-phoneme combination in the input text. Thus, each letter of the input text is represented in the UPS spelling and each letter of the UPS spelling unambiguously indicates the phoneme used. For all the various grapheme-phoneme combinations for a given input grapheme, the corresponding UPS graphemes can be constructed to have visual similarity with the given input grapheme, thus easing an eventual transition from UPS spelling to traditional spelling. The UPS can include translation, complexity scoring, word/phoneme-grapheme searching, and other module. The UPS can also include techniques to provide efficient, level-based training of the UPS alphabet.

## Claims

### Claim 1

A method, comprising:
receiving input text via an interface on a computing device, wherein the input text comprises a string of original graphemes in an original alphabet;
analyzing the provided input text to generate a string of grapheme-phoneme combinations from the string of original graphemes;
translating the string of grapheme-phoneme combinations into translation text using a translation alphabet, wherein the translation alphabet comprises a unique grapheme for every possible grapheme-phoneme combination of the original alphabet;
wherein analyzing the provided input text via the interface further includes:
analyzing a collection of literary sources to identify occurrence of each phoneme of an alphabet to determining frequency data, where a lower complexity value is assigned to more frequent phoneme and a high complexity value is assigned to extremely rare phonemes, and
assigning the lower complexity value phonemes to visually simpler graphemes and assigning higher complexity value phonemes to visually complex graphemes; and
outputting the translation text based on the determined frequency data.

### Claim at position 2

-23. (canceled)

### Claim 24 (depends on 1)

The method of claim 1, wherein
dividing a set of phonemes into different levels, a lowest phoneme level includes a collection of low complexity value phonemes and associated graphemes, where a given phoneme level includes a set of new phoneme-grapheme pairs in addition to the set of phonemes-grapheme pairs of a level below,
learning sequentially the phoneme levels by a user.

### Claim 25 (depends on 24)

The method of claim 24, wherein
tracking by a learning vocabulary module, a progress of learning the phoneme-grapheme pairs in the given phoneme level by the user,
automatically identifying new graphene-phoneme pairs to be included in the new phoneme level for the user to learn based on the progress result tracked by the learning vocabulary module.

### Claim 26 (depends on 25)

The method of claim 25, wherein
delivering a digital content written in the translation alphabet to the interface by a digital/print delivery module to output the graphemes of the user's current phoneme level.
